Stochastic Lambek Categorial Grammars

Guillaume Bonfante 1 Philippe De Groote 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present here a stochastic point of vue on Lambek Categorial Grammars which have shown their utility in Natural Language Processing. The key point comes from the fact that the parsing in the Lambek Calculus is based on an essentially non-deterministic algorithm. We claim that a stochasting treatment may be a good way to resolve that issue.
Type de document :
Communication dans un congrès
Lawrence Moss. Formal Grammars and Mathematics of Langage Conference - FGMOl'01, 2001, Helsinki, Finland, 5 (5), 9 p, 2001, Electronic Notes in Computer Science
Liste complète des métadonnées

https://hal.inria.fr/inria-00100527
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 14:46:28
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • HAL Id : inria-00100527, version 1

Collections

Citation

Guillaume Bonfante, Philippe De Groote. Stochastic Lambek Categorial Grammars. Lawrence Moss. Formal Grammars and Mathematics of Langage Conference - FGMOl'01, 2001, Helsinki, Finland, 5 (5), 9 p, 2001, Electronic Notes in Computer Science. 〈inria-00100527〉

Partager

Métriques

Consultations de la notice

135