Переранжировка парсинга

We propose the use of Lexicalized Tree Adjoining Grammar (LTAG) as a source of features that are useful for reranking the output of a statistical parser. In this paper, we …...

This paper introduces a new application of boost- ing for parse reranking. Several parsers have been proposed that utilize the all-subtrees representa- tion (e.g., tree kernel and data oriented parsing). …...

We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approaches to expected loss ap- …...

Many different types of features have been shown to improve accuracy in parse reranking. A class of features that thus far has not been considered is based on a pro- …...

A common approach to dependency parsing is scoring a parse via a linear function of a set of indicator features. These features are typically manually constructed from templates that are …...