Dependency Constraints for Lexical Disambiguation

Guillaume Bonfante 1 Bruno Guillaume 2 Mathieu Morey 2
1 CARTE - Theoretical adverse computations, and safety
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
2 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We propose a generic method to per- form lexical disambiguation in lexicalized grammatical formalisms. It relies on de- pendency constraints between words. The soundness of the method is due to invariant properties of the parsing in a given gram- mar that can be computed statically from the grammar.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [19 references]  Display  Hide  Download
Contributor : Bruno Guillaume <>
Submitted on : Friday, December 11, 2009 - 4:03:02 PM
Last modification on : Tuesday, December 18, 2018 - 4:48:02 PM
Document(s) archivé(s) le : Thursday, October 18, 2012 - 10:45:33 AM


Files produced by the author(s)


  • HAL Id : inria-00440795, version 1



Guillaume Bonfante, Bruno Guillaume, Mathieu Morey. Dependency Constraints for Lexical Disambiguation. 11th International Conference on Parsing Technologies - IWPT'09, Oct 2009, Paris, France. pp.242-253. ⟨inria-00440795⟩



Record views


Files downloads