Warenkorb
€ 0,00 0 Buch dabei,
portofrei
Generalized LR Parsing als Buch
PORTO-
FREI

Generalized LR Parsing

Auflage 1991. Book. Sprache: Englisch.
Buch (gebunden)
Ihr 13%-Rabatt auf alle Spielwaren, Hörbücher, Filme, Musik u.v.m
 
13% Rabatt sichern mit Gutscheincode: FREITAG13
 
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 s … weiterlesen
Buch

129,99*

inkl. MwSt.
Portofrei
Sofort lieferbar
Generalized LR Parsing als Buch

Produktdetails

Titel: Generalized LR Parsing

ISBN: 0792392019
EAN: 9780792392019
Auflage 1991.
Book.
Sprache: Englisch.
Herausgegeben von Masaru Tomita
Springer US

31. August 1991 - gebunden - 184 Seiten

Beschreibung

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.

Inhaltsverzeichnis

1 The Generalized LR Parsing Algorithm.
2 Experiments with GLR and Chart Parsing.
3 The Computational Complexity of GLR Parsing.
4 GLR Parsing in Time O(n3).
5 GLR Parsing for ?-Grammers.
6 Parallel GLR Parsing Based on Logic Programming.
7 GLR Parsing with Scoring.
8 GLR Parsing With Probability.
9 GLR Parsing for Erroneous Input.
10 GLR Parsing for Noisy Input.
11 GLR Parsing in Hidden Markov Model.
Servicehotline
089 - 70 80 99 47

Mo. - Fr. 8.00 - 20.00 Uhr
Sa. 10.00 - 20.00 Uhr
Filialhotline
089 - 30 75 75 75

Mo. - Sa. 9.00 - 20.00 Uhr
Bleiben Sie in Kontakt:
Sicher & bequem bezahlen:
akzeptierte Zahlungsarten: Überweisung, offene Rechnung,
Visa, Master Card, American Express, Paypal
Zustellung durch:
* Alle Preise verstehen sich inkl. der gesetzlichen MwSt. Informationen über den Versand und anfallende Versandkosten finden Sie hier.
** Deutschsprachige eBooks und Bücher dürfen aufgrund der in Deutschland geltenden Buchpreisbindung und/oder Vorgaben von Verlagen nicht rabattiert werden. Soweit von uns deutschsprachige eBooks und Bücher günstiger angezeigt werden, wurde bei diesen kürzlich von den Verlagen der Preis gesenkt oder die Buchpreisbindung wurde für diese Titel inzwischen aufgehoben. Angaben zu Preisnachlässen beziehen sich auf den dargestellten Vergleichspreis.