Results 1 
3 of
3
An Efficient Implementation of the HeadCorner Parser
 COMPUTATIONAL LINGUISTICS
, 1996
"... This paper describes an efficient and robust implementation of a bidirectional, headdriven parser for constraintbased grammars. This parser is developed for the OVIS system: a Dutch spoken dialogue system in which information about public transport can be obtained by telephone. After a Review ..."
Abstract

Cited by 36 (2 self)
 Add to MetaCart
This paper describes an efficient and robust implementation of a bidirectional, headdriven parser for constraintbased grammars. This parser is developed for the OVIS system: a Dutch spoken dialogue system in which information about public transport can be obtained by telephone. After a Review
The intersection of Finite State Automata and Definite Clause Grammars
, 1995
"... Bernard Lang defines parsing as the calculation of the intersection of a FSA (the input) and a CFG. Viewing the input for parsing as a FSA rather than as a string combines well with some approaches in speech understanding systems, in which parsing takes a word lattice as input (rather than a word st ..."
Abstract

Cited by 20 (6 self)
 Add to MetaCart
Bernard Lang defines parsing as the calculation of the intersection of a FSA (the input) and a CFG. Viewing the input for parsing as a FSA rather than as a string combines well with some approaches in speech understanding systems, in which parsing takes a word lattice as input (rather than a word string). Furthermore, certain techniques for robust parsing can be modelled as finite state transducers.
Robust Efficient Parsing for Spoken Dialogue Processing
, 1998
"... ion (Johnson and Dorre, [39]) ffl x(A,B,f(A,B),g(A,h(B,i(C)))) =) x(A,B,f(,),g(,)) ffl parsewithweakening(Cat,P0,P,E0,E) : weaken(Cat,WeakenedCat), parse(WeakenedCat,P0,P,E0,E), Cat=WeakenedCat. ffl Really helps! Ambiguity Packing ffl A parser should not construct all parse trees (exponential) ..."
Abstract
 Add to MetaCart
ion (Johnson and Dorre, [39]) ffl x(A,B,f(A,B),g(A,h(B,i(C)))) =) x(A,B,f(,),g(,)) ffl parsewithweakening(Cat,P0,P,E0,E) : weaken(Cat,WeakenedCat), parse(WeakenedCat,P0,P,E0,E), Cat=WeakenedCat. ffl Really helps! Ambiguity Packing ffl A parser should not construct all parse trees (exponential) ffl Instead, a compact representation of all such parse trees are constructed  grammar [42, 9]  parse forest [76]  packed structures [3] ffl Here: for every `result item' keep track of the lexical entry and references of other result items that were used to create it ffl Results in a lexicalized tree substitution grammar ffl which generates the input sentence with all its parse trees Bottomup Inactivechart Parser Item form: [i;X; j] Axioms: Goals: [0;S;n] Inference Rules: Scan [q i ;wi; qi+1 ] Complete [q k ;X1; q k 0][q k 0;X2; q k 00] : : : [q m0;Xl; qm] [q k ;X0; qm] X0 !X1:::Xl Bottomup Inactivechart Parser Inference Rules: Scan [q i ;wi; qi+...