Kód: 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 ... celý popis
1238 Kč
Dostupnost:
50 % šanceMáme informaci, že by titul mohl být dostupný. Na základě vaší objednávky se ho pokusíme do 6 týdnů zajistit.Zadejte do formuláře e-mailovou adresu a jakmile knihu naskladníme, zašleme vám o tom zprávu. Pohlídáme vše za vás.
Nákupem získáte 124 bodů
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.
Zařazení knihy Knihy v angličtině Language linguistics Computational linguistics
1238 Kč
Osobní odběr Praha, Brno a 12903 dalších
Copyright ©2008-24 nejlevnejsi-knihy.cz Všechna práva vyhrazenaSoukromíCookies
Nákupní košík ( prázdný )