Sciweavers

41 search results - page 6 / 9
» Constraints on Non-Projective Dependency Parsing
Sort
View
ACLLAW
2011
12 years 11 months ago
Empty Categories in Hindi Dependency Treebank: Analysis and Recovery
In this paper, we first analyze and classify the empty categories in a Hindi dependency treebank and then identify various discovery procedures to automatically detect the existe...
Chaitanya G. S. K., Samar Husain, Prashanth Mannem
EMNLP
2011
12 years 7 months ago
Multi-Source Transfer of Delexicalized Dependency Parsers
We present a simple method for transferring dependency parsers from source languages with labeled training data to target languages without labeled training data. We first demons...
Ryan T. McDonald, Slav Petrov, Keith Hall
ACL
1990
13 years 8 months ago
Licensing and Tree Adjoining Grammar in Government Binding Parsing
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licens...
Robert Frank
EACL
2003
ACL Anthology
13 years 9 months ago
Topological Parsing
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...
Gerald Penn, Mohammad Haji-Abdolhosseini
NIPS
2000
13 years 9 months ago
The Use of Classifiers in Sequential Inference
We study the problem of combining the outcomes of several different classifiers in a way that provides a coherent inference that satisfies some constraints. In particular, we deve...
Vasin Punyakanok, Dan Roth