Finite-state language processing
Finite-state devices, which include finite-state automata, graphs, and finite-state transducers, are in wide use in many areas of computer science. Recently, there has been a resurgence of the use of finite-state devices in all aspects of computational linguistics, including dictionary encoding, tex...
Main Author: | |
---|---|
Other Authors: | |
Format: | eBook |
Language: | English |
Published: |
Cambridge, Mass.
MIT Press
1997
|
Series: | Language, speech, and communication
|
Subjects: | |
Online Access: | |
Collection: | MIT Press eBook Archive - Collection details see MPG.ReNa |
LEADER | 02626nmm a2200313 u 4500 | ||
---|---|---|---|
001 | EB002070781 | ||
003 | EBX01000000000000001210871 | ||
005 | 00000000000000.0 | ||
007 | cr||||||||||||||||||||| | ||
008 | 220922 ||| eng | ||
020 | |a 0262290952 | ||
020 | |a 9780262290951 | ||
050 | 4 | |a QA76.9.N38 | |
100 | 1 | |a Roche, Emmanuel | |
245 | 0 | 0 | |a Finite-state language processing |h Elektronische Ressource |c edited by Emmanuel Roche and Yves Schabes |
260 | |a Cambridge, Mass. |b MIT Press |c 1997 | ||
300 | |a xv, 464 pages |b illustrations | ||
653 | |a LINGUISTICS & LANGUAGE/General | ||
653 | |a COMPUTER SCIENCE/Programming Languages | ||
653 | |a Natural language processing (Computer science) | ||
700 | 1 | |a Schabes, Yves | |
041 | 0 | 7 | |a eng |2 ISO 639-2 |
989 | |b MITArchiv |a MIT Press eBook Archive | ||
490 | 0 | |a Language, speech, and communication | |
500 | |a "A Bradford book." | ||
028 | 5 | 0 | |a 10.7551/mitpress/3007.001.0001 |
856 | 4 | 0 | |u https://doi.org/10.7551/mitpress/3007.001.0001?locatt=mode:legacy |x Verlag |3 Volltext |
082 | 0 | |a 006.3/5/015113 | |
520 | |a Finite-state devices, which include finite-state automata, graphs, and finite-state transducers, are in wide use in many areas of computer science. Recently, there has been a resurgence of the use of finite-state devices in all aspects of computational linguistics, including dictionary encoding, text processing, and speech processing. This book describes the fundamental properties of finite-state devices and illustrates their uses. Many of the contributors pioneered the use of finite-automata for different aspects of natural language processing. The topics, which range from the theoretical to the applied, include finite-state morphology, approximation of phrase-structure grammars, deterministic part-of-speech tagging, application of a finite-state intersection grammar, a finite-state transducer for extracting information from text, and speech recognition using weighted finite automata. The introduction presents the basic theoretical results in finite-state automata and transducers. These results and algorithms are described and illustrated with simple formal language examples as well as natural language examples. Contributors : Douglas Appelt, John Bear, David Clemenceau, Maurice Gross, Jerry R. Hobbs, David Israel, Megumi Kameyama, Lauri Karttunen, Kimmo Koskenniemi, Mehryar Mohri, Eric Laporte, Fernando C.N. Pereira, Michael D. Riley, Emmanuel Roche, Yves Schabes, Max D. Silberztein, Mark Stickel, Pasi Tapanainen, Mabry Tyson, Atro Voutilainen, Rebecca N. Wright. Language, Speech, and Communication series |