[PDF] Efficient Parsing For Natural Language eBook

Author : Masaru Tomita
Publisher : Springer Science & Business Media
Page : 209 pages
File Size : 19,34 MB
Release : 2013-04-17
Category : Computers
ISBN : 1475718853

GET BOOK

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 : Leonard Bolc
Publisher : Springer Science & Business Media
Page : 381 pages
File Size : 18,67 MB
Release : 2012-12-06
Category : Computers
ISBN : 3642830307

GET BOOK

Up to now there has been no scientific publication on natural lan guage research that presents a broad and complex description of the current problems of parsing in the context of Artificial Intelli gence. However, there are many interesting results from this domain appearing mainly in numerous articles published in pro fessional journals. In view of this situation, the objective of this book is to enable scientists from different countries to present the results of their research on natural language parsing in the form of more detailed papers than would be possible in professional jour nals. This book thus provides a collection of studies written by well known scientists whose earlier publications have greatly contributed to the development of research on natural language parsing. Jaime G. Carbonell and Philip J. Hayes present in their paper "Robust Parsing Using Multiple Construction-Specific Strategies" two small experimental parsers, implemented to illustrate the advantages of a multi-strategy approach to parsers, with strategies selected according to the type of construction being parsed at any given time. This presentation is followed by the description of a parsing algorithm, integrating some of the best features of the two smaller parsers, including case-frame instantiation and partial pat tern-matching strategies.

Author : Masaru Tomita
Publisher : Springer Science & Business Media
Page : 172 pages
File Size : 32,93 MB
Release : 2012-12-06
Category : Computers
ISBN : 1461540348

GET BOOK

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.

Author : Dick Grune
Publisher : Springer Science & Business Media
Page : 677 pages
File Size : 21,22 MB
Release : 2007-10-29
Category : Computers
ISBN : 0387689540

GET BOOK

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 : H. Bunt
Publisher : Springer Science & Business Media
Page : 408 pages
File Size : 16,29 MB
Release : 2006-01-27
Category : Computers
ISBN : 1402022956

GET BOOK

Parsing can be defined as the decomposition of complex structures into their constituent parts, and parsing technology as the methods, the tools, and the software to parse automatically. Parsing is a central area of research in the automatic processing of human language. Parsers are being used in many application areas, for example question answering, extraction of information from text, speech recognition and understanding, and machine translation. New developments in parsing technology are thus widely applicable. This book contains contributions from many of today's leading researchers in the area of natural language parsing technology. The contributors describe their most recent work and a diverse range of techniques and results. This collection provides an excellent picture of the current state of affairs in this area. This volume is the third in a series of such collections, and its breadth of coverage should make it suitable both as an overview of the current state of the field for graduate students, and as a reference for established researchers.

Author : Joakim Nivre
Publisher : Springer Science & Business Media
Page : 224 pages
File Size : 21,11 MB
Release : 2006-08-05
Category : Computers
ISBN : 1402048890

GET BOOK

This book describes the framework of inductive dependency parsing, a methodology for robust and efficient syntactic analysis of unrestricted natural language text. Coverage includes a theoretical analysis of central models and algorithms, and an empirical evaluation of memory-based dependency parsing using data from Swedish and English. A one-stop reference to dependency-based parsing of natural language, it will interest researchers and system developers in language technology, and is suitable for graduate or advanced undergraduate courses.

Author : H. Bunt
Publisher : Springer Science & Business Media
Page : 277 pages
File Size : 49,60 MB
Release : 2013-03-09
Category : Language Arts & Disciplines
ISBN : 9401594708

GET BOOK

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.

Author : Ruslan Mitkov
Publisher : Oxford University Press
Page : 808 pages
File Size : 37,75 MB
Release : 2004
Category : Computers
ISBN : 019927634X

GET BOOK

This handbook of computational linguistics, written for academics, graduate students and researchers, provides a state-of-the-art reference to one of the most active and productive fields in linguistics.

Author : H. Bunt
Publisher : Springer Science & Business Media
Page : 436 pages
File Size : 17,28 MB
Release : 1996-08-31
Category : Computers
ISBN : 079234152X

GET BOOK

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.