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
"synopsis" may belong to another edition of this title.
Emmanuel Roche is a Research Scientist, and Yves Schabes is a Senior Research Scientist, both at Teragram Corporation in Cambridge, Massachusetts.
"Emmanuel Roche and Yves Schabes have put together a picture of thestate of the art in using finite-state techniques in computationallinguistics. The contributing authors comprise an impressivecollection—essentially the originating sources for much of theimportant recent work in this area." Philip Resnik, Assistant Professor, Department ofLinguistics and Institute for Advanced Computer Studies,University of Maryland at College Park
"About this title" may belong to another edition of this title.
Shipping:
US$ 3.99
Within U.S.A.
Seller: More Than Words, Waltham, MA, U.S.A.
Condition: Very Good. . GoodFormer Library book. All orders guaranteed and ship within 24 hours. Before placing your order for please contact us for confirmation on the book's binding. Check out our other listings to add to your order for discounted shipping. Seller Inventory # WAL-V-5d-00901
Quantity: 1 available
Seller: HPB-Red, Dallas, TX, U.S.A.
hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_425592612
Quantity: 1 available
Seller: Powell's Bookstores Chicago, ABAA, Chicago, IL, U.S.A.
Condition: Used - Very Good. 1997. Hardcover. Cloth, dj. Slight shelf wear. Very Good. Seller Inventory # SIN0011995
Quantity: 1 available
Seller: Atticus Books, Toronto, ON, Canada
Hardcover. Condition: Very Good. Dust Jacket Condition: Very Good. 1st Edition. Book. Seller Inventory # H6211
Quantity: 1 available
Seller: Kloof Booksellers & Scientia Verlag, Amsterdam, Netherlands
Condition: very good. 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 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.English text. Condition : fine & unread. Condition : very good copy. ISBN 9780262181822. Keywords : LINGUISTICS, Seller Inventory # 51934
Quantity: 1 available