Finite state morphology / Kenneth R. Beesley, Lauri Karttunen
Tipo de material: TextoSeries Studies in computational linguisticsDetalles de publicación: Stanford : CSLI, 2003 Descripción: xviii, 509 p. : il. ; 24 cm + 1 CD-ROMISBN: 9781575864341Tema(s): Lingüística computacional | Morfología (Lingüística) -- InformáticaResumen: 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.Tipo de ítem | Biblioteca de origen | Signatura | Estado | Fecha de vencimiento | Código de barras | Reserva de ítems | Bibliografía recomendada |
---|---|---|---|---|---|---|---|
Manuales | 06. BIBLIOTECA HUMANIDADES | 801.55/BEE/fin (Navegar estantería(Abre debajo)) | Disponible Ubicación en estantería | Bibliomaps® | 3744748301 | |||
Manuales | 06. BIBLIOTECA HUMANIDADES | 801.55/BEE/fin (Navegar estantería(Abre debajo)) | Disponible Ubicación en estantería | Bibliomaps® | 3744748310 |
LINGÜÍSTICA COMPUTACIONAL GRADO EN LINGÜÍSTICA Y LENGUAS APLICADAS Asignatura actualizada 2023-2024 |
||
Manuales | 06. BIBLIOTECA HUMANIDADES | 801.55/BEE/fin (Navegar estantería(Abre debajo)) | Disponible Ubicación en estantería | Bibliomaps® | 374474832X |
CD-ROM: Para Solaris, Linux, MacOS, Windows
Bibliogr.: p.483-487
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.
No hay comentarios en este titulo.