cover of book
 

BUY FROM PUBLISHER


Available as an ebook at:
Barnes & Noble Nook



Finite-State Morphology
by Kenneth R. Beesley and Lauri Karttunen
CSLI, 2003
eISBN: 978-1-57586-684-0 | Cloth: 978-1-57586-433-4 | Paper: 978-1-57586-434-1
Library of Congress Classification P98.B35 2003
Dewey Decimal Classification 410.285

ABOUT THIS BOOK | TOC
ABOUT THIS BOOK
The finite-state paradigm of computer science 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.

See other books on: Beesley, Kenneth R. | Computational linguistics | Computers | Data processing | Morphology
See other titles from CSLI
Nearby on shelf for Philology. Linguistics / Computational linguistics. Natural language processing: