1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
#[macro_use]
extern crate lazy_static;
extern crate prefixtree;

use self::prefixtree::{PrefixTree, prefix_tree_from_str};
use std::collections::HashSet;
use std::path::Path;
use std::io;
use std::fs::File;
use std::io::BufRead;

pub type Dict = PrefixTree<char, bool>;

pub fn create_prefix_tree(words: &[&str]) -> PrefixTree<char, bool> {
    let words_payloads: Vec<(&str, bool)> =
        words.iter().map(|&word| (word, true))
        .collect();
    prefix_tree_from_str(&words_payloads[..])
}

#[derive(Clone, PartialEq, Eq, Copy, Debug)]
pub enum EdgeType {
    Init,
    Dict,
    Unk,
    Punc,
    Latin
}

#[derive(Clone, Copy, Debug)]
pub struct Edge {
    pub w: usize,
    pub unk: usize,
    pub p: usize,
    pub etype: EdgeType
}

impl Edge {

    pub fn is_unk(&self) -> bool {
        self.etype == EdgeType::Unk
    }
    
    pub fn better_than(&self, o: &Edge) -> bool {
        if self.unk < o.unk {
            return true
        }

        if self.unk > o.unk {
            return false
        }

        if self.w < o.w {
            return true
        }

        if self.w > o.w {
            return false
        }

        if o.is_unk() && !self.is_unk() {
            return true
        }

        return false
    }

    pub fn better(a :&Option<Edge>, b:&Option<Edge>) -> bool {
        if a.is_none() {
            return false
        }

        if b.is_none() {
            return true
        }

        return a.unwrap().better_than(&b.unwrap());
    }
}

#[derive(Debug, PartialEq)]
enum State {
    Init,
    Pat,
    PatFinal,
    NonPat,
    NonPatFinal,
}

type CharPredicate = Fn(char) -> bool;

pub struct PatEdgeBuilder {
    i: usize,
    pub start: usize,
    state: State,
    is_pat_char: Box<CharPredicate>,
    etype: EdgeType,
}

impl PatEdgeBuilder {
    pub fn new(is_pat_char: Box<CharPredicate>, etype: EdgeType) -> PatEdgeBuilder {
        PatEdgeBuilder {
            start: 0,
            i: 0,
            state: State::Init,
            is_pat_char: is_pat_char,
            etype: etype,
        }
    }

    fn to_text_state(&mut self, nch: Option<char>) -> State {
        match nch {
            Some(_nch) => {
                if (self.is_pat_char)(_nch) {
                    State::NonPatFinal
                } else {
                    State::NonPat
                }
            }
            None => State::NonPatFinal,
        }
    }

    fn to_space_state(&mut self, nch: Option<char>) -> State {
        match nch {
            Some(_nch) => {
                if (self.is_pat_char)(_nch) {
                    State::Pat
                } else {
                    State::PatFinal
                }
            }
            None => State::PatFinal,
        }
    }

    fn to_another_state(&mut self, ch: char, nch: Option<char>) -> State {
        if (self.is_pat_char)(ch) {
            self.to_space_state(nch)
        } else {
            self.to_text_state(nch)
        }
    }

    pub fn transit(&mut self, ch: char, nch: Option<char>) {
        match self.state {
            State::Init => {
                self.start = self.i;
                self.state = self.to_another_state(ch, nch)
            }
            State::NonPat => {
                self.state = self.to_another_state(ch, nch);
            }
            State::NonPatFinal => {
                self.start = self.i;
                self.state = self.to_space_state(nch);
            }
            State::PatFinal => {
                self.start = self.i;
                self.state = self.to_text_state(nch)
            }
            State::Pat => {
                self.state = self.to_another_state(ch, nch);
            }
        };
        self.i += 1;
    }

    pub fn is_pat_final(&self) -> bool {
        self.state == State::PatFinal
    }
}

pub trait EdgeBuilder {
    fn build(&mut self, context: &EdgeBuildingContext, path: &[Edge]) -> Option<Edge>;
}

pub struct EdgeBuildingContext<'a> {
    pub text: &'a Vec<char>,
    pub i: usize,
    pub ch: char,
    pub left_boundary: usize,
    pub best_edge: Option<Edge>
}

impl EdgeBuilder for PatEdgeBuilder {
    fn build(&mut self, context: &EdgeBuildingContext, path: &[Edge]) -> Option<Edge> {
        let next_char = if context.i + 1 == context.text.len() {
            None
        } else {
            Some(context.text[context.i + 1])
        };
        self.transit(context.ch, next_char);
        if self.is_pat_final() {
            let source = path[self.start];
            Some(Edge {
                p: self.start,
                etype: self.etype,
                w: source.w + 1,
                unk: source.unk,
            })
        } else {
            None
        }
    }
}

fn is_latin(ch: char) -> bool {
    (ch >= 'A' && ch <= 'Z') ||
        (ch >= 'a' && ch <= 'z') 
}

pub fn create_latin_edge_builder() -> PatEdgeBuilder {
    PatEdgeBuilder::new(Box::new(is_latin), EdgeType::Latin)
}

lazy_static! {
    static ref PUNC_SET: HashSet<char> = {
        let mut m = HashSet::new();
        m.insert(' ');
        m.insert('\n');
        m.insert('\t');
        m.insert('\r');
        m.insert('"');
        m.insert('(');
        m.insert(')');
        m.insert('“');
        m.insert('”');
        m
    };
}

fn is_punc(ch: char) -> bool {
    PUNC_SET.contains(&ch)
}

pub fn create_punc_edge_builder() -> PatEdgeBuilder {
    PatEdgeBuilder::new(Box::new(is_punc), EdgeType::Punc)
}


pub struct UnkEdgeBuilder {
}

impl UnkEdgeBuilder {
    pub fn new() -> UnkEdgeBuilder {
        UnkEdgeBuilder{}
    }
}

impl EdgeBuilder for UnkEdgeBuilder {
    fn build(&mut self, context: &EdgeBuildingContext, path: &[Edge]) -> Option<Edge> {
        if context.best_edge.is_some() {
            return None
        }

        let source = path[context.left_boundary];
        Some(Edge{p: context.left_boundary,
                  etype: EdgeType::Unk,
                  unk: source.unk + 1,
                  w: source.w + 1})
    }
}

#[derive(Clone)]
struct Pointer {
    node_id: usize,
    s: usize,
    offset: usize,
    is_final: bool,
}

impl Pointer {
    fn update(&mut self, dict: &Dict, ch: char) -> bool {
        match dict.seek(&(self.node_id as u32, self.offset as u32, ch)) {
            None => false,
            Some(&(child_id, is_final, _)) => {
                self.node_id = child_id as usize;
                self.is_final = is_final;
                self.offset += 1;
                true
            }
        }
    }

    fn gen_edge(&self, path: &[Edge]) -> Edge {
        let source = path[self.s];
        Edge{etype: EdgeType::Dict,
             p: self.s,
             w: source.w + 1,
             unk: source.unk}
    }
}

pub struct DictEdgeBuilder<'a> {
    dict: &'a Dict,
    pointers: Vec<Pointer>,
}

impl<'a> DictEdgeBuilder<'a> {
    pub fn new(dict: &Dict) -> DictEdgeBuilder {
        const MAX_SIZE: usize = 0xFF;
        DictEdgeBuilder {
            dict: dict,
            pointers: Vec::with_capacity(MAX_SIZE)
        }
    }

    fn add_pointer(&mut self, context: &EdgeBuildingContext) {
        self.pointers.push(Pointer {
            node_id: 0,
            offset: 0,
            is_final: false,
            s: context.i,
        });
    }

    fn update_pointers(&mut self, context: &EdgeBuildingContext) {
        let mut j = 0;
        for i in 0..self.pointers.len() {
            let valid = self.pointers[i].update(self.dict, context.ch);
            if valid {
                if j < i {
                    self.pointers[j] = self.pointers[i].clone()
                }
                j += 1
            }
        }
        self.pointers.truncate(j);
    }

    fn gen_edge(&self, pointers: &[Pointer], path: &[Edge]) -> Option<Edge> {
        let mut best_edge: Option<Edge> = None;
        for pointer in pointers {
            if pointer.is_final {
                let edge = pointer.gen_edge(path);
                if best_edge.is_none() {
                    best_edge = Some(edge)
                } else if edge.better_than(&best_edge.unwrap()) {
                    best_edge = Some(edge)
                }
            }
        }
        return best_edge
    }
}

impl<'a> EdgeBuilder for DictEdgeBuilder<'a> {
    fn build(&mut self, context: &EdgeBuildingContext, path: &[Edge]) -> Option<Edge> {
        self.add_pointer(context);
        self.update_pointers(context);
        self.gen_edge(&self.pointers, path)
    }
}

pub fn build_path(dict: &Dict, text: &Vec<char>) -> Vec<Edge> {
    let mut builders: Vec<Box<EdgeBuilder>> =
        vec![Box::new(DictEdgeBuilder::new(dict)),
             Box::new(create_latin_edge_builder()),
             Box::new(create_punc_edge_builder()),
             Box::new(UnkEdgeBuilder::new())];

    let mut path = vec![];
    path.push(Edge {
        w: 0,
        unk: 0,
        p: 0,
        etype: EdgeType::Init,
    });

    let mut context = EdgeBuildingContext {
        text: &text,
        i: 0,
        ch: '\0',
        left_boundary: 0,
        best_edge: None,
    };

    for i in 0..text.len() {
        context.ch = text[i];
        context.i = i;
        context.best_edge = None;
        
        for builder in &mut builders {
            let edge = builder.build(&context, &path);
            if Edge::better(&edge, &context.best_edge) {
                context.best_edge = edge
            }
        }
        
        if context.best_edge.is_none() {
            panic!("Best edge cannot be None")
        }
        
        path.push(context.best_edge.unwrap());
        
        if !context.best_edge.unwrap().is_unk() {
            context.left_boundary = i + 1
        }
    }

    return path
}
#[derive(Debug, PartialEq, Eq)]
pub struct DagEdge {
    pub s: usize,
    pub e: usize,
    pub etype: EdgeType
}

pub type Dag = Vec<Vec<DagEdge>>;

pub trait DagEdgeBuilder {
    fn build_dag_edges(&mut self, context: &EdgeBuildingContext) -> Vec<DagEdge>;
}

impl<'a> DagEdgeBuilder for DictEdgeBuilder<'a> {
    fn build_dag_edges(&mut self, context: &EdgeBuildingContext) -> Vec<DagEdge> {
        self.add_pointer(context);
        self.update_pointers(context);
        //self.gen_edge(&self.pointers, path)
        self.pointers
            .iter()
            .filter(|p| p.is_final)
            .map(|p| DagEdge {s: p.s, e: context.i + 1, etype: EdgeType::Dict})
            .collect()
    }
}

impl DagEdgeBuilder for PatEdgeBuilder {
    fn build_dag_edges(&mut self, context: &EdgeBuildingContext) -> Vec<DagEdge> {
        let next_char = if context.i + 1 == context.text.len() {
            None
        } else {
            Some(context.text[context.i + 1])
        };
        self.transit(context.ch, next_char);
        if self.is_pat_final() {
            vec![DagEdge {
                s: self.start,
                e: context.i + 1,
                etype: self.etype
            }]
        } else {
            vec![]
        }
    }
}


pub fn build_dag(dict: &Dict, text: &Vec<char>) -> Dag {
    let mut builders: Vec<Box<DagEdgeBuilder>> =
        vec![Box::new(DictEdgeBuilder::new(dict)),
             Box::new(create_latin_edge_builder()),
             Box::new(create_punc_edge_builder())
        ];
    
    let mut dag = Vec::with_capacity(text.len() + 1);

    for _ in 0..text.len()+1 {
        dag.push(vec![]);
    }
    dag[0].push(DagEdge{s: 0, e: 0, etype: EdgeType::Init});
    let mut context = EdgeBuildingContext {
        text: &text,
        i: 0,
        ch: '\0',
        left_boundary: 0,
        best_edge: None,
    };

    for i in 0..text.len() {
        context.ch = text[i];
        context.i = i;
        context.best_edge = None;

        for builder in &mut builders {
            for edge in builder.build_dag_edges(&context) {
                dag[edge.e].push(edge)
            }
        }
    }

    let mut left_boundary = 0;
    for i in 1..text.len()+1 {
        if dag[i].len() == 0 {
            dag[i].push(DagEdge {s: left_boundary, e: i, etype: EdgeType::Unk});
        } else {
            left_boundary = i;
        }
    }

    return dag
}

#[derive(Debug, PartialEq)]
pub struct TextRange {
    pub s: usize,
    pub e: usize,
}

pub fn path_to_ranges(path: &[Edge]) -> Vec<TextRange> {
    let len = path.len();
    
    if len == 0 {
        return vec![];
    }
    
    let mut ranges: Vec<TextRange> = Vec::with_capacity(len);
    let mut e = len - 1;
    while e > 0 {        
        let edge = &path[e];
        let s = edge.p;
        ranges.push(TextRange { s: s, e: e });
        e = s;
    }
    ranges.reverse();
    return ranges
}

pub fn path_to_str_vec(path: &[Edge], text: &[char]) -> Vec<String> {
    let ranges = path_to_ranges(path);
    let mut str_vec: Vec<String> = Vec::with_capacity(ranges.len());
    for r in ranges {
        let mut buf = String::with_capacity(3 * (r.e - r.s + 1));
        for i in r.s..r.e {
            buf.push(text[i]);
        }
        str_vec.push(buf)
    }
    return str_vec
}

#[derive(Clone)]
pub struct Wordcut {
    dict: Dict
}

impl Wordcut {
    pub fn new(dict: Dict) -> Wordcut {
        Wordcut{dict: dict}
    }

    #[allow(dead_code)]
    pub fn segment(&self, text: &str) -> Vec<TextRange> {
        let text: Vec<char> = text.chars().collect();
        let path = build_path(&self.dict, &text);
        return path_to_ranges(&path)
    }

    pub fn segment_into_strings(&self, text: &str) -> Vec<String> {
        let text: Vec<char> = text.chars().collect();
        let path = build_path(&self.dict, &text);
        return path_to_str_vec(&path, &text)
    }

    pub fn put_delimiters(&self, text: &str, delim: &str) -> String {
        self.segment_into_strings(text).join(delim)
    }
}

pub fn load_wordlist(path: &Path) -> io::Result<Vec<String>> {
    let f = File::open(path)?;
    let f = io::BufReader::new(f);
    Ok(f.lines().map(|line| line.unwrap()).collect())
}

pub fn load_dict(path: &Path) -> io::Result<Dict> {
    let wordlist = load_wordlist(path).unwrap();
    let wordlist: Vec<_> = wordlist.iter().map(|w| &w[..]).collect();
    return Ok(create_prefix_tree(&wordlist))
}

#[cfg(test)]
mod tests {
    use Wordcut;
    use TextRange;
    use DagEdge;
    use EdgeType;
    
    #[test]
    fn test_prefix_tree() {
        let prefix_tree = super::create_prefix_tree(&["A"]);
        assert_eq!(prefix_tree.seek(&(0, 0, 'A')),
                   Some(&(0 as u32, true, Some(true))));
        assert_eq!(prefix_tree.seek(&(0, 0, 'B')),
                   None);
    }

    #[test]
    fn test_segment() {
        let dict = super::create_prefix_tree(&["กา","กาก"]);
        let wordcut = Wordcut::new(dict);
        let ranges = wordcut.segment("กากกา");
        let expected = vec![TextRange{s:0,e:3}, TextRange{s:3,e:5}];
        assert_eq!(ranges, expected)
    }

    #[test]
    fn test_segment_to_strings() {
        let dict = super::create_prefix_tree(&["กา","กาก"]);
        let wordcut = Wordcut::new(dict);
        let toks = wordcut.segment_into_strings("กากกา");
        let expected = vec![String::from("กาก"), String::from("กา")];
        assert_eq!(toks, expected)
    }

    #[test]
    fn test_put_delimiters() {
        let dict = super::create_prefix_tree(&["กา","กาก"]);
        let wordcut = Wordcut::new(dict);
        assert_eq!(wordcut.put_delimiters("กากกา", "|"),
                   String::from("กาก|กา"))

    }

    #[test]
    fn test_load_wordlist() {
        let path = super::Path::new(
            concat!(env!("CARGO_MANIFEST_DIR"),
                    "/data/thai2words.txt"));
        let v = super::load_wordlist(path);
        assert_eq!(v.unwrap(), vec![String::from("กา"),
                                    String::from("กาก")])
    }

    #[test]
    fn test_wordcut() {
        let path = super::Path::new(
            concat!(env!("CARGO_MANIFEST_DIR"),
                    "/data/thai2words.txt"));
        let dict = super::load_dict(&path);
        let wordcut = Wordcut::new(dict.unwrap());
        assert_eq!(wordcut.put_delimiters("กากกา", "|"),
                   String::from("กาก|กา"))        
    }

    #[test]
    fn test_dag() {
        let path = super::Path::new(
            concat!(env!("CARGO_MANIFEST_DIR"),
                    "/data/thai2words.txt"));
        let dict = super::load_dict(&path);
        let dag = super::build_dag(&dict.unwrap(), &"กากกา".chars().collect());
        let expected = vec![
            vec![DagEdge{s: 0, e: 0, etype: EdgeType::Init  }],    // 0
            vec![DagEdge{s: 0, e: 1, etype: EdgeType::Unk   }],    // 1
            vec![DagEdge{s: 0, e: 2, etype: EdgeType::Dict  }],    // 2
            vec![DagEdge{s: 0, e: 3, etype: EdgeType::Dict  }],    // 3
            vec![DagEdge{s: 3, e: 4, etype: EdgeType::Unk   }],    // 4
            vec![DagEdge{s: 3, e: 5, etype: EdgeType::Dict  }]     // 5
        ];
        assert_eq!(dag, expected);
    }

    #[test]
    fn test_dag_punc() {
        let path = super::Path::new(
            concat!(env!("CARGO_MANIFEST_DIR"),
                    "/data/thai2words.txt"));
        let dict = super::load_dict(&path);
        let dag = super::build_dag(&dict.unwrap(), &"กา กา".chars().collect());
        let expected = vec![
            vec![DagEdge{s: 0, e: 0, etype: EdgeType::Init  }],    // 0
            vec![DagEdge{s: 0, e: 1, etype: EdgeType::Unk   }],    // 1
            vec![DagEdge{s: 0, e: 2, etype: EdgeType::Dict  }],    // 2
            vec![DagEdge{s: 2, e: 3, etype: EdgeType::Punc  }],    // 3
            vec![DagEdge{s: 3, e: 4, etype: EdgeType::Unk   }],    // 4
            vec![DagEdge{s: 3, e: 5, etype: EdgeType::Dict  }]     // 5
        ];
        assert_eq!(dag, expected);
    }

    #[test]
    fn test_dag_latin() {
        let path = super::Path::new(
            concat!(env!("CARGO_MANIFEST_DIR"),
                    "/data/thai2words.txt"));
        let dict = super::load_dict(&path);
        let dag = super::build_dag(&dict.unwrap(), &"กาAB".chars().collect());
        let expected = vec![
            vec![DagEdge{s: 0, e: 0, etype: EdgeType::Init  }],    // 0
            vec![DagEdge{s: 0, e: 1, etype: EdgeType::Unk   }],    // 1
            vec![DagEdge{s: 0, e: 2, etype: EdgeType::Dict  }],    // 2
            vec![DagEdge{s: 2, e: 3, etype: EdgeType::Unk   }],    // 3
            vec![DagEdge{s: 2, e: 4, etype: EdgeType::Latin }]     // 4
        ];
        assert_eq!(dag, expected);
    }

    #[test]
    fn test_dag_empty() {
        let path = super::Path::new(
            concat!(env!("CARGO_MANIFEST_DIR"),
                    "/data/thai2words.txt"));
        let dict = super::load_dict(&path);
        let dag = super::build_dag(&dict.unwrap(), &"".chars().collect());
        let expected = vec![
            vec![DagEdge{s: 0, e: 0, etype: EdgeType::Init  }]    // 0
        ];
        assert_eq!(dag, expected);

    }    
}