°æ¹®»ç

¼îÇθô >  ¼öÀÔµµ¼­ >  Language / Linguistics

Finite State Morphology  ¹«·á¹è¼Û

 
ÁöÀºÀÌ : Beesley & Karttunen
ÃâÆÇ»ç : CSLI
ÆÇ¼ö : 2003
ÆäÀÌÁö¼ö : 510
ISBN : 1575864347
¿¹»óÃâ°íÀÏ : ÀÔ±ÝÈ®ÀÎÈÄ 2ÀÏ À̳»
ÁÖ¹®¼ö·® : °³
µµ¼­°¡°Ý : 50,000¿ø ( ¹«·á¹è¼Û )
Àû¸³±Ý : 1,500 Point
     

 
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
An Introductory English Gr...
-Stageberg & Oaks-
 
 
Minimalist Syntax - Explor...
-A. Radford-
 
 
A Course In Minimalist Syn...
-Lasnik,Uriagerek...-
 
 
   
 
½ºÆ©¾îÆ®¹ÌºÐÀûºÐÇÐ 9ÆÇ...
¹Ú½Â¾ÈÀú¼­ °ü·Ã ¹®Àǵå...
'»óǰ ¹ß¼Û' »óÅÂÀÎ »ó...
Semantics, 3rd
The Origins and De...
A Course in Phonet...
Introduction to En...
Minimalist Syntax ...
An Introduction to...
Introduction to En...
Optimality-Theoret...
How Language Works
Rediscovery of th...