DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
×
The link of the search results:
Please copy and share (some browsers may have copied to Clipboard)
The MIT Press. Used - Very Good. 1997. Hardcover. Cloth, dj. Slight shelf wear. Very Good. (Subject: Technology). The MIT Press ISBN 0262181827 9780262181822 [US]
MIT Press. Used - Very Good. Used book that is in excellent condition. May show signs of wear or have minor defects. MIT Press ISBN 0262181827 9780262181822 [US]
ISBN10: 0262181827, ISBN13: 9780262181822, [publisher: Bradford Book] Hardcover Book is in Used-Good condition. Pages and cover are clean and intact. Used items may not include supplementary materials such as CDs or access codes. May show signs of minor shelf wear and contain limited notes and highlighting. [Hawthorne, CA, U.S.A.] [Publication Year: 1997]
ISBN10: 0262181827, ISBN13: 9780262181822, [publisher: Bradford Book] Hardcover Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc. [Montgomery, IL, U.S.A.] [Publication Year: 1997]
ISBN10: 0262181827, ISBN13: 9780262181822, [publisher: MIT Press] Hardcover First Edition Used book that is in excellent condition. May show signs of wear or have minor defects. [Reno, NV, U.S.A.] [Publication Year: 1997]
ISBN10: 0262181827, ISBN13: 9780262181822, [publisher: Bradford Book] Hardcover Cambridge, MA. : The MIT Press, 1997. Hardcover. Dustjacket. 464 pp.(Language, Speech, and Communication). - 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 ...
ISBN10: 0262181827, ISBN13: 9780262181822, [publisher: Bradford Book] Hardcover Cambridge, MA. : The MIT Press, 1997. Hardcover. Dustjacket. 464 pp.(Language, Speech, and Communication). - 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 ...
description size:
DISCLOSURE: When you use one of our links to make a purchase, we may earn a commission at no extra cost to you. As an Amazon Associate, AddALL earn commission from qualifying Amazon purchases.
