Sciweavers

36 search results - page 4 / 8
» Polynomial Time Parsing of Combinatory Categorial Grammars
Sort
View
ACL
2001
13 years 9 months ago
Guided Parsing of Range Concatenation Languages
The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used in NLP. In particular, range concatenation langu...
François Barthélemy, Pierre Boullier...
AAAI
2011
12 years 7 months ago
Recognizing Plans with Loops Represented in a Lexicalized Grammar
This paper extends existing plan recognition research to handle plans containing loops. We supply an encoding of plans with loops for recognition, based on techniques used to pars...
Christopher W. Geib, Robert P. Goldman
ICFP
2002
ACM
14 years 7 months ago
Packrat parsing: : simple, powerful, lazy, linear time, functional pearl
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford
CORR
2006
Springer
132views Education» more  CORR 2006»
13 years 7 months ago
Packrat Parsing: Simple, Powerful, Lazy, Linear Time
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford
COLING
1990
13 years 8 months ago
Efficient Disjunctive Unification for Bottom-Up Parsing
This paper describes two novel techniques which, when applied together, in practice significantly reduce the time required for unifying disjunctive feature structures. The first i...
David M. Carter