| 000 | 03456nam a2200517 i 4500 | ||
|---|---|---|---|
| 001 | 6267499 | ||
| 003 | IEEE | ||
| 005 | 20220712204723.0 | ||
| 006 | m o d | ||
| 007 | cr |n||||||||| | ||
| 008 | 151224s1997 maua ob 001 eng d | ||
| 010 | _z 96048159 (print) | ||
| 020 |
_a9780262290951 _qelectronic |
||
| 020 |
_z0262181827 _qhc : alk. paper |
||
| 020 |
_z9780262527705 _qprint |
||
| 035 | _a(CaBNVSL)mat06267499 | ||
| 035 | _a(IDAMS)0b000064818b450d | ||
| 040 |
_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL |
||
| 050 | 4 |
_aQA76.9.N38 _bF56 1997eb |
|
| 082 | 0 | 0 |
_a006.3/5/015113 _221 |
| 245 | 0 | 0 |
_aFinite-state language processing / _cedited by Emmanuel Roche and Yves Schabes. |
| 264 | 1 |
_aCambridge, Massachusetts : _bMIT Press, _cc1997. |
|
| 264 | 2 |
_a[Piscataqay, New Jersey] : _bIEEE Xplore, _c[1997] |
|
| 300 |
_a1 PDF (xv, 464 pages) : _billustrations. |
||
| 336 |
_atext _2rdacontent |
||
| 337 |
_aelectronic _2isbdmedia |
||
| 338 |
_aonline resource _2rdacarrier |
||
| 490 | 1 | _aLanguage, speech, and communication | |
| 500 | _a"A Bradford book." | ||
| 504 | _aIncludes bibliographical references and index. | ||
| 506 | 1 | _aRestricted to subscribers or individual electronic text purchasers. | |
| 520 | _aFinite-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. | ||
| 530 | _aAlso available in print. | ||
| 538 | _aMode of access: World Wide Web | ||
| 588 | _aDescription based on PDF viewed 12/24/2015. | ||
| 650 | 0 |
_aNatural language processing (Computer science) _94741 |
|
| 655 | 0 |
_aElectronic books. _93294 |
|
| 700 | 1 |
_aRoche, Emmanuel. _923139 |
|
| 700 | 1 |
_aSchabes, Yves. _923140 |
|
| 710 | 2 |
_aIEEE Xplore (Online Service), _edistributor. _923141 |
|
| 710 | 2 |
_aMIT Press, _epublisher. _923142 |
|
| 776 | 0 | 8 |
_iPrint version _z9780262527705 |
| 830 | 0 |
_aLanguage, speech, and communication _922531 |
|
| 856 | 4 | 2 |
_3Abstract with links to resource _uhttps://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267499 |
| 942 | _cEBK | ||
| 999 |
_c73153 _d73153 |
||