TY  - BOOK
AU  - Beesley,Kenneth R.
AU  - Karttunen,Lauri
TI  - Finite state morphology
T2  - Studies in computational linguistics
SN  - 9781575864341
PY  - 2003///
CY  - Stanford
PB  - CSLI, 
KW  - Lingüística computacional
KW  - Morfología (Lingüística)
KW  - Informática
N1  - Bibliogr.: p.483-487
N2  - The finite-state paradigm of computer sciences has provided a basis for natural-language applications that are efficient, elegant and robust. This volume is a practical guide to finite-state theory and the affiliated programming languages lexc and xfst. Readers will learn how to write tokenizers, spelling checkers, and especially morphological analyzer/generators for words in English, French, Finnish, Hungarian and other languages. Included are graded introductions, examples, and exercises suitable for individual study as well as formal courses. These take advantage of widely tested lexc and xfst applications that are just becoming available for noncommercial use via the Internet
ER  -