An efficient algorithm for projective dependency parsing
J Nivre - Proceedings of the eighth international conference on …, 2003 - aclanthology.org
This paper presents a deterministic parsing algorithm for projective dependency grammar.
The running time of the algorithm is linear in the length of the input string, and the …
The running time of the algorithm is linear in the length of the input string, and the …
CCGbank: a corpus of CCG derivations and dependency structures extracted from the Penn Treebank
This article presents an algorithm for translating the Penn Treebank into a corpus of
Combinatory Categorial Grammar (CCG) derivations augmented with local and long-range …
Combinatory Categorial Grammar (CCG) derivations augmented with local and long-range …
Wide-coverage efficient statistical parsing with CCG and log-linear models
This article describes a number of log-linear parsing models for an automatically extracted
lexicalized grammar. The models are “full” parsing models in the sense that probabilities are …
lexicalized grammar. The models are “full” parsing models in the sense that probabilities are …
[CARTE][B] Inductive dependency parsing
J Nivre - 2006 - Springer
Machine learning based on various forms of inductive inference has been used for a wide
range of problems in natural language processing, with syntactic parsing being one of the …
range of problems in natural language processing, with syntactic parsing being one of the …
[CARTE][B] Unbounded dependency constructions: Theoretical and experimental perspectives
This book is about one of the most intriguing features of human communication systems: the
fact that words that go together in meaning can occur arbitrarily far away from each other. In …
fact that words that go together in meaning can occur arbitrarily far away from each other. In …
Unbounded dependency recovery for parser evaluation
This paper introduces a new parser evaluation corpus containing around 700 sentences
annotated with unbounded dependencies, from seven different grammatical constructions …
annotated with unbounded dependencies, from seven different grammatical constructions …
Questionbank: Creating a corpus of parse-annotated questions
J Judge, A Cahill, J Van Genabith - 2006 - doras.dcu.ie
This paper describes the development of QuestionBank, a corpus of 4000 parse-annotated
questions for (i) use in training parsers employed in QA, and (ii) evaluation of question …
questions for (i) use in training parsers employed in QA, and (ii) evaluation of question …
Applying computational models of spatial prepositions to visually situated dialog
This article describes the application of computational models of spatial prepositions to
visually situated dialog systems. In these dialogs, spatial prepositions are important because …
visually situated dialog systems. In these dialogs, spatial prepositions are important because …
[CARTE][B] Probabilistic models of word order and syntactic discontinuity
R Levy - 2005 - search.proquest.com
This thesis takes up the problem of syntactic comprehension, or parsing—how an agent
(human or machine) with knowledge of a specific language goes about inferring the …
(human or machine) with knowledge of a specific language goes about inferring the …
Hybrid long-distance functional dependency parsing
G Schneider - 2008 - zora.uzh.ch
This thesis proposes a robust, hybrid, deep-syntatic dependency-based parsing architecture
and presents its implementation and evaluation. The architecture and the implementation …
and presents its implementation and evaluation. The architecture and the implementation …