Geometry-Aware Supertagging with Heterogeneous Dynamic Convolutions
Not on the map. Why?
Abstract (arXiv)
The syntactic categories of categorial grammar formalisms are structured units made of smaller, indivisible primitives, bound together by the underlying grammar's category formation rules. In the trending approach of constructive supertagging, neural models are increasingly made aware of the internal category structure, which in turn enables them to more reliably predict rare and out-of-vocabulary categories, with significant implications for grammars previously deemed too complex to find practical use. In this work, we revisit constructive supertagging from a graph-theoretic perspective, and propose a framework based on heterogeneous dynamic graph convolutions aimed at exploiting the distinctive structure of a supertagger's output space. We test our approach on a number of categorial grammar datasets spanning different languages and grammar formalisms, achieving substantial improvements over previous state of the art scores. Code will be made available at https://github.com/konstantinosKokos/dynamic-graph-supertagging
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 34 of its 64 references that are in the map. First posted on arXiv 23 Mar 2022.
Builds on
34 of 64 references.
References · 34
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2017Graph Attention Networkscited by 8,854
- 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,898
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2020GLU Variants Improve Transformercited by 1,724
- 2017Decoupled Weight Decay Regularizationcited by 1,722
- 2019Root Mean Square Layer Normalizationcited by 1,425
- 2018Self-Attention with Relative Position Representationscited by 1,112
- 2019When Does Label Smoothing Help?cited by 985
22 more
- 2021How Attentive are Graph Attention Networks?cited by 818
- 2015Gated Graph Sequence Neural Networkscited by 792
- 2016Language Modeling with Gated Convolutional Networkscited by 688
- 2018Universal Transformerscited by 613
- 2019Deep Equilibrium Modelscited by 603
- 2019Graph Transformer Networkscited by 520
- 2019EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphscited by 443
- 2019CamemBERT: a Tasty French Language Modelcited by 368
- 2015Unitary Evolution Recurrent Neural Networkscited by 291
- 2016Using the Output Embedding to Improve Language Modelscited by 266
- 2019Efficient Graph Generation with Graph Recurrent Attention Networkscited by 231
- 2019BERTje: A Dutch BERT Modelcited by 109
- 2019Graph Transformer for Graph-to-Sequence Learningcited by 82
- 2019Trivializations for Gradient-Based Optimization on Manifoldscited by 78
- 2018Semi-Supervised Sequence Modeling with Cross-View Trainingcited by 75
- 2019Modeling Graph Structure in Transformer for Better AMR-to-Text Generationcited by 35
- 2020Supertagging the Long Tail with Tree-Structured Decoding of Complex Categoriescited by 11
- 2020Neural Proof Netscited by 8
- 2020Supertagging Combinatory Categorial Grammar with Attentive Graph Convolutional Networkscited by 7
- 2019Constructive Type-Logical Supertagging with Self-Attention Networkscited by 5
- 2019AE THEL: Automatically Extracted Typelogical Derivations for Dutchcited by 5
- 2021Generating CCG Categoriescited by 2
Built on by
Citing papers per year: 2022: 1; 2023: 2.
3 papers.
- 2023Revisiting Supertagging for Faster HPSG Pasingcited by 4
- 2023SPINDLE: Spinning Raw Text into Lambda Terms with Graph Attentioncited by 1
- 2022Perspectives on neural proof netscited by 0
- 2023Revisiting Supertagging for Faster HPSG Pasing14 Sep 2023
- 2023SPINDLE: Spinning Raw Text into Lambda Terms with Graph Attention23 Feb 2023
- 2022Perspectives on neural proof nets8 Nov 2022