Finite state methods for hyphenation

Authors:
Gosse Bouma
Affiliations:
Alfa-informatica, Rijksuniversiteit Groningen, Groningen, The Netherlands e-mail: gosse@let.rug.nl
Venue:
Natural Language Engineering
Year:
2003

Citing 8
Cited 2

Regular models of phonological rule systems

Computational Linguistics - Special issue on computational phonology
Transformation-based error-driven learning and natural language processing: a case study in part-of-speech tagging

Computational Linguistics
FSA Utilities: A Toolbox to Manipulate Finite-State Automata

WIA '96 Revised Papers from the First International Workshop on Implementing Automata
Word hy-phen-a-tion by com-put-er (hyphenation, computer)

Word hy-phen-a-tion by com-put-er (hyphenation, computer)
Transducers from rewrite rules with backreferences

EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
The replace operator

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Transformation-based learning in the fast lane

NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies
The proper treatment of optimality in computational phonology: plenary talk

FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing

Can syllabification improve pronunciation by analogy of English?

Natural Language Engineering
Conditional random fields for word hyphenation

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

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.