Sciweavers

573 search results - page 16 / 115
» Probabilistic Parsing Strategies
Sort
View
ICFP
2002
ACM
14 years 9 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
ACL
1990
13 years 11 months ago
Deterministic Left to Right Parsing of Tree Adjoining Languages
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
Yves Schabes, K. Vijay-Shanker
CORR
2006
Springer
132views Education» more  CORR 2006»
13 years 9 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
ACL
2008
13 years 11 months ago
Improving Parsing and PP Attachment Performance with Sense Information
To date, parsers have made limited use of semantic information, but there is evidence to suggest that semantic features can enhance parse disambiguation. This paper shows that sem...
Eneko Agirre, Timothy Baldwin, David Martín...
ACL
1998
13 years 11 months ago
An Empirical Evaluation of Probabilistic Lexicalized Tree Insertion Grammars
We present an empirical study of the applicability of Probabilistic Lexicalized Tree Insertion Grammars (PLTIG), a lexicalized counterpart to Probabilistic Context-Free Grammars (...
Rebecca Hwa