| Challenge: | Recent work ignores features other than surface strings and suffers from data hunger issue. |
| Approach: | They propose to use simile sentence classification and simile component extraction to find simile components. |
| Outcome: | The proposed model outperforms current state-of-the-art systems and baselines. |
Similar Papers
What you can cram into a single $&!#* vector: Probing sentence embeddings for linguistic properties (P18-1)
Copied to clipboard
| Challenge: | a lack of understanding of the properties of sentence embeddings is limiting the use of the techniques. |
| Approach: | They propose 10 probing tasks designed to capture simple linguistic features of sentences . they use three different encoders to train embeddings in eight different ways . |
| Outcome: | The proposed tasks capture key linguistic features of sentences, but they are difficult to infer from them. |
Separating Retention from Extraction in the Evaluation of End-to-end Relation Extraction (2021.emnlp-main)
Copied to clipboard
| Challenge: | State-of-the-art NLP models adopt shallow heuristics that limit their generalization capability. |
| Approach: | They propose to use heuristics that limit their generalization capability to model lexical overlap with the training set in Named-Entity Recognition and Event or Type heuristic in Relation Extraction to test their models. |
| Outcome: | The proposed model can perform better on the two key tasks, while the retention of training relation triples. |
BERT Has More to Offer: BERT Layers Combination Yields Better Sentence Embeddings (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Obtaining sentence representations from BERT-based models is valuable as it takes less time to pre-compute a one-time representation of the data and then use it for the downstream tasks. |
| Approach: | They propose to combine certain layers of a BERT-based model rested on the data set and model to achieve substantially better results. |
| Outcome: | The proposed method outperforms baseline models on seven semantic textual similarity datasets and on eight transfer data sets. |
Unleashing the True Potential of Sequence-to-Sequence Models for Sequence Tagging and Structure Parsing (2023.tacl-1)
Copied to clipboard
| Challenge: | Sequence-to-Sequence (S2S) models have been successful on text generation tasks . however, learning complex structures with S2S models remains challenging . |
| Approach: | They propose to use constrained decoding to model part-of-speech tagging, named entity recognition, constituency, and dependency parsing tasks with 3 lexically diverse linearization schemas and corresponding constrained coding methods. |
| Outcome: | The proposed methods outperform the state-of-the-art on four core tasks. |
Probing Linguistic Features of Sentence-Level Representations in Neural Relation Extraction (2020.acl-main)
Copied to clipboard
| Challenge: | Neural relation extraction models capture linguistic and semantic properties of the input, a recent study shows. |
| Approach: | They introduce 14 probing tasks targeting linguistic properties relevant to RE . they add contextualized word representations to enhance probing performance . |
| Outcome: | The proposed models achieve state-of-the-art on two datasets, TACRED and SemEval 2010 Task 8 . they show that the models capture linguistic and semantic properties relevant to the downstream task . |
Matching the Blanks: Distributional Similarity for Relation Learning (P19-1)
Copied to clipboard
| Challenge: | Efforts to build general purpose relation extractors that can model arbitrary relations are limited in their ability to generalize. |
| Approach: | They propose to build task-agnostic relation representations solely from entity-linked text to extend Harris’ distributional hypothesis to relations. |
| Outcome: | The proposed representations outperform previous methods on SemEval 2010 Task 8, KBP37, and TACRED even without using any of the task’s training data. |
Interpretable Text Embeddings and Text Similarity Explanation: A Survey (2025.emnlp-main)
Copied to clipboard
| Challenge: | Text embeddings are a fundamental component in many NLP tasks, but their interpretation and explanation remain challenging. |
| Approach: | They propose a framework for interpretable text embeddings and text similarity explanation . they characterize the main ideas, approaches, and trade-offs and discuss lessons learned . |
| Outcome: | The proposed methods are compared with existing models and compare them with existing ones. |
Figurative Language in Recognizing Textual Entailment (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing RTE models struggle to capture figurative language, despite its ubiquity, it remains a bottleneck in automatic text understanding. |
| Approach: | They propose to frame five existing figurative language datasets into over 12,500 RTE examples. |
| Outcome: | The proposed models struggle to perform pragmatic inference and reasoning about world knowledge. |
GraphLSS: Integrating Lexical, Structural, and Semantic Features for Long Document Extractive Summarization (2025.naacl-short)
Copied to clipboard
| Challenge: | Graph-based methods for extracting documents have been popular, but they often require external tools or additional machine learning models to define graph components. |
| Approach: | They propose a heterogeneous graph construction for extractive summarization that defines two levels of information and four types of edges without any need for auxiliary learning models. |
| Outcome: | The proposed graph construction outperforms previous graph-based models on two datasets and is available on GitHub. |
An analysis of language models for metaphor recognition (2020.coling-main)
Copied to clipboard
| Challenge: | Metaphor recognition systems that are based on language models perform substantially worse on unconventional metaphors than on conventional ones. |
| Approach: | They conduct a linguistic analysis of recent metaphor recognition systems based on language models and a variant of BERT language models to examine their performance. |
| Outcome: | The proposed systems show that they can recognise unseen words if synonyms or morphological variations have been seen before, leading to enhanced generalisation beyond word sense disambiguation. |