Browse State-of-the-Art › CCG Supertagging
CCG Supertagging
8 papers with code · 1 benchmark · 2 datasets archive 2025-07-28
Combinatory Categorical Grammar (CCG; Steedman, 2000) is a highly lexicalized formalism. The standard parsing model of Clark and Curran (2007) uses over 400 lexical categories (or supertags), compared to about 50 part-of-speech tags for typical parsers.
Example:
| Vinken | , | 61 | years | old |
|---|---|---|---|---|
| N | , | N/N | N | (S[adj]\ NP)\ NP |
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
1 leaderboard table shown for this task, 1 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| CCGbank (8 rows) | Heterogeneous Dynamic Convolutions | Geometry-Aware Supertagging with Heterogeneous Dynamic Convolutions | code | — | Compare |
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
2 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Papers archive 2025-07-28
archive papers tagged: 24 · with a code link: 8 · where Syntology ran a sample: 2 (2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (2 of 24 tagged: 2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 24 of 24, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.
-
27 Aug 2018 5 repositories listed Syntology official: harvested, nothing ran · 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 4 harvested samples)We automatically construct a large number of minimally different pairs of English sentences, each consisting of a grammatical and an ungrammatical sentence.
-
23 Mar 2022 2 repositories listedThe syntactic categories of categorial grammar formalisms are structured units made of smaller, indivisible primitives, bound together by the underlying grammar's category formation rules.
-
21 Sep 2021 2 repositories listedThis report describes the parsing problem for Combinatory Categorial Grammar (CCG), showing how a combination of Transformer-based neural models and a symbolic CCG grammar can lead to substantial gains over existing…
-
23 Aug 2019 2 repositories listedCRF has been used as a powerful model for statistical sequence labeling.
-
22 Sep 2018 2 repositories listedWe therefore propose Cross-View Training (CVT), a semi-supervised learning algorithm that improves the representations of a Bi-LSTM sentence encoder using a mix of labeled and unlabeled data.
-
13 Oct 2020 1 repository listed Syntology official (archive's flag): 2 ran · 2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result (of 2 harvested samples)Specifically, we build the graph from chunks (n-grams) extracted from a lexicon and apply attention over the graph, so that different word pairs from the contexts within and across chunks are weighted in the model and…
-
12 Jun 2017 1 repository listedRecent work has explored the syntactic abilities of RNNs using the subject-verb agreement task, which diagnoses sensitivity to sentence structure.
-
11 Oct 2016 1 repository listedKeystroke dynamics have been extensively used in psycholinguistic and writing research to gain insights into cognitive processing.
-
CCG Supertagging as Top-down Tree Generation1 Feb 2021 0 repositories listed
-
Supertagging with CCG primitives1 Jul 2020 0 repositories listedIn CCG and other highly lexicalized grammars, supertagging a sentence’s words with their lexical categories is a critical step for efficient parsing.
-
Probing What Different NLP Tasks Teach Machines about Function Word Comprehension25 Apr 2019 0 repositories listedOur results show that pretraining on language modeling performs the best on average across our probing tasks, supporting its widespread use for pretraining state-of-the-art NLP models, and CCG supertagging and NLI…
-
An Empirical Investigation of Global and Local Normalization for Recurrent Neural Sequence Models Using a Continuous Relaxation to Beam Search15 Apr 2019 0 repositories listedGlobally normalized neural sequence models are considered superior to their locally normalized equivalents because they may ameliorate the effects of label bias.
-
Language Modeling Teaches You More than Translation Does: Lessons Learned Through Auxiliary Syntactic Task Analysis1 Nov 2018 0 repositories listedRecently, researchers have found that deep LSTMs trained on tasks like machine translation learn substantial syntactic and semantic information about their input sentences, including part-of-speech.
-
Linguistically Rich Vector Representations of Supertags for TAG Parsing1 Sep 2017 0 repositories listed
-
1 Aug 2017 0 repositories listedBeam search is a desirable choice of test-time decoding algorithm for neural sequence models because it potentially avoids search errors made by simpler greedy methods.
-
Initial Explorations of CCG Supertagging for Universal Dependency Parsing1 Aug 2017 0 repositories listedIn this paper we describe the system by METU team for universal dependency parsing of multilingual text.
-
An Empirical Exploration of Skip Connections for Sequential Tagging11 Oct 2016 0 repositories listedIn this paper, we empirically explore the effects of various kinds of skip connections in stacked bidirectional LSTMs for sequential tagging.
-
A Dynamic Window Neural Network for CCG Supertagging10 Oct 2016 0 repositories listedCombinatory Category Grammar (CCG) supertagging is a task to assign lexical categories to each word in a sentence.
-
1 Aug 2016 0 repositories listed
-
1 Jun 2016 0 repositories listed
-
Shift-Reduce CCG Parsing using Neural Network Models1 Jun 2016 0 repositories listed
-
1 Jun 2016 0 repositories listed
-
1 Jul 2015 0 repositories listed
-
Improved CCG Parsing with Semi-supervised Supertagging1 Jan 2014 0 repositories listedCurrent supervised parsers are limited by the size of their labelled training data, making improving them with unlabelled data an important goal.
Syntology lines on 2 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections