Unifying Parsing and Tree-Structured Models for Generating Sentence Semantic Representations (2022.naacl-srw)
Copied to clipboard
| Challenge: | Existing tree-based models require handannotated data to be trained. |
| Approach: | They propose a tree-based model that learns its composition function together with its structure. |
| Outcome: | The proposed model outperforms existing models on downstream tasks and is competitive with Bert base model. |
Similar Papers
On Tree-Based Neural Sentence Modeling (D18-1)
Copied to clipboard
| Challenge: | Existing tree-based sentence modeling approaches adopt syntactic parsing trees as the explicit structure prior. |
| Approach: | They replace parsing trees with trivial trees to study their effectiveness . they found that tree-based sentence modeling gives better results when crucial words are closer to the final representation . |
| Outcome: | The proposed tree-based sentences have shown better results on many downstream tasks. |
Learning Sentence Representations over Tree Structures for Target-Dependent Classification (N18-1)
Copied to clipboard
| Challenge: | Existing work on tree structures uses syntactic parsers or Treebank annotations to perform target-dependent classifications. |
| Approach: | They propose a reinforcement learning based approach which automatically induces target-specific sentence representations over tree structures. |
| Outcome: | The proposed model gives superior performance on two benchmark tasks compared to previous work on parsed trees . |
Dependency parsing with structure preserving embeddings (2021.eacl-main)
Copied to clipboard
| Challenge: | Modern neural approaches to dependency parsing are trained to predict a tree structure by learning a contextual representation for tokens in a sentence and a head–dependent scoring function. |
| Approach: | They propose to combine a contextual representation for tokens and a head–dependent scoring function to learn interpretable representations by training a parser to explicitly preserve structural properties of a tree. |
| Outcome: | The proposed approach yields strong tree distance preservation and parsing performance on par with a competitive graph-based parser. |
Discourse Representation Parsing for Sentences and Documents (P19-1)
Copied to clipboard
| Challenge: | Experimental results show that our model outperforms competitive baselines by a wide margin. |
| Approach: | They propose a neural model which parses discourse structures of arbitrary length and granularity. |
| Outcome: | The proposed model outperforms baseline models on sentence- and document-level benchmarks. |
Learned Incremental Representations for Parsing (2022.acl-long)
Copied to clipboard
| Challenge: | a new syntactic representation that commits to syntakic choices is proposed for humans . we use a system that uses only incremental processing of a prefix to predict the word in a sentence . |
| Approach: | They propose a syntactic representation that commits to syntakic choices incrementally . they say the system can achieve 93.72 F1 on the Penn Treebank with as few as 5 bits per word . |
| Outcome: | The proposed representation achieves 93.72 F1 on the Penn Treebank with as few as 5 bits per word . the analysis of the representations shows they have interpretable features and deferred resolution of syntactic ambiguities. |
Considering Nested Tree Structure in Sentence Extractive Summarization with Pre-trained Transformer (2021.emnlp-main)
Copied to clipboard
| Challenge: | Sentence extractive summarization shortens a document by selecting sentences for a summary while preserving its important contents. |
| Approach: | They propose a nested tree-based extractive summarization model on RoBERTa that uses syntactic and discourse trees to represent sentences in a given document. |
| Outcome: | The proposed model outperforms baseline models on the CNN/DailyMail dataset and achieves significantly better scores than the baseline models in terms of coherence and comparable scores to the state-of-the-art models. |
Unsupervised Learning of Sentence Embeddings Using Compositional n-Gram Features (N18-1)
Copied to clipboard
| Challenge: | Currently, unsupervised word embeddings are routinely trained on large amounts of raw text data. |
| Approach: | They propose to use unsupervised word embeddings to train distributed representations of sentences. |
| Outcome: | The proposed method outperforms state-of-the-art models on most benchmark tasks and is robust to the produced general-purpose sentence embeddings. |
StructSum: Summarization via Structured Representations (2021.eacl-main)
Copied to clipboard
Vidhisha Balachandran, Artidoro Pagnoni, Jay Yoon Lee, Dheeraj Rajagopal, Jaime Carbonell, Yulia Tsvetkov
| Challenge: | Abstractive summarization models overfit to training corpora, lack of transparency and layout bias . authors propose incorporating latent and explicit dependencies across sentences in source document . |
| Approach: | They propose a framework based on document-level structure induction to address layout bias and lack of transparency in abstractive summarization models. |
| Outcome: | The proposed framework improves coverage of content in the source documents and generates more abstractive summaries by generating more novel n-grams. |
Single Document Summarization as Tree Induction (N19-1)
Copied to clipboard
| Challenge: | Existing approaches to extractive summarization use recurrent neural networks to model document . Existing systems use a vector representation for each sentence to generate a summary . |
| Approach: | They propose a model that induces a multi-root dependency tree while predicting the output summary. |
| Outcome: | The proposed model performs competitively against state-of-the-art methods on two benchmark datasets. |
Discourse Representation Structure Parsing (P18-1)
Copied to clipboard
| Challenge: | Existing semantic parsers are data-driven using annotated examples consisting of utterances and their meaning representations. |
| Approach: | They propose a method which transforms Discourse Representation Structures (DRSs) to trees and develop a structure-aware model which decomposes the decoding process into three stages. |
| Outcome: | The proposed model outperforms baseline models on the Groningen Meaning Bank (GMB) by a wide margin. |