HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation

Guillaume Bonfante 1 Bruno Guillaume 1 Guy Perrier 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In the context of lexicalized grammars, we propose general methods for lexical disambiguation based on polarization and abstraction of grammatical formalisms. Polarization makes their resource sensitivity explicit and abstraction aims at keeping essentially the mechanism of neutralization between polarities. If a grammar in the initial formalism happens to be lexicalized, parsing with the simplified grammar in the abstract formalism can be used efficiently for filtering lexical selections.
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 10:03:03 AM
Last modification on : Friday, February 4, 2022 - 3:15:28 AM
Long-term archiving on: : Wednesday, March 29, 2017 - 1:18:10 PM


  • HAL Id : inria-00099886, version 1



Guillaume Bonfante, Bruno Guillaume, Guy Perrier. Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation. 20th Conference on Computational Linguistics - CoLing'2004, 2004, Genève, Suisse, pp.303-309. ⟨inria-00099886⟩



Record views


Files downloads