Abstract
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. In turn, this 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.
approach on a number of categorial grammar datasets spanning different languages and grammar formalisms, achieving substantial improvements over previous state of the art scores.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 2023 CLASP Conference on Learning with Small Data |
| Publisher | Association for Computational Linguistics |
| Pages | 107-119 |
| ISBN (Electronic) | 979-8-89176-000-4 |
| Publication status | Published - 2023 |
| MoE publication type | A4 Conference publication |
| Event | Learning with Small Data - Gothenburg, Sweden Duration: 11 Sept 2023 → 12 Sept 2023 |
Publication series
| Name | CLASP Papers in Computational Linguistics |
|---|---|
| Publisher | Association for Computational Linguistics |
| Volume | 5 |
| ISSN (Electronic) | 2002-9764 |
Conference
| Conference | Learning with Small Data |
|---|---|
| Abbreviated title | LSD |
| Country/Territory | Sweden |
| City | Gothenburg |
| Period | 11/09/2023 → 12/09/2023 |