1519 search results - page 63 / 304 » The Domain Dependence of Parsing |
183
click to vote
EMNLP
2010
15 years 4 months ago
2010
We introduce a novel training algorithm for unsupervised grammar induction, called Zoomed Learning. Given a training set T and a test set S, the goal of our algorithm is to identi...
145
click to vote
EMNLP
2007
15 years 7 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...
140
click to vote
EACL
2006
ACL Anthology
15 years 7 months ago
2006
ACL Anthology
This paper presents a way in which a lexicalised HPSG grammar can handle word order constraints in a computational parsing system, without invoking an additional layer of represen...
172
click to vote
COLING
1996
15 years 7 months ago
1996
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...
163
click to vote
EACL
2003
ACL Anthology
15 years 7 months ago
2003
ACL Anthology
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...