Finite state methods for hyphenation

Natural Language Engineering

Volumn 9, Issue 1, 2003, Pages 5-20

  Bouma, Gosse ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; PATTERN RECOGNITION; TRANSDUCERS;

HYPHENATION;

FINITE AUTOMATA;

EID: 0038342103     PISSN: 13513249     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1351324903003073     Document Type: Conference Paper

References (19)

1. Baayen, R. H., Piepenbrock, R. and van Rijn, H. (1993) The CELEX Lexical Database (CD-ROM). UPenn, Philadelphia, PA: Linguistic Data Consortium.
2. Brandt Corstius, H. (1978) Computer-taalkunde, Muiderberg: Coutinho.
3. Brill, E. (1995) Transformation-based error-driven learning and natural language processing: A case study in part-of-speech tagging, Computational Linguistics 21: 543-566.
4. Daelemans, W. and van den Bosch, A. (1992) Generalization performance of backpropagation learning on a syllabification task. Connectionism and Natural Language Processing. Proceedings Third Twente Workshop on Language Technology, pp. 27-38.
5. Gerdemann, D. and van Noord, G. (1999) Transducers from rewrite rules with backreferences. Proceedings Ninth Conference of the European Chapter of the Association for Computational Linguistics, pp. 126-133, Bergen.
6. Gerdemann, D. and van Noord, G. (2000) Approximation and exactness in finite state optimality theory. In: Eisner, J., Karttunen, L. and Thériault, A., editors, Finite -State Phonology. Proceedings Fifth Workshop of the ACL SPecial Interest Group in Computational Phonology, pp. 34-45. Luxembourg.
7. Kaplan, R. and Kay, M. (1994) Regular models of phonological rule systems. Computational Linguistics 20(3).
8. Kaplan, R.d M. and Karttunen, L. J. (1998) Finite-state encoding system for hyphenation rules, United States Patent 5,737.621.
9. Karttunen, L. (1995) The replace operator. 33th Annual Meeting of the Association for Computational Linguistics, pp. 16-23. Boston, MA.
10. Karttunen, L. (1998) The proper treatment of optimality in computational phonology. In: Karttunen, L., editor, FSMNLP'98: International Workshop on Finite State Methods in Natural Language Processing, pp. 1-12. ACL, Somerset, NJ.
11. Karttunen, L. (2001) Applications of finite-state technology in natural language processing. In: Yu, S. and Paun, A., editors, Implementation and Application of Automata: Lecture Notes in Computer Science 2088, pp. 34-46, Springer-Verlag, Berlin.
12. Liang, F. M. (1983) Word Hy-phen-a-tion by Com-put-er, PhD thesis, Stanford University.
13. Ngai, G. and Florian, R. (2001) Transformation-based learning in the fast lane. Proceedings Second Conference of the North American chapter of the ACL, pp. 40-47. Pittsburgh.
14. Roche, E. and Schabes, Y. (1997) Deterministic part-of-speech tagging with finite-state transducers. In: Roche, E. and Schabes, Y., editors, Finite State Language Processing, pp. 205-239. MIT Press, Cambridge, MA.
15. EX. In: TUGboat 1995: Proceedings 16th Annual Meeting of the Tex Users Group.
16. EX, hoe werkt dat nou? Available at ftp://ftp.tue.nl/pub/tex/afbreken.
17. van Noord, G. (1997) FSA Utilities: A toolbox to manipulate finite-state automata. In: Raymond, D., Wood, D. and Yu, S., editors, Automata Implementation: Lecture Notes in Computer Science 1260, Springer-Verlag.
18. van Noord, G. and Gerdemann, D. (2001) Finite state transducers with predicates and identity. Grammars 4(3).
19. Vosse, T. (1994) The Word Connection. PhD thesis, Rijksuniversiteit Leiden.