Constraint-based Dependency Grammar
Constraint-Based Dependency Grammar is a formal syntactic framework within dependency grammar that uses declarative constraints to define grammaticality, distinguishing itself from rule-based or procedural approaches by specifying well-formedness conditions rather than derivation processes.
36
Publications
2.4K
Citations
59
Authors
26
Institutions
Publications per year
2017–2026
2
Parents
36
Syntactic Theory: A Formal Introduction
Ivan A. Sag, Thomas Wasow · Computational Linguistics · 2000 · 885 citations
A non-projective dependency parser
Pasi Tapanainen, Timo Järvinen · 1997 · 370 citations · Full text
Language Studies, Computer Science, Natural Language Processing +15
Dependency Grammar and Dependency Parsing
Joakim Nivre · 2005 · 170 citations
1–5 of 36
59
6
h-index
4
h-index
3
h-index
3
h-index
2
h-index
1–5 of 59
26

Pennsylvania State University
State College, United States
4 h-index
4 publications
179 citations
Purdue University West Lafayette
West Lafayette, United States
4 h-index
7 publications
293 citations
SRI International
Menlo Park, United States
3 h-index
6 publications
169 citations
The Ohio State University
Columbus, United States
2 h-index
3 publications
101 citations
Laboratoire Lorrain de Recherche en Informatique et ses Applications
Nancy, France
2 h-index
2 publications
48 citations

Saarland University
Saarbrücken, Germany
2 h-index
6 publications
200 citations
Stanford University
Stanford, United States
2 h-index
2 publications
906 citations

Indian Institute of Technology Hyderabad
Sangāreddi, India
1 h-index
4 publications
144 citations
1–8 of 26
Repository · 2 publications · 20 citations
2
h-index
2 publications · 50 citations
2
h-index
1 publications · 24 citations
1
h-index
1 publications · 40 citations
1
h-index
Repository · 1 publications · 12 citations
1
h-index
1–5