Finite-state language processing / (Record no. 73153)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03456nam a2200517 i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 6267499 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20220712204723.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 151224s1997 maua ob 001 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9780262290951 |
| -- | electronic |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| -- | hc : alk. paper |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| -- | |
| 082 00 - CLASSIFICATION NUMBER | |
| Call Number | 006.3/5/015113 |
| 245 00 - TITLE STATEMENT | |
| Title | Finite-state language processing / |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | 1 PDF (xv, 464 pages) : |
| 490 1# - SERIES STATEMENT | |
| Series statement | Language, speech, and communication |
| 500 ## - GENERAL NOTE | |
| Remark 1 | "A Bradford book." |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | 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. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Roche, Emmanuel. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Schabes, Yves. |
| 856 42 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | https://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267499 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cambridge, Massachusetts : |
| -- | MIT Press, |
| -- | c1997. |
| 264 #2 - | |
| -- | [Piscataqay, New Jersey] : |
| -- | IEEE Xplore, |
| -- | [1997] |
| 336 ## - | |
| -- | text |
| -- | rdacontent |
| 337 ## - | |
| -- | electronic |
| -- | isbdmedia |
| 338 ## - | |
| -- | online resource |
| -- | rdacarrier |
| 588 ## - | |
| -- | Description based on PDF viewed 12/24/2015. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Natural language processing (Computer science) |
No items available.