Higher-Order Syntactic Attention Network for Longer Sentence Compression (N18-1)
Copied to clipboard
| Challenge: | Existing sentence compression methods do not handle syntactic features, causing performance degradation . et al. (2015) reported that the longer the input sentences are, the worse the performance becomes. |
| Approach: | They propose a higher-order syntactic attention network that handles higher-level dependency features as an attention distribution on LSTM hidden states. |
| Outcome: | The proposed method outperforms baseline methods on a Google sentence compression dataset. |
Similar Papers
Deep Attentive Sentence Ordering Network (D18-1)
Copied to clipboard
| Challenge: | Existing methods for sentence ordering tasks rely on linguistic knowledge and are domain specific. |
| Approach: | They propose a deep attentive sentence ordering network which integrates self-attention mechanism with LSTMs in the encoding of input sentences. |
| Outcome: | The proposed model outperforms the state-of-the-art models on Sentence Ordering and Order Discrimination tasks and is shown to be highly efficient. |
A Deep Neural Network Sentence Level Classification Method with Context Information (D18-1)
Copied to clipboard
| Challenge: | Existing methods that use context for sentence classification are difficult to scale . Usually, sentences are treated as separate instances for the task . however, in many situations the sentence that is the focus of classification appears in a context that can provide additional information. |
| Approach: | They propose a method that uses potentially large contexts to classify sentences . they use an LSTM, and short-span features to classize sentences based on a stacked CNN . |
| Outcome: | The proposed method consistently improves on two different datasets. |
Phrase-level Self-Attention Networks for Universal Sentence Encoding (D18-1)
Copied to clipboard
| Challenge: | Phrase-level self-attention networks (PSAN) can capture context dependencies at the phrase level instead of the sentence level. |
| Approach: | They propose to perform self-attention across words inside a phrase to capture context dependencies at the phrase level and use the gated memory updating mechanism to refine each word’s representation hierarchically with longer-term context dependency captured in a larger phrase. |
| Outcome: | The proposed model can achieve state-of-the-art performance across a plethora of NLP tasks including binary and multi-class classification, natural language inference and sentence similarity. |
MODE-LSTM: A Parameter-efficient Recurrent Network with Multi-Scale for Sentence Classification (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing models for sentence classification use linear convolution, which may not be sufficient to model the non-consecutive dependency of the phrase and may overfit the sequential information. |
| Approach: | They propose a model that extracts multi-scale n-gram features for understanding the semantic meaning of sentences by some key-phrases located at different positions. |
| Outcome: | The proposed model outperforms existing models on eight benchmark datasets and is competitive against state-of-the-art models. |
Sparsity and Sentence Structure in Encoder-Decoder Attention of Summarization Systems (2021.emnlp-main)
Copied to clipboard
| Challenge: | Training and inference using large transformer models can be computationally expensive because the self-attention's time and memory grow quadratically with sequence length. |
| Approach: | They propose a modified transformer architecture that constrains the encoder-decoder attention mechanism to a subset of input sentences while maintaining system performance. |
| Outcome: | The proposed architecture can be trained and inferenced using large transformer models with expensive training and induction costs. |
Enhancing Machine Translation with Dependency-Aware Self-Attention (2020.acl-main)
Copied to clipboard
| Challenge: | Currently, most neural machine translation models rely on pairs of parallel sentences, assuming syntactic information is automatically learned by an attention mechanism. |
| Approach: | They propose a parameter-free, dependency-aware self-attention mechanism that integrates syntactic knowledge into a Transformer model and propose 'a parameter free approach' they also propose - a novel mechanism that improves translation quality for long sentences and in low-resource scenarios. |
| Outcome: | The proposed approach improves translation quality on English-German and English-Turkish translation tasks and in low-resource scenarios. |
Revisiting Higher-Order Dependency Parsers (2020.acl-main)
Copied to clipboard
| Challenge: | Neural encoders have allowed dependency parsers to shift from higher-order structured models to simpler first-order ones, making decoding faster and still achieving better accuracy than non-neural parser. |
| Approach: | They found that neural parsers may benefit from higher-order features when employing a powerful pre-trained encoder, such as BERT. |
| Outcome: | Using a pre-trained encoder, we found that higher-order models are more accurate on full sentence parses and match of modifier lists. |
BERT-enhanced Relational Sentence Ordering Network (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to improve coherence modeling for paragraphs have been developed. |
| Approach: | They propose a BERT-enhanced Relational Sentence Ordering Network to capture better dependency relationship among sentences and exploit it with a deep relational module. |
| Outcome: | The proposed model shows significant improvement over the state-of-the-art on six datasets. |
A Richer-but-Smarter Shortest Dependency Path with Attentive Augmentation for Relation Extraction (N19-1)
Copied to clipboard
| Challenge: | Existing approaches to extract relationship between entities in sentences suffer from missing or redundant information. |
| Approach: | They propose a deep neural model that combines the advantages of the two approaches to extract the relationship between two entities in a sentence. |
| Outcome: | The proposed model outperforms baseline models on the SemEval-2010 dataset. |
A Silver Bullet or a Compromise for Full Attention? A Comprehensive Study of Gist Token-based Context Compression (2025.acl-long)
Copied to clipboard
| Challenge: | gist-based context compression methods can achieve only slight performance loss on tasks like retrieval-augmented generation and long-document QA, but it faces challenges in tasks like synthetic recall. |
| Approach: | They propose two strategies to improve gist-based context compression in large language models. |
| Outcome: | The proposed methods can achieve only slight performance loss on retrieval-augmented generation and long-document QA tasks, but they face challenges in tasks like synthetic recall. |