1942 search results - page 62 / 389 » Parse |
65
Voted
ACL
2000
15 years 2 months ago
2000
In terms of both speed and memory consumption, graph unification remains the most expensive component of unification-based grammar parsing. We present a technique to reduce the me...
98
Voted
ACL
1998
15 years 2 months ago
1998
We present a new LR algorithm for treeadjoining grammars. It is an alternative to an existing algorithm that is shown to be incorrect. Furthermore, the new algorithm is much simpl...
COLING
1990
15 years 1 months ago
1990
This paper deals with two linguistic phenomena which are usually considered cases of ill-formedness by the computational linguistics community: intersentential ellipsis and coordi...
113
Voted
TREC
2007
15 years 1 months ago
2007
York University evaluated a prepcessing approach for this year’s enterprise document search task. With different parsing tools, we create two data sets. Based on each data set,...
117
click to vote
NLPRS
2001
Springer
15 years 5 months ago
2001
Springer
Incremental parsing with a context free grammar produces partial syntactic structures for an initial fragment on the word-by-word basis. Owing to the syntactic ambiguity, however,...