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
Type de document :
Communication dans un congrès
20th Conference on Computational Linguistics - CoLing'2004, 2004, Genève, Suisse, pp.303-309, 2004
Liste complète des métadonnées
https://hal.inria.fr/inria-00099886
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 10:03:03
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48
Document(s) archivé(s) le : mercredi 29 mars 2017 - 13:18:10

Fichiers

A04-R-260.pdf

Identifiants

  • 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, 2004. 〈inria-00099886〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

234

Téléchargements de fichiers

37

Contact


archive-ouverte@inria.fr