 |
university of Provence - Aix-Marseille I |  |
|
university of Provence - Aix-Marseille I | |
| HAL: inria-00616688, version 1 |
| See detailed view |  BibTeX,EndNote,... |
 |
| IWPT'09 - 11th International Conference on Parsing Technologies, Paris : France (2009) |
|
|
|
|
| Constructing parse forests that include exactly the n-best PCFG trees |
|
|
| Pierre Boullier 1Alexis Nasr 2 |
|
|
| (2009) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | ALPAGE (INRIA Rocquencourt) |
|
|
|
INRIA – Université Paris VII - Paris Diderot |
|
|
| 2: | Laboratoire d'informatique Fondamentale de Marseille (LIF) |
|
|
|
CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I |
|
|
|
|
|
|
|
|
|
| Domain | : | Computer Science/Computation and Language |
| inria-00616688, version 1 | |
| http://hal.inria.fr/inria-00616688 | |
| oai:hal.inria.fr:inria-00616688 | |
| From: Benoît Sagot | |
| Submitted on: Tuesday, 23 August 2011 22:57:12 | |
| Updated on: Wednesday, 24 August 2011 10:12:03 | |
