Conference Paper

Parser Combination by Reparsing.

DOI: 10.3115/1614049.1614082 Conference: Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, Proceedings, June 4-9, 2006, New York, New York, USA
Source: DBLP

ABSTRACT We present a novel parser combination scheme that works by reparsing input sen- tences once they have already been parsed by several different parsers. We apply this idea to dependency and constituent parsing, generating results that surpass state-of-the- art accuracy levels for individual parsers.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: There has been a rapid increase in the volume of research on data-driven dependency parsers in the past five years. This increase has been driven by the availability of treebanks in a wide variety of languages—due in large part to the CoNLL shared tasks—as well as the straightforward mechanisms by which dependency theories of syntax can encode complex phenomena in free word order languages. In this article, our aim is to take a step back and analyze the progress that has been made through an analysis of the two predominant paradigms for data-driven dependency parsing, which are often called graph-based and transition-based dependency parsing. Our analysis covers both theoretical and empirical aspects and sheds light on the kinds of errors each type of parser makes and how they relate to theoretical expectations. Using these observations, we present an integrated system based on a stacking learning framework and show that such a system can learn to overcome the shortcomings of each non-integrated system.
    Computational Linguistics 03/2011; 37(1):197-230. DOI:10.1162/coli_a_00039 · 1.47 Impact Factor
  • Source
    Conference Paper: Shift-Reduce CCG Parsing.
    [Show abstract] [Hide abstract]
    ABSTRACT: CCGs are directly compatible with binary-branching bottom-up parsing algorithms, in particular CKY and shift-reduce algorithms. While the chart-based approach has been the dominant approach for CCG, the shift-reduce method has been little explored. In this paper, we develop a shift-reduce CCG parser using a discriminative model and beam search, and compare its strengths and weaknesses with the chart-based C&C parser. We study different errors made by the two parsers, and show that the shift-reduce parser gives competitive accuracies compared to C&C. Considering our use of a small beam, and given the high ambiguity levels in an automatically-extracted grammar and the amount of information in the CCG lexical categories which form the shift actions, this is a surprising result.
    The 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Conference, 19-24 June, 2011, Portland, Oregon, USA; 01/2011
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Classication problems with a very large or unbounded set of output categories are com- mon in many areas such as natural language and image processing. In order to improve accuracy on these tasks, it is natural for a decision-maker to combine predictions from various sources. However, supervised data needed to t an aggregation model is often dicult to obtain, especially if needed for multiple domains. Therefore, we propose a generative model for unsupervised aggrega- tion which exploits the agreement signal to estimate the expertise of individual judges. Due to the large output space size, this aggre- gation model cannot encode expertise of con- stituent judges with respect to every category for all problems. Consequently, we extend it by incorporating the notion of category types to account for variability of the judge exper- tise depending on the type. The viability of our approach is demonstrated both on syn- thetic experiments and on a practical task of syntactic parser aggregation.


1 Download
Available from