17 search results - page 3 / 4 » Algorithms for Deterministic Incremental Dependency Parsing |
ACL
2010
13 years 5 months ago
2010
Incremental parsing techniques such as shift-reduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a ...
DCC
2004
IEEE
14 years 7 months ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
EMNLP
2007
13 years 9 months ago
2007
Three versions of the Covington algorithm for non-projective dependency parsing have been tested on the ten different languages for the Multilingual track of the CoNLLX Shared Tas...
PLDI
1997
ACM
13 years 12 months ago
1997
ACM
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequat...
KDD
2002
ACM
14 years 8 months ago
2002
ACM
We present a closed set data mining paradigm which is particularly e ective for uncovering the kind of deterministic, causal dependencies that characterize much of basic science. ...