Results 1  10
of
16
Generalized LeftCorner Parsing
 In Sixth Conference of the European Chapter of the Association for Computational Linguistics, Proceedings of the Conference
, 1993
"... We show how techniques known from generalized LR parsing can be applied to leftcorner parsing. The esulting parsing algorithm for contextfree grammars has some advantages over generalized LR parsing: the sizes and generation times of the parsers are smaller, the produced output is more compa ..."
Abstract

Cited by 24 (7 self)
 Add to MetaCart
We show how techniques known from generalized LR parsing can be applied to leftcorner parsing. The esulting parsing algorithm for contextfree grammars has some advantages over generalized LR parsing: the sizes and generation times of the parsers are smaller, the produced output is more compact, and the basic parsing technique can more easily be adapted to arbitrary contextfree grammars.
Efficient Tabular LR Parsing
 IN 34TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS
, 1996
"... We give a new treatment of tabular LR parsing, which is an alternative to Tomita's generalized LR algorithm. The advantage is twofold. Firstly, our treatment is conceptually more attractive because it uses simpler concepts, such as grammar trans formations and standard tabulation techniq ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
We give a new treatment of tabular LR parsing, which is an alternative to Tomita's generalized LR algorithm. The advantage is twofold. Firstly, our treatment is conceptually more attractive because it uses simpler concepts, such as grammar trans formations and standard tabulation techniques also know as chart parsing. Secondly, the static and dynamic complexity of parsing, both in space and time, is significantly reduced.
An Extended Theory Of HeadDriven Parsing
 Mexico State University
, 1994
"... We show that more headdriven parsing algorithms can be formulated than those occurring in the existing literature. These algorithms are inspired by a family of lefttoright parsing algorithms from a recent publica tion. We further introduce a more advanced notion of "headdriven parsing" ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
We show that more headdriven parsing algorithms can be formulated than those occurring in the existing literature. These algorithms are inspired by a family of lefttoright parsing algorithms from a recent publica tion. We further introduce a more advanced notion of "headdriven parsing" which allows more detailed specification of the processing order of nonhead elements in the righthand side. We develop a parsing algorithm for this strategy, based on LR parsing techniques.
Conventional Natural Language Processing in the NWO Priority Programme on Language and Speech Technology
, 1996
"... ..."
Probabilistic parsing strategies
 In 42nd Annual Meeting of the Association for Computational Linguistics
, 2004
"... We present new results on the relation between purely symbolic contextfree parsing strategies and their probabilistic counterparts. Such parsing strategies are seen as constructions of pushdown devices from grammars. We show that preservation of probability distribution is possible under two condi ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We present new results on the relation between purely symbolic contextfree parsing strategies and their probabilistic counterparts. Such parsing strategies are seen as constructions of pushdown devices from grammars. We show that preservation of probability distribution is possible under two conditions, viz. the correctprefix property and the property of strong predictiveness. These results generalize existing results in the literature that were obtained by considering parsing strategies in isolation. From our general results we also derive negative results on socalled generalized LR parsing. 1
Even faster generalized LR parsing
 ACTA INFORMATICA
, 2000
"... We prove a property of generalized LR (GLR) parsing  if the grammar is without right and hidden left recursions, then the number of consecutive reductions between the shifts of two adjacent symbols cannot be greater than a constant. Further, we show that this property can be used for constructin ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We prove a property of generalized LR (GLR) parsing  if the grammar is without right and hidden left recursions, then the number of consecutive reductions between the shifts of two adjacent symbols cannot be greater than a constant. Further, we show that this property can be used for constructing an optimized version of our GLR parser. Compared with a standard GLR parser, our optimized parser reads one symbol on every transition and performs significantly fewer stack operations. Our timings show that, especially for highly ambiguous grammars, our parser is significantly faster than a standard GLR parser.
HighPerformance MultiPass Unification Parsing
, 2002
"... Parsing natural language is an attempt to discover some structure in a text (or textual representation) generated by a person. This structure can be put to a variety of uses, including machine translation, grammar conformance checking, and determination of prosody in texttospeech tasks. Recent the ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Parsing natural language is an attempt to discover some structure in a text (or textual representation) generated by a person. This structure can be put to a variety of uses, including machine translation, grammar conformance checking, and determination of prosody in texttospeech tasks. Recent theories of Syntax use Unification to better describe the intricacies of natural language [137]. For parsing systems, unification techniques have been either added to a contextfree base system [152, 40, 4, 23], or replaced the contextfree base entirely [118, 135, 45] (possibly putting it back later [136]). The seemingly small step of adding unification has opened a Pandora’s Box of computational complexity, increasing the difficulty of the problem from polynomial [48] to somewhere between NPcomplete and intractable, depending on the details of the unification system and how it was added [10]. Worse, unification on a contextfree base parser can break the packing technique used to address the problem of ambiguity, leading to exponential blowups of the parser’s performance in both space and time in practice. I propose
TomitaStyle Generalised LR Parsers
, 2000
"... \Lambda)ffl, as reductions, allowing the reduction to be performed when only ff has be recognised. We give a modification of Tomita's original algorithm, based on a modification of the underlying parse table, which we prove is correct. It is also more efficient than Farshi's modification. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
\Lambda)ffl, as reductions, allowing the reduction to be performed when only ff has be recognised. We give a modification of Tomita's original algorithm, based on a modification of the underlying parse table, which we prove is correct. It is also more efficient than Farshi's modification. We have implemented a parser generator which generates parsers based both on Tomita's original algorithm and on our modification, and we give statistics on the behaviours of both types of parser.
Construction of Efficient Generalized LR Parsers
 of Lecture Notes in Computer Science
, 1997
"... We show how LR parsers for the analysis of arbitrary contextfree grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing algorithm working at complexity O(n 3 ) in the worst case, which is achieved by the use of dynamic programming to represe ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We show how LR parsers for the analysis of arbitrary contextfree grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing algorithm working at complexity O(n 3 ) in the worst case, which is achieved by the use of dynamic programming to represent the nondeterministic evolution of the stack instead of graphstructured stack representations, as has often been the case in previous approaches. The algorithm behave better in practical cases, achieving linear complexity on LR grammars. Experimental results show the performance of our proposal. Keywords: LR automata, non deterministic contextfree parsing, dynamic programming, natural language processing. 1 Introduction LR parsing, one of the strongest and most efficient class of parsing strategies for contextfree grammars (CFGs), is a two fold process: first, the grammar is compiled into a finitestate machine called LR automaton, which has two associated tables of actions and goto's [1]...
Generalised LR parsing algorithms
, 2006
"... This thesis concerns the parsing of contextfree grammars. A parser is a tool, defined for a specific grammar, that constructs a syntactic representation of an input string and determines if the string is grammatically correct or not. An algorithm that is capable of parsing any contextfree grammar ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This thesis concerns the parsing of contextfree grammars. A parser is a tool, defined for a specific grammar, that constructs a syntactic representation of an input string and determines if the string is grammatically correct or not. An algorithm that is capable of parsing any contextfree grammar is called a generalised (contextfree) parser. This thesis is devoted to the theoretical analysis of generalised parsing algorithms. We describe, analyse and compare several algorithms that are based on Knuth’s LR parser. This work underpins the design and implementation of the Parser Animation Tool (PAT). We use PAT to evaluate the asymptotic complexity of generalised parsing algorithms and to develop the Binary Right Nulled Generalised LR algorithm – a new cubic worst case parser. We also compare the Right Nullable Generalised LR, Reduction Incorporated Generalised LR, Farshi, Tomita and Earley algorithms using the statistical data collected by PAT. Our study indicates that the overheads associated with some of the parsing algorithms may have significant consequences on their behaviour.