Multiword expressions as dependency subgraphs

Authors:
Ralph Debusmann
Affiliations:
Saarland University, Saarbrücken, Germany
Venue:
MWE '04 Proceedings of the Workshop on Multiword Expressions: Integrating Processing
Year:
2004

Citing 6
Cited 2

Eliminative parsing with graded constraints

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
A principle-based hierarchical representation of LTAGs

COLING '96 Proceedings of the 16th 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
Word order in German: a formal dependency grammar using a topological hierarchy

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Generation as dependency parsing

ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Principles of Constraint Programming

Principles of Constraint Programming

A practical classification of multiword expressions

ACL '07 Proceedings of the 45th Annual Meeting of the ACL: Student Research Workshop
Capturing disjunction in lexicalization with extensible dependency grammar

CSLP '06 Proceedings of the Third Workshop on Constraints and Language Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose to model multiword expressions as dependency subgraphs, and realize this idea in the grammar formalism of Extensible Dependency Grammar (XDG). We extend XDG to lexicalize dependency subgraphs, and show how to compile them into simple lexical entries, amenable to parsing and generation with the existing XDG constraint solver.