Code: 04821166
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 l ... more
47.01 €
Availability:
50/50We think title might be available. Upon your order we will do our best to get it within 6 weeks.Enter your e-mail address and once book will be available,
we will send you a message. It's that simple.
You get 118 loyalty points
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.
Book category Books in English Language linguistics Computational linguistics
47.01 €
Collection points Bratislava a 2642 dalších
Copyright ©2008-24 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
Shopping cart ( Empty )