Dependency grammar

Known as: Dependent 
Dependency grammar (DG) is a class of modern syntactic theories that are all based on the dependency relation (as opposed to the constituency… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1964-2017
0204019642017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Syntactic representations based on word-to-word dependencies have a long tradition in descriptive linguistics, and receive… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
Extensible Dependency Grammar (XDG; Debusmann, 2007) is a flexible, modular dependency grammar framework in which sentence… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2010
2010
A strong inductive bias is essential in unsupervised grammar induction. We explore a particular sparsity bias in dependency… (More)
  • table 1
  • table 2
  • table 3
  • figure 1
Is this relevant?
2010
2010
There has been little work on computational grammars for Amharic or other Ethio-Semitic languages and their use for parsing and… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2010
2010
This paper presents the development of an open-source Spanish Dependency Grammar implemented in FreeLing environment. This… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Parsing unrestricted text is useful for many language technology applications but requires parsing methods that are both robust… (More)
  • figure 2
  • figure 3
  • table 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This paper presents a fundamental algorithm for parsing natural language sentences into dependency trees. Unlike phrase-structure… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
In this paper, parsing with dependency grammar is modeled as a constraint satisfaction problem. A restricted kind of constraints… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
After presenting a novel O(n) parsing algorithm for dependency grammar, we develop three contrasting ways to stochasticize it. We… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • table 1
Is this relevant?
1990
1990
Discontinuous constituents-for example, a noun and its modifying adjective separated by words unrelated to them-arc common in… (More)
  • figure 4
  • figure I
  • figure 2
  • figure 3
Is this relevant?