Improving Language Generation from Feature-Rich Tree-Structured Data with Relational Graph Convolutional Encoders (D19-63)
Copied to clipboard
| Challenge: | The goal of the multilingual surface realization shared task is to generate fluent text from UD structures. |
| Approach: | They propose to use a graph convolutional network to encode the dependency trees given as input. |
| Outcome: | The proposed system achieves the third rank without data augmentation techniques or additional components. |
Similar Papers
Learning to Order Graph Elements with Application to Multilingual Surface Realization (D19-63)
Copied to clipboard
| Challenge: | Recent advances in deep learning have shown promises in solving combinatorial optimization problems, such as sorting variable-sized sequences. |
| Approach: | They propose an encoder-decoder framework that learns the representation for each element and predicts the ordering of each local neighborhood of the graph in turn. |
| Outcome: | The proposed framework outperforms previous frameworks on multilingual surface realization tasks while outperforming those below by a large margin. |
DepDist: Surface realization via regex and learned dependency-distance tolerance (D19-63)
Copied to clipboard
| Challenge: | The paper describes a method of inflecting and linearizing a lemmatized dependency tree by: (1) determining a regular expression and substitution to describe each productive wordform rule; (2) learning the dependency distance tolerance for each head-dependent pair; (3) topologically sorting the DAG into a surface realization based on edge weight. |
| Approach: | They propose a method of inflecting and linearizing a lemmatized dependency tree by learning the dependency distance tolerance for each head-dependent pair and topologically sorting the DAG into a surface order based on edge weight. |
| Outcome: | The proposed method generates a morphologically inflected surface order for 11 languages across 18 treebanks. |
Scalable Cross-lingual Treebank Synthesis for Improved Production Dependency Parsers (2020.coling-industry)
Copied to clipboard
| Challenge: | scalable Universal Dependency (UD) treebank synthesis techniques are used to improve production-grade parsers. |
| Approach: | They propose a data augmentation technique that uses synthetic treebanks to improve production-grade parsers. |
| Outcome: | The proposed technique improves LAS performance on seven languages by up to two points on production models trained on original UD treebanks. |
Enhancing Structure-aware Encoder with Extremely Limited Data for Graph-based Dependency Parsing (2022.coling-1)
Copied to clipboard
| Challenge: | Dependency parsing is an important natural language processing task which analyzes the syntactic structure of an input sentence. |
| Approach: | They propose a structure-aware encoder pre-trained on auto-parsed data to improve dependency parsing . they propose combining gold dependency trees with existing parsers to improve parser performance . |
| Outcome: | The proposed approach outperforms baselines under different parsers and dependency standards under different parameters and model architectures. |
Infusing Finetuning with Semantic Dependencies (2021.tacl-1)
Copied to clipboard
| Challenge: | Several diagnostics help to localize the benefits of our approach. |
| Approach: | They apply convolutional graph encoders to integrate semantic parses into task-specific finetuning. |
| Outcome: | The proposed approach yields benefits to natural language understanding (NLU) tasks in the GLUE benchmark. |
Surface Realization Shared Task 2019 (MSR19): The Team 6 Approach (D19-63)
Copied to clipboard
| Challenge: | This paper describes the approach developed by the Tilburg University team for the shallow track of the Multilingual Surface Realization Shared Task 2019 (SR'19). |
| Approach: | They propose a method for the shallow track of the Multilingual Surface Realization Shared Task 2019 using a rule-based and a statistical machine translation (SMT) model. |
| Outcome: | The proposed approach can generate texts in 11 languages, compared with the submission of the same approach for the same task in 2018 which only covered 6 languages. |
Language Embeddings for Typology and Cross-lingual Transfer Learning (2021.acl-long)
Copied to clipboard
| Challenge: | Recent efforts to leverage multilingual datasets highlight potential of multilingual models that can perform well across various languages. |
| Approach: | They propose to generate language representations that capture relationships among languages and evaluate them using WALS and two extrinsic tasks. |
| Outcome: | The proposed model can be leveraged in cross-lingual tasks without parallel data . the proposed model is based on the World Atlas of Language Structures (WALS) and two extrinsic tasks . |
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. |
Parser Training with Heterogeneous Treebanks (P18-2)
Copied to clipboard
| Challenge: | In the 2017 CoNLL Shared Task on Universal Dependency Parsing, 25 languages have more than one treebank . many teams did not take advantage of the multiple treebanks, however, and trained one model per treebank instead of one model for each language. |
| Approach: | They propose a method to make the most of heterogeneous treebanks when training a monolingual parser. |
| Outcome: | The proposed method improves on training with multiple treebanks for a single language. |
Learning Reasoning Patterns for Relational Triple Extraction with Mutual Generation of Text and Graph (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing methods focused on learning text patterns from explicit mentions but failed to extract the implicitly implied triples. |
| Approach: | They propose to construct a relational graph from a sentence and apply multi-layer graph convolutions to capture the type inference logic of the paths. |
| Outcome: | The proposed framework can find multi-hop reasoning paths and capture type inference logic with the sentence's supplementary relational expressions. |