Parsing Theory

Author : Seppo Sippu,Eljas Soisalon-Soininen
Publisher : Springer Science & Business Media
Page : 440 pages
File Size : 51,8 Mb
Release : 1990-11-14
Category : Computers
ISBN : 3540517324

Get Book

Parsing Theory by Seppo Sippu,Eljas Soisalon-Soininen Pdf

This work is Volume II of a two-volume monograph on the theory of deterministic parsing of context-free grammars. Volume I, "Languages and Parsing" (Chapters 1 to 5), was an introduction to the basic concepts of formal language theory and context-free parsing. Volume II (Chapters 6 to 10) contains a thorough treat ment of the theory of the two most important deterministic parsing methods: LR(k) and LL(k) parsing. Volume II is a continuation of Volume I; together these two volumes form an integrated work, with chapters, theorems, lemmas, etc. numbered consecutively. Volume II begins with Chapter 6 in which the classical con structions pertaining to LR(k) parsing are presented. These include the canonical LR(k) parser, and its reduced variants such as the LALR(k) parser and the SLR(k) parser. The grammarclasses for which these parsers are deterministic are called LR(k) grammars, LALR(k) grammars and SLR(k) grammars; properties of these grammars are also investigated in Chapter 6. A great deal of attention is paid to the rigorous development of the theory: detailed mathematical proofs are provided for most of the results presented.

Author : Dick Grune,Ceriel J.H. Jacobs
Publisher : Springer Science & Business Media
Page : 662 pages
File Size : 44,8 Mb
Release : 2007-10-29
Category : Computers
ISBN : 9780387689548

Get Book

Parsing Techniques by Dick Grune,Ceriel J.H. Jacobs Pdf

This 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.

Author : Daniel Marcu
Publisher : MIT Press
Page : 276 pages
File Size : 50,7 Mb
Release : 2000
Category : Computers
ISBN : 0262133725

Get Book

The Theory and Practice of Discourse Parsing and Summarization by Daniel Marcu Pdf

Most discourse researchers assume that full semantic understanding is necessary to derive the discourse structure of texts. This book documents an attempt to construct and use automatic and non-semantic computational structures for text summarization.

Author : Seppo Sippu,Eljas Soisalon-Soininen
Publisher : Springer Science & Business Media
Page : 234 pages
File Size : 47,7 Mb
Release : 2012-12-06
Category : Computers
ISBN : 9783642613456

Get Book

Parsing Theory by Seppo Sippu,Eljas Soisalon-Soininen Pdf

The theory of parsing is an important application area of the theory of formal languages and automata. The evolution of modem high-level programming languages created a need for a general and theoretically dean methodology for writing compilers for these languages. It was perceived that the compilation process had to be "syntax-directed", that is, the functioning of a programming language compiler had to be defined completely by the underlying formal syntax of the language. A program text to be compiled is "parsed" according to the syntax of the language, and the object code for the program is generated according to the semantics attached to the parsed syntactic entities. Context-free grammars were soon found to be the most convenient formalism for describing the syntax of programming languages, and accordingly methods for parsing context-free languages were devel oped. Practical considerations led to the definition of various kinds of restricted context-free grammars that are parsable by means of efficient deterministic linear-time algorithms.

Author : U. Reyle,C. Rohrer
Publisher : Springer Science & Business Media
Page : 491 pages
File Size : 46,9 Mb
Release : 2012-12-06
Category : Language Arts & Disciplines
ISBN : 9789400913370

Get Book

Natural Language Parsing and Linguistic Theories by U. Reyle,C. Rohrer Pdf

presupposition fails, we now give a short introduction into Unification Grammar. Since all implementations discussed in this volume use PROLOG (with the exception of BlockjHaugeneder), we felt that it would also be useful to explain the difference between unification in PROLOG and in UG. After the introduction to UG we briefly summarize the main arguments for using linguistic theories in natural language processing. We conclude with a short summary of the contributions to this volume. UNIFICATION GRAMMAR 3 Feature Structures or Complex Categories. Unification Grammar was developed by Martin Kay (Kay 1979). Martin Kay wanted to give a precise defmition (and implementation) of the notion of 'feature'. Linguists use features at nearly all levels of linguistic description. In phonetics, for instance, the phoneme b is usually described with the features 'bilabial', 'voiced' and 'nasal'. In the case of b the first two features get the value +, the third (nasal) gets the value -. Feature value pairs in phonology are normally represented as a matrix. bilabial: + voiced: + I nasal: - [Feature matrix for b.] In syntax features are used, for example, to distinguish different noun classes. The Latin noun 'murus' would be characterized by the following feature-value pairs: gender: masculin, number: singular, case: nominative, pred: murus. Besides a matrix representation one frequently fmds a graph representation for feature value pairs. The edges of the graph are labelled by features. The leaves denote the value of a feature.

Author : René Leermakers
Publisher : Springer Science & Business Media
Page : 158 pages
File Size : 51,9 Mb
Release : 2012-12-06
Category : Computers
ISBN : 9781461531869

Get Book

The Functional Treatment of Parsing by René Leermakers Pdf

Parsing technology traditionally consists of two branches, which correspond to the two main application areas of context-free grammars and their generalizations. Efficient deterministic parsing algorithms have been developed for parsing programming languages, and quite different algorithms are employed for analyzing natural language. The Functional Treatment of Parsing provides a functional framework within which the different traditional techniques are restated and unified. The resulting theory provides new recursive implementations of parsers for context-free grammars. The new implementations, called recursive ascent parsers, avoid explicit manipulation of parse stacks and parse matrices, and are in many ways superior to conventional implementations. They are applicable to grammars for programming languages as well as natural languages. The book has been written primarily for students and practitioners of parsing technology. With its emphasis on modern functional methods, however, the book will also be of benefit to scientists interested in functional programming. The Functional Treatment of Parsing is an excellent reference and can be used as a text for a course on the subject.

Author : Seppo Sippu,Eljas Soisalon-Soininen
Publisher : Springer Science & Business Media
Page : 432 pages
File Size : 47,6 Mb
Release : 2013-04-17
Category : Computers
ISBN : 9783662084243

Get Book

Parsing Theory by Seppo Sippu,Eljas Soisalon-Soininen Pdf

This work is Volume II of a two-volume monograph on the theory of deterministic parsing of context-free grammars. Volume I, "Languages and Parsing" (Chapters 1 to 5), was an introduction to the basic concepts of formal language theory and context-free parsing. Volume II (Chapters 6 to 10) contains a thorough treat ment of the theory of the two most important deterministic parsing methods: LR(k) and LL(k) parsing. Volume II is a continuation of Volume I; together these two volumes form an integrated work, with chapters, theorems, lemmas, etc. numbered consecutively. Volume II begins with Chapter 6 in which the classical con structions pertaining to LR(k) parsing are presented. These include the canonical LR(k) parser, and its reduced variants such as the LALR(k) parser and the SLR(k) parser. The grammarclasses for which these parsers are deterministic are called LR(k) grammars, LALR(k) grammars and SLR(k) grammars; properties of these grammars are also investigated in Chapter 6. A great deal of attention is paid to the rigorous development of the theory: detailed mathematical proofs are provided for most of the results presented.

Author : Klaas Sikkel
Publisher : Springer Science & Business Media
Page : 374 pages
File Size : 45,9 Mb
Release : 2012-12-06
Category : Computers
ISBN : 9783642605413

Get Book

Parsing Schemata by Klaas Sikkel Pdf

Parsing, 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.

Author : Paola Merlo
Publisher : Springer Science & Business Media
Page : 254 pages
File Size : 55,9 Mb
Release : 2012-12-06
Category : Computers
ISBN : 9789400917088

Get Book

Parsing with Principles and Classes of Information by Paola Merlo Pdf

Parsing with Principles and Classes of Information presents a parser based on current principle-based linguistic theories for English. It argues that differences in the kind of information being computed, whether lexical, structural or syntactic, play a crucial role in the mapping from grammatical theory to parsing algorithms. The direct encoding of homogeneous classes of information has computational and cognitive advantages, which are discussed in detail. Phrase structure is built by using a fast algorithm and compact reference tables. A quantified comparison of different compilation methods shows that lexical and structural information are most compactly represented by separate tables. This finding is reconciled to evidence on the resolution of lexical ambiguity, as an approach to the modularization of information. The same design is applied to the efficient computation of long- distance dependencies. Incremental parsing using bottom-up tabular algorithms is discussed in detail. Finally, locality restrictions are calculated by a parametric algorithm. Students of linguistics, parsing and psycholinguistics will find this book a useful resource on issues related to the implementation of current linguistic theories, using computational and cognitive plausible algorithms.

Author : Bradley L. Pritchett
Publisher : University of Chicago Press
Page : 212 pages
File Size : 40,6 Mb
Release : 1992-11
Category : Computers
ISBN : 0226684423

Get Book

Grammatical Competence and Parsing Performance by Bradley L. Pritchett Pdf

How does a parser, a device that imposes an analysis on a string of symbols so that they can be interpreted, work? More specifically, how does the parser in the human cognitive mechanism operate? Using a wide range of empirical data concerning human natural language processing, Bradley Pritchett demonstrates that parsing performance depends on grammatical competence, not, as many have thought, on perception, computation, or semantics. Pritchett critiques the major performance-based parsing models to argue that the principles of grammar drive the parser; the parser, furthermore, is the apparatus that tries to enforce the conditions of the grammar at every point in the processing of a sentence. In comparing garden path phenomena, those instances when the parser fails on the first reading of a sentence and must reanalyze it, with occasions when the parser successfully functions the first time around, Pritchett makes a convincing case for a grammar-derived parsing theory.

Author : H. Bunt,Masaru Tomita
Publisher : Springer Science & Business Media
Page : 436 pages
File Size : 51,8 Mb
Release : 1996-08-31
Category : Computers
ISBN : 9780792341529

Get Book

Recent Advances in Parsing Technology by H. Bunt,Masaru Tomita Pdf

In Marcus (1980), deterministic parsers were introduced. These are parsers which satisfy the conditions of Marcus's determinism hypothesis, i.e., they are strongly deterministic in the sense that they do not simulate non determinism in any way. In later work (Marcus et al. 1983) these parsers were modified to construct descriptions of trees rather than the trees them selves. The resulting D-theory parsers, by working with these descriptions, are capable of capturing a certain amount of ambiguity in the structures they build. In this context, it is not clear what it means for a parser to meet the conditions of the determinism hypothesis. The object of this work is to clarify this and other issues pertaining to D-theory parsers and to provide a framework within which these issues can be examined formally. Thus we have a very narrow scope. We make no ar guments about the linguistic issues D-theory parsers are meant to address, their relation to other parsing formalisms or the notion of determinism in general. Rather we focus on issues internal to D-theory parsers themselves.

Author : M. de Vincenzi
Publisher : Springer Science & Business Media
Page : 171 pages
File Size : 43,8 Mb
Release : 2012-12-06
Category : Language Arts & Disciplines
ISBN : 9789401131841

Get Book

Syntactic Parsing Strategies in Italian by M. de Vincenzi Pdf

Author : R. C. Berwick,S.P. Abney,C.L. Tenny
Publisher : Springer Science & Business Media
Page : 424 pages
File Size : 41,8 Mb
Release : 2012-12-06
Category : Language Arts & Disciplines
ISBN : 9789401134743

Get Book

Principle-Based Parsing by R. C. Berwick,S.P. Abney,C.L. Tenny Pdf

Author : Masaru Tomita
Publisher : Springer Science & Business Media
Page : 209 pages
File Size : 51,6 Mb
Release : 2013-04-17
Category : Computers
ISBN : 9781475718850

Get Book

Efficient Parsing for Natural Language by Masaru Tomita Pdf

Parsing 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).

Author : H. Bunt,Anton Nijholt
Publisher : Springer Science & Business Media
Page : 277 pages
File Size : 45,9 Mb
Release : 2013-03-09
Category : Language Arts & Disciplines
ISBN : 9789401594707

Get Book

Advances in Probabilistic and Other Parsing Technologies by H. Bunt,Anton Nijholt Pdf

Parsing technology is concerned with finding syntactic structure in language. In parsing we have to deal with incomplete and not necessarily accurate formal descriptions of natural languages. Robustness and efficiency are among the main issuesin parsing. Corpora can be used to obtain frequency information about language use. This allows probabilistic parsing, an approach that aims at both robustness and efficiency increase. Approximation techniques, to be applied at the level of language description, parsing strategy, and syntactic representation, have the same objective. Approximation at the level of syntactic representation is also known as underspecification, a traditional technique to deal with syntactic ambiguity. In this book new parsing technologies are collected that aim at attacking the problems of robustness and efficiency by exactly these techniques: the design of probabilistic grammars and efficient probabilistic parsing algorithms, approximation techniques applied to grammars and parsers to increase parsing efficiency, and techniques for underspecification and the integration of semantic information in the syntactic analysis to deal with massive ambiguity. The book gives a state-of-the-art overview of current research and development in parsing technologies. In its chapters we see how probabilistic methods have entered the toolbox of computational linguistics in order to be applied in both parsing theory and parsing practice. The book is both a unique reference for researchers and an introduction to the field for interested graduate students.