Dominick Ng and James R. Curran. 2012. Dependency Hashing for n-best CCG Parsing. In Proceedings of the 50th Annual Meeting of the Association for Computational ...

Jul 8, 2012 · We find that this mismatch causes many n-best CCG parses to be semantically equivalent, and describe a hashing technique that eliminates this ...

Table of Contents · 1 Introduction · 2 Background. 2.1 Corpora and evaluation; 2.2 The C & C parser; 2.3 n-best parsing and reranking · 3 Ambiguity in n-best CCG ...

Aug 16, 2014 · Dependency Hashing (1) • Constraint: any n-best candidate must not have the same dependencies as any candidate already in the list. ... Similar in ...

We develop novel first- and second-order features for dependency parsing based on the Google Syntactic Ngrams corpus, a collection of subtree counts of parsed ...

This thesis develops a constraint-based evaluation for dependency and Combinatory Categorial Grammar (CCG) parsers to address this deficiency. We examine the ...

Curran (2012). Dependency Hashing for n-best CCG Parsing. In Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics (Volume 1: ...

Dependency Hashing for n-best CCG Parsing · Effective Self-Training for Parsing · Parse Reranking Based on Higher-Order Lexical Dependencies · Reranking a wide- ...

This paper describes a wide-coverage statistical parser that uses Combinatory Categorial Grammar (CCG) to derive dependency structures.

This paper presents a novel method of improving Combinatory Categorial Grammar (CCG) parsing using features generated from Dependency Grammar (DG) parses and ...