0
Your cart

Your cart is empty

Books > Computing & IT > Applications of computing > Artificial intelligence

Buy Now

Generalized LR Parsing (Paperback, Softcover reprint of the original 1st ed. 1991) Loot Price: R2,756
Discovery Miles 27 560
Generalized LR Parsing (Paperback, Softcover reprint of the original 1st ed. 1991): Masaru Tomita

Generalized LR Parsing (Paperback, Softcover reprint of the original 1st ed. 1991)

Masaru Tomita

 (sign in to rate)
Loot Price R2,756 Discovery Miles 27 560 | Repayment Terms: R258 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

The Generalized LR parsing algorithm (some call it "Tomita's algorithm") was originally developed in 1985 as a part of my Ph.D thesis at Carnegie Mellon University. When I was a graduate student at CMU, I tried to build a couple of natural language systems based on existing parsing methods. Their parsing speed, however, always bothered me. I sometimes wondered whether it was ever possible to build a natural language parser that could parse reasonably long sentences in a reasonable time without help from large mainframe machines. At the same time, I was always amazed by the speed of programming language compilers, because they can parse very long sentences (i.e., programs) very quickly even on workstations. There are two reasons. First, programming languages are considerably simpler than natural languages. And secondly, they have very efficient parsing methods, most notably LR. The LR parsing algorithm first precompiles a grammar into an LR parsing table, and at the actual parsing time, it performs shift-reduce parsing guided deterministically by the parsing table. So, the key to the LR efficiency is the grammar precompilation; something that had never been tried for natural languages in 1985. Of course, there was a good reason why LR had never been applied for natural languages; it was simply impossible. If your context-free grammar is sufficiently more complex than programming languages, its LR parsing table will have multiple actions, and deterministic parsing will be no longer possible.

General

Imprint: Springer-Verlag New York
Country of origin: United States
Release date: October 2012
First published: 1991
Editors: Masaru Tomita
Dimensions: 235 x 155 x 9mm (L x W x T)
Format: Paperback
Pages: 166
Edition: Softcover reprint of the original 1st ed. 1991
ISBN-13: 978-1-4613-6804-5
Categories: Books > Language & Literature > Language & linguistics > Computational linguistics
Books > Computing & IT > Applications of computing > Artificial intelligence > General
LSN: 1-4613-6804-9
Barcode: 9781461368045

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners