Implementation issues in the development of the PARSEC parser
Software—Practice & Experience
A maximum-entropy-inspired parser
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Eliminative parsing with graded constraints
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Automatic extraction of subcategorization frames for Czech
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
A statistical parser for Czech
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Robust parsing with weighted constraints
Natural Language Engineering
Can subcategorization help a statistical dependency parser?
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Topological dependency trees: a constraint-based account of linear precedence
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Probabilistic parsing for German using sister-head dependencies
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
A relational syntax-semantics interface based on dependency grammar
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
A modular account of information structure in extensible dependency grammar
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
| Hi-index | 0.00 |
This article describes an attempt to implement a constraint-based dependency grammar for Czech, a language with rich morphology and free word order, in the formalism Extensible Dependency Grammar (XDG). The grammar rules are automatically inferred from the Prague Dependency Treebank (PDT) and constrain dependency relations, modification frames and word order, including non-projectivity. Although these simple constraints are adequate from the linguistic point of view, their combination is still too weak and allows an exponential number of solutions for a sentence of n words.