LR Parsing
Author: Nigel P. Chapman
Publisher: CUP Archive
Published: 1987-12-17
Total Pages: 254
ISBN-13: 9780521304139
DOWNLOAD EBOOKPosts
Generalized LR Parsing
Author: Masaru Tomita
Publisher: Springer Science & Business Media
Published: 2012-12-06
Total Pages: 172
ISBN-13: 1461540348
DOWNLOAD EBOOKThe 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.
Parsing Techniques
Author: Dick Grune
Publisher: Springer Science & Business Media
Published: 2007-10-29
Total Pages: 677
ISBN-13: 0387689540
DOWNLOAD EBOOKThis second edition of Grune and Jacobs’ brilliant work presents new developments and discoveries that have been made in the field. Parsing, also referred to as syntax analysis, has been and continues to be an essential part of computer science and linguistics. Parsing techniques have grown considerably in importance, both in computer science, ie. advanced compilers often use general CF parsers, and computational linguistics where such parsers are the only option. They are used in a variety of software products including Web browsers, interpreters in computer devices, and data compression programs; and they are used extensively in linguistics.
Generalized LR Parsing
Author: Masaru Tomita
Publisher: Springer Science & Business Media
Published: 1991-08-31
Total Pages: 194
ISBN-13: 9780792392019
DOWNLOAD EBOOKThe 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.
Current Issues in Parsing Technology
Author: Masaru Tomita
Publisher: Springer Science & Business Media
Published: 2012-12-06
Total Pages: 308
ISBN-13: 1461539862
DOWNLOAD EBOOKAn Introduction to Formal Languages and Automata
Author: Peter Linz
Publisher: Jones & Bartlett Learning
Published: 2022-02-18
Total Pages: 600
ISBN-13: 1284231607
DOWNLOAD EBOOK"This book is designed for an introductory course on formal languages, automata, computability, and related matters"--
Handbook of Natural Language Processing
Author: Robert Dale
Publisher: CRC Press
Published: 2000-07-25
Total Pages: 1015
ISBN-13: 0824746341
DOWNLOAD EBOOKThis study explores the design and application of natural language text-based processing systems, based on generative linguistics, empirical copus analysis, and artificial neural networks. It emphasizes the practical tools to accommodate the selected system.
Compiler Construction
Author:
Publisher: PediaPress
Published:
Total Pages: 629
ISBN-13:
DOWNLOAD EBOOKParsing Schemata
Author: Klaas Sikkel
Publisher: Springer Science & Business Media
Published: 2012-12-06
Total Pages: 374
ISBN-13: 3642605419
DOWNLOAD EBOOKParsing, the syntactic analysis of language, has been studied extensively in computer science and computational linguistics. Computer programs and natural languages share an underlying theory of formal languages and require efficient parsing algorithms. This introduction reviews the theory of parsing from a novel perspective. It provides a formalism to capture the essential traits of a parser that abstracts from the fine detail and allows a uniform description and comparison of a variety of parsers, including Earley, Tomita, LR, Left-Corner, and Head-Corner parsers. The emphasis is on context-free phrase structure grammar and how these parsers can be extended to unification formalisms. The book combines mathematical rigor with high readability and is suitable as a graduate course text.
Efficient Parsing for Natural Language
Author: Masaru Tomita
Publisher: Springer Science & Business Media
Published: 2013-04-17
Total Pages: 209
ISBN-13: 1475718853
DOWNLOAD EBOOKParsing Efficiency is crucial when building practical natural language systems. 'Ibis is especially the case for interactive systems such as natural language database access, interfaces to expert systems and interactive machine translation. Despite its importance, parsing efficiency has received little attention in the area of natural language processing. In the areas of compiler design and theoretical computer science, on the other hand, parsing algorithms 3 have been evaluated primarily in terms of the theoretical worst case analysis (e.g. lXn», and very few practical comparisons have been made. This book introduces a context-free parsing algorithm that parses natural language more efficiently than any other existing parsing algorithms in practice. Its feasibility for use in practical systems is being proven in its application to Japanese language interface at Carnegie Group Inc., and to the continuous speech recognition project at Carnegie-Mellon University. This work was done while I was pursuing a Ph.D degree at Carnegie-Mellon University. My advisers, Herb Simon and Jaime Carbonell, deserve many thanks for their unfailing support, advice and encouragement during my graduate studies. I would like to thank Phil Hayes and Ralph Grishman for their helpful comments and criticism that in many ways improved the quality of this book. I wish also to thank Steven Brooks for insightful comments on theoretical aspects of the book (chapter 4, appendices A, B and C), and Rich Thomason for improving the linguistic part of tile book (the very beginning of section 1.1).
