Supertagging Combinatory Categorial Grammar with Attentive Graph Convolutional Networks (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies have focused on supertagging but have not tapped into contextual information. |
| Approach: | They propose to build a graph from chunks extracted from a lexicon and apply attention over it to enhance supertagging by leveraging contextual information. |
| Outcome: | The proposed approach outperforms previous studies in terms of supertagging and parsing. |
Similar Papers
LLM-supertagger: Categorial Grammar Supertagging via Large Language Models (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Recent studies have shown that LLMs are underperforming in classification tasks due to their decoder-based nature. |
| Approach: | They propose a method that significantly boosts LLMs' performance in supertagging for both Combinatory Categorial Grammar (CCG) and Lambek Categorian Grammar (LCG). |
| Outcome: | The proposed method outperforms LSTM and encoder-based models and achieves state-of-the-art performance. |
Relation Extraction with Word Graphs from N-grams (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies for relation extraction (RE) leverage the dependency tree of the input sentence to improve performance. |
| Approach: | They propose to use a graph convolutional network to build a context graph without dependency parsers. |
| Outcome: | The proposed approach improves neural RE methods without dependency parsers on English benchmark datasets. |
End-to-End Graph-Based TAG Parsing with Neural Networks (N18-1)
Copied to clipboard
| Challenge: | Using BiLSTMs, highway connections, and character-level CNNs, we propose a graph-based Tree Adjoining Grammar (TAG) parser. |
| Approach: | They propose a graph-based Tree Adjoining Grammar parser that uses BiLSTMs, highway connections, and character-level CNNs. |
| Outcome: | The proposed parser outperforms the previously reported best by more than 2.2 LAS and UAS points. |
Supertagging-based Parsing with Linear Context-free Rewriting Systems (2021.naacl-main)
Copied to clipboard
| Challenge: | a new supertagging-based parser for linear context-free rewriting systems is developed for discontinuous constituents . discontinuous constituencies span non-contiguous sets of positions in a sentence, and can be modelled by CFG . |
| Approach: | They propose a supertagging-based parser for linear context-free rewriting systems . they propose an efficient procedure which induces a lexical LCFRS from any discontinuous treebank . |
| Outcome: | The proposed method outperforms previous LCFRS-based parsers in accuracy and speed by a wide margin. |
Combinatory Grammar Tells Underlying Relevance among Entities (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches focus on dependencies among words while paying limited attention to other types of syntactic structure. |
| Approach: | They propose an alternative approach that takes advantage of combinatory categorial grammar to detect the relation between entities. |
| Outcome: | The proposed model performs state-of-the-art on two widely used English benchmark datasets. |
German and French Neural Supertagging Experiments for LTAG Parsing (P18-3)
Copied to clipboard
| Challenge: | Lexicalized Tree Adjoining Grammars are a linguistically motivated grammar formalism that allows parsers to express linguistic generalizations that are not captured by statistical parsing. |
| Approach: | They propose a supertagging approach combined with deep learning to extract LTAG supertags from the French Treebank and propose n-best supertailing for German and French. |
| Outcome: | The proposed supertagging approach is able to extract LTAG supertags from the French Treebank and n-best supertracking for German and German. |
HGCN4MeSH: Hybrid Graph Convolution Network for MeSH Indexing (2020.acl-srw)
Copied to clipboard
| Challenge: | Recent deep learning methods for MeSH indexing fail to capture complex correlations between terms. |
| Approach: | They propose a model to learn the relationship between MeSH terms using Graph Convolution Network (GCN) they use two biGRUs to learn embedding representations of abstract and title of MeSH index text . |
| Outcome: | The proposed model is competitive with the state-of-the-art models on two datasets. |
Supertagging the Long Tail with Tree-Structured Decoding of Complex Categories (2021.tacl-1)
Copied to clipboard
| Challenge: | Combinatory Categorial Grammar (CCG) parsers operate as a pipeline with a large search space of complex 'supertags' . |
| Approach: | They propose to use CCG supertags to generate CCG categories that have never been seen in training and to use tree-structured prediction to account for their internal structure. |
| Outcome: | The proposed model recovers a fraction of the long-tail supertags while approximating the state of the art in overall tag accuracy with fewer parameters. |
Global Context-enhanced Graph Convolutional Networks for Document-level Relation Extraction (2020.coling-main)
Copied to clipboard
| Challenge: | Existing approaches to document-level relation extraction are difficult to establish direct connections between distant entity pairs. |
| Approach: | They propose a global context-enhanced Graph Convolutional Network model which captures rich global context information of entities in a document. |
| Outcome: | The proposed model captures rich global context information of entities in a document. |
Automatic Generation of High Quality CCGbanks for Parser Domain Adaptation (P19-1)
Copied to clipboard
| Challenge: | Existing methods for Combinatory Categorial Grammar (CCG) parsing are limited to a specific parser architecture, making it non-trivial to apply to current parsers. |
| Approach: | They propose a domain adaptation method for Combinatory Categorial Grammar (CCG) they propose to generate CCG corpora using cheaper dependency trees. |
| Outcome: | The proposed method improves on speech conversation and math problems. |