Dependency constraints for lexical disambiguation

4Citations
Citations of this article
65Readers
Mendeley users who have this article in their library.

Abstract

We propose a generic method to perform lexical disambiguation in lexicalized grammatical formalisms. It relies on dependency constraints between words. The soundness of the method is due to invariant properties of the parsing in a given grammar that can be computed statically from the grammar.

Cite

CITATION STYLE

APA

Bonfante, G., Guillaume, B., & Morey, M. (2009). Dependency constraints for lexical disambiguation. In Proceedings of the 11th International Conference on Parsing Technologies, IWPT 2009 (pp. 242–253). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1697236.1697286

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free