Abstract | ||
---|---|---|
Hyphenation is the task of identifying potential hyphenation points inwords. In this paper, three finite-state hyphenation methods for Dutch are presented and compared in terms of accuracy and size of the resulting automata. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1017/S1351324903003073 | Natural Language Engineering |
Keywords | Field | DocType |
potential hyphenation points inwords,resulting automaton,finite-state hyphenation method,finite state method | Computer science,Automaton,Finite state,Artificial intelligence,Natural language processing | Journal |
Volume | Issue | Citations |
9 | 1 | 6 |
PageRank | References | Authors |
0.59 | 8 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Gosse Bouma | 1 | 483 | 70.88 |