Constructing parse forests that include exactly the n-best PCFG trees - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

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

(1) , (2) , (1)
1
2

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.
Not file

Dates and versions

inria-00616688 , version 1 (23-08-2011)

Identifiers

  • HAL Id : inria-00616688 , version 1

Cite

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. ⟨inria-00616688⟩
71 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More