54 search results - page 1 / 11 » Parsing as Reduction |
IPL
2007
13 years 4 months ago
2007
We discuss a bottom-up parsing technique based on delayed reductions, and investigate its capabilities and limitations. Some non-LR(k) grammars, for any k, are handled determinist...
ANLP
2000
13 years 6 months ago
2000
We present an efficientmulti-levelchart parser that was designed forsyntacticanalysisofclosedcaptions (subtitles) in a real-time Machine Translation (MT) system. In order to achie...
NAACL
2003
13 years 6 months ago
2003
We introduce two probabilistic models that can be used to identify elementary discourse units and build sentence-level discourse parse trees. The models use syntactic and lexical ...
TSD
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The impact of clause and intraclausal coordination detection to dependency parsing of Slovene is examined. New methods based on machine learning and heuristic rules are p...
CADE
1999
Springer
13 years 9 months ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...