CCGBank

Statistical parsing of noun phrase (NP) struc- ture has been hampered by a lack of gold- standard data. This is a significant problem for CCGbank, where binary branching NP deriva- …...

We introduce an extension to CCG that al- lows form and function to be represented simultaneously, reducing the proliferation of modifier categories seen in standard CCG analyses. We can then …...

This paper shows that discriminative reranking with an averaged perceptron model yields substantial improvements in realization quality with CCG. The paper confirms the utility of including language model log probabilities …...

AbstractWe describe a process for converting the Penn Arabic Treebank into the CCG formalism. Previous efforts have yielded CCGbanks in English, German, and Turkish, thus opening these languages to the …...

The definition of combinatory categorial grammar (CCG) in the literature varies quite a bit from author to author. How- ever, the differences between the defini- tions are important in terms …...

We combine two complementary ideas for learning supertaggers from highly am- biguous lexicons: grammar-informed tag transitions and models minimized via in- teger programming. Each strategy on its own greatly improves …...

Once released, treebanks tend to remain unchanged despite any shortcomings in their depth of linguistic analysis or cover- age of specific phenomena. Instead, sepa- rate resources are created to address …...

Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the …...

This paper presents a novel method of improving Combinatory Categorial Grammar (CCG) parsing using features generated from Dependency Grammar (DG) parses and combined using reranking. Different grammar formalisms have different …...

We present an approach to training a joint syntactic and semantic parser that com- bines syntactic training information from CCGbank with semantic training informa- tion from a knowledge base via …...

Incremental parsers have potential advantages for applications like language modeling for machine translation and speech recognition. We describe a new algorithm for incremental transition-based Combinatory Categorial Grammar parsing. As English …...

AbstractThe main obstacle to incremental sentence processing arises from right-branching constituent structures, which are present in the majority of English sentences, as well as optional constituents that adjoin on the …...

AbstractIncremental syntactic parsing has been an active research area both for cognitive scientists trying to model human sentence processing and for NLP researchers attempting to combine incremental parsing with language …...

AbstractSupertagging is conventionally regarded as an important task for combinatory categorial grammar (CCG) parsing, where effective modeling of contextual information is highly important to this task. However, existing studies have …...