An Algorithm Rapidly Segmenting Chinese Sentences into Individual Words
This paper proposes an improved Trie tree structure. The tree node records the position information of the characters participating in the word formation, and the child node uses the hash search mechanism. On this basis, the forward maximum matching algorithm of Chinese word segmentation is optimize...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2019-01-01
|
| Series: | MATEC Web of Conferences |
| Subjects: | |
| Online Access: | https://www.matec-conferences.org/articles/matecconf/pdf/2019/16/matecconf_isc2018_04001.pdf |