2008 · 12 citations · 11 references
ComputingComputer ScienceComputational LinguisticsMachine LearningNatural Language ProcessingDependency GrammarLanguage ModelingLanguage ModelsSyntactic AnalysisSyntactic ComplexitySyntax ParsingDependency RepresentationElasticityNon-projective DependenciesSyntactic Dependencies
Abstract This paper is concerned with learning in the model of Gold the Categorial Dependency Grammars (CDG), which express discontinuous (non-projective) dependencies. We show that rigid and k-valued CDG (without optional and iterative types) are learnable from strings. In fact, we prove that the languages of dependency nets coding rigid CDGs have finite elasticity, and we show a learning algorithm. As a standard corollary, this result leads to the learnability of rigid or kvalued CDGs (without optional and iterative types) from strings. 1.1
11
Parsing English with a Link Grammar
Daniel D. Sleator, David Temperley · 1995 · 684 citations · Full text
Dependency systems and phrase-structure systems
Haim Gaifman · Information and Control · 1965 · 390 citations
Bruce Lercher · Journal of Symbolic Logic · 1967 · 135 citations