Constructing parse forests that include exactly the n-best PCFG trees

Abstract : This paper describes and compares two algorithms that take as input a shared PCFG parse forest and produce shared forests that contain exactly the n most likely trees of the initial forest. Such forests are suitable for subsequent processing, such as (some types of) reranking or LFG f-structure computation, that can be performed ontop of a shared forest, but that may have a high (e.g., exponential) complexity w.r.t. the number of trees contained in the forest. We evaluate the performances of both algorithms on real-scale NLP forests generated with a PCFG extracted from the Penn Treebank.
Type de document :
Communication dans un congrès
IWPT'09 - 11th International Conference on Parsing Technologies, Oct 2009, Paris, France. 2009
Liste complète des métadonnées

https://hal.inria.fr/inria-00616688
Contributeur : Benoît Sagot <>
Soumis le : mardi 23 août 2011 - 22:57:12
Dernière modification le : mardi 17 avril 2018 - 11:29:20

Identifiants

  • HAL Id : inria-00616688, version 1

Collections

Citation

Pierre Boullier, Alexis Nasr, Benoît Sagot. Constructing parse forests that include exactly the n-best PCFG trees. IWPT'09 - 11th International Conference on Parsing Technologies, Oct 2009, Paris, France. 2009. 〈inria-00616688〉

Partager

Métriques

Consultations de la notice

92