Results 1 
5 of
5
An Efficient Probabilistic ContextFree Parsing Algorithm that Computes Prefix Probabilities
 Computational Linguistics
, 2002
"... this article can compute solutions to all four of these problems in a single flamework, with a number of additional advantages over previously presented isolated solutions ..."
Abstract

Cited by 188 (6 self)
 Add to MetaCart
this article can compute solutions to all four of these problems in a single flamework, with a number of additional advantages over previously presented isolated solutions
Parsing Incomplete Sentences
, 1988
"... An efficient contextfree parsing algorithln is preseuted that can parse sentences with unknown parts of unknown length. It produc in finite form all possible parses (often infinite in number) that could account for the missing parts. The algorithm is a variation on the construction due to Earl ..."
Abstract

Cited by 29 (2 self)
 Add to MetaCart
An efficient contextfree parsing algorithln is preseuted that can parse sentences with unknown parts of unknown length. It produc in finite form all possible parses (often infinite in number) that could account for the missing parts. The algorithm is a variation on the construction due to Earley. ltowever, its presentation is such that it can readily be adapted to any chart parsing schema (top down, bottomup, etc...).
A Generative View of IllFormed Input Processing (Extended Abstract)
, 1989
"... Bernard LANG INRIA B.P. 105, 78153 Le Chesnay, France lang@inria.inria.fr The intent of this presentation is to exhibit the commonalities between the following syntactic problems: 1. parsing ambiguous or incomplete input, often known as word lattice parsing; 2. parsing illformed input, i.e. inpu ..."
Abstract
 Add to MetaCart
Bernard LANG INRIA B.P. 105, 78153 Le Chesnay, France lang@inria.inria.fr The intent of this presentation is to exhibit the commonalities between the following syntactic problems: 1. parsing ambiguous or incomplete input, often known as word lattice parsing; 2. parsing illformed input, i.e. input that does not belong to the language formally defined by a grammar; 3. syntactic disambiguation of ambiguous sentences; 4. accounting for deviant syntactic structures in grammatical language descriptions. The key idea behind this work is that of a weighted grammar. For simplicity we consider here only a special case of the more general definition given in [Teitelbaum 73], which could lead to other interesting variations (e.g. probabilities as weights, using multiplication instead of addition as below). We define a weighted grammar as a ContextFree (CF) grammar with a numeric weight attached to each of its rules. We attach to any derivation tree a weight that is the sum of the weights of a...