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.
Mots-clés : traitement automatique des langues polarities computational linguistics lexical disambiguation grammatical formalisms désambiguisation lexicale formalismes linguistiques polarités
Document type :
Conference papers
Complete list of metadatas
https://hal.inria.fr/inria-00099886
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 10:03:03 AM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM
Long-term archiving on : Wednesday, March 29, 2017 - 1:18:10 PM

Files

A04-R-260.pdf

Identifiers

  • HAL Id : inria-00099886, version 1

Collections

INRIA | LORIA | UNIV-LORRAINE

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

246

Files downloads

46

Contact


archive-ouverte@inria.fr