Exact yet Efficient Graph Parsing, Bi-directional Locality and the Constructivist Hypothesis (2020.acl-main)
Copied to clipboard
| Challenge: | Existing algorithms for graph parsing are exponential or high-degree polynomial w.r.t. grammars, and there are few systems that can parse large but frequent MRs with a realistic, wide-coverage grammar in a reasonable time. |
| Approach: | They propose an exact graph parsing algorithm that exploits locality as terminal edge-adjacency in HRG rules and categorizes a subclass of HRG. |
| Outcome: | The proposed method can parse graphs with a (competence) grammar in a time-efficient manner. |
Similar Papers
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. |
Deep Contextualized Word Embeddings in Transition-Based and Graph-Based Dependency Parsing - A Tale of Two Parsers Revisited (D19-1)
Copied to clipboard
| Challenge: | In recent years, dependency parsing has shifted from discrete features to neural networks and continuous representations. |
| Approach: | They propose to use deep contextualized word embeddings to pack information about global sentence structure into local feature representations to make the two approaches virtually equivalent in terms of accuracy and error profile. |
| Outcome: | The proposed model improves the accuracy and error profile of transition-based and graph-based dependency parsers on 13 languages. |
Graph Formalisms for Meaning Representations (D18-3)
Copied to clipboard
| Challenge: | In this tutorial we will discuss hyperedge replacement languages (HRL) HRL are a graph rewriting system that is context-free . |
| Approach: | They will discuss hyperedge replacement languages (HRL) they will also discuss Regular Graph Languages (RGL) |
| Outcome: | This tutorial will discuss hyperedge replacement languages (HRL) they are one of the most popular graph formalisms to be studied in NLP . |
Generalized chart constraints for efficient PCFG and TAG parsing (P18-2)
Copied to clipboard
| Challenge: | Existing pruning techniques limit chart constraints to PCFGs and cannot be applied to more expressive grammars. |
| Approach: | They propose to apply chart constraints to more expressive grammars and a neural tagger which predicts chart constraints at very high precision. |
| Outcome: | The proposed technique accelerates both PCFG and TAG parsing by two orders of magnitude while improving accuracy. |
Proceedings of the Thirteenth Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs-13) (D19-53)
Copied to clipboard
| Challenge: | TextGraphs is a workshop on graph-based methods for natural language processing . the workshop is being organized in conjunction with the 9th International Joint Conference on Natural Language Processing . |
| Approach: | TextGraphs is the 13th edition of the Workshop on Graph-Based Methods for Natural Language Processing . the workshop promotes synergy between GT and natural language processing . |
| Outcome: | the 2013 edition of TextGraphs is being held in conjunction with the 9th International Joint Conference on Natural Language Processing in Hong Kong. |
Graph-based Dependency Parsing with Graph Neural Networks (P19-1)
Copied to clipboard
| Challenge: | In graph-based dependency parsers, learning representations is gaining in importance, and we use graph neural networks to learn the representations. |
| Approach: | They propose to use graph neural networks to learn dependency tree nodes and propose to add a new aggregation function to the system. |
| Outcome: | The proposed model achieves the best UAS and LAS on PTB (96.0%, 94.3%) without using external resources. |
LAGr: Label Aligned Graphs for Better Systematic Generalization in Semantic Parsing (2022.acl-long)
Copied to clipboard
| Challenge: | Semantic parsers struggle to generalize to examples with unseen combinations of seen rules from the training set. |
| Approach: | They propose a general framework to produce semantic parses by predicting node labels for a complete multi-layer input-aligned graph. |
| Outcome: | The proposed framework produces better generalizations than the baseline framework . it produces representations directly as a graph and not as sequences . |
Hierarchical Bracketing Encodings Work for Dependency Graphs (2025.emnlp-main)
Copied to clipboard
| Challenge: | Sequence labeling (SL) is a simple yet effective paradigm for a wide range of natural language problems. |
| Approach: | They propose a new bracketing approach for dependency graph parsing that encodes graphs as sequences and n tagging actions. |
| Outcome: | The proposed approach significantly reduces label space while preserving structural information. |
Graph-Based Meaning Representations: Design and Processing (P19-4)
Copied to clipboard
| Challenge: | This tutorial focuses on representing and processing sentence meaning in the form of labeled directed graphs. |
| Approach: | This tutorial will briefly review relevant background in formal and linguistic semantics . it will also briefly define a unified abstract view on different flavors of semantic graphs - and associated terminology . |
| Outcome: | The tutorial will briefly review relevant background in formal and linguistic semantics . |
Parsing into Variable-in-situ Logico-Semantic Graphs (2020.acl-main)
Copied to clipboard
| Challenge: | a new type of graph-based meaning representation allows analysis for scope-related phenomena. |
| Approach: | They propose variable-in-situ logico-semantic graphs to bridge gap between semantic graph and logical form parsing. |
| Outcome: | The proposed graph-based meaning representation achieves 92.39% accuracy in terms of elementary dependency match . the output of the proposed parser is highly coherent . |