Combinatory Category Grammar (CCG) supertagging is a task to assign lexical categories to each word in a sentence. Almost all previous methods use fixed context window sizes to encode input tokens. However, it is obvious that different tags usually rely on different context window sizes. This motivates us to build a supertagger with a dynamic window approach, which can be treated as an attention mechanism on the local contexts. We find that applying dropout on the dynamic filters is superior to the regular dropout on word embeddings. We use this approach to demonstrate the state-of-the-art CCG supertagging performance on the standard test set
Combinatory Categorial Grammar (CCG) is a lexicalized grammar formalism in which words are associate...
The ability to accurately represent sentences is central to language understanding. We describe a co...
Tree adjoining grammar parsers can use a su-pertagger as a preprocessor to help disam-biguate the ca...
International audienceAfter presenting a new CCG supertagging algorithm based on morphological and d...
Previous CCG supertaggers usually predict categories using multi-class classification. Despite their...
Current supervised parsers are limited by the size of their labelled training data, making improving...
Combinatory Categorial Grammar (CCG) categories contain syntactic and semantic information. CCG deri...
We introduce a new CCG parsing model which is factored on lexical category as-signments. Parsing is ...
This paper reports on progress towards developing the first broad coverage English surface realizer ...
We present a Bayesian formulation for weakly-supervised learning of a Combinatory Categorial Grammar...
International audienceWe present supertagging-based models for Tree Adjoining Grammar parsing that u...
This paper reports on progress towards de-veloping the first broad coverage English surface realizer...
The central topic of this thesis is the task of syntactic parsing with Combinatory Categorial Gramma...
EuroMatrixPlus project funded by the European Commission, 7th Framework ProgrammeParsing is the task...
Abstract. We present a novel ensemble of six methods for improving the efficiency of chart realizati...
Combinatory Categorial Grammar (CCG) is a lexicalized grammar formalism in which words are associate...
The ability to accurately represent sentences is central to language understanding. We describe a co...
Tree adjoining grammar parsers can use a su-pertagger as a preprocessor to help disam-biguate the ca...
International audienceAfter presenting a new CCG supertagging algorithm based on morphological and d...
Previous CCG supertaggers usually predict categories using multi-class classification. Despite their...
Current supervised parsers are limited by the size of their labelled training data, making improving...
Combinatory Categorial Grammar (CCG) categories contain syntactic and semantic information. CCG deri...
We introduce a new CCG parsing model which is factored on lexical category as-signments. Parsing is ...
This paper reports on progress towards developing the first broad coverage English surface realizer ...
We present a Bayesian formulation for weakly-supervised learning of a Combinatory Categorial Grammar...
International audienceWe present supertagging-based models for Tree Adjoining Grammar parsing that u...
This paper reports on progress towards de-veloping the first broad coverage English surface realizer...
The central topic of this thesis is the task of syntactic parsing with Combinatory Categorial Gramma...
EuroMatrixPlus project funded by the European Commission, 7th Framework ProgrammeParsing is the task...
Abstract. We present a novel ensemble of six methods for improving the efficiency of chart realizati...
Combinatory Categorial Grammar (CCG) is a lexicalized grammar formalism in which words are associate...
The ability to accurately represent sentences is central to language understanding. We describe a co...
Tree adjoining grammar parsers can use a su-pertagger as a preprocessor to help disam-biguate the ca...