Filling Missing Paths: Modeling Co-occurrences of Word Pairs and Dependency Paths for Recognizing Lexical Semantic Relations (N18-1)
Copied to clipboard
| Challenge: | Existing approaches to recognize lexical semantic relations between word pairs require that word pairs co-occur in a sentence. |
| Approach: | They propose to exploit lexico-syntactic paths between two target words to exploit the semantic relations between word pairs. |
| Outcome: | The proposed model can generalize the co-occurrences of word pairs and dependency paths and extract features capturing relational information from word pairs. |
Similar Papers
Neural Latent Relational Analysis to Capture Lexical Semantic Relations in a Vector Space (D18-1)
Copied to clipboard
| Challenge: | Existing approaches to capture semantic relations of words in vector space are lacking information on lexico-syntactic patterns that connect word pairs in a corpus. |
| Approach: | They propose a pattern-based approach that exploits lexico-syntactic patterns as word pairs . they propose NLRA to generalize co-occurrences of word pairs and lexicon-sensitized embeddings of the word pairs that do not co-occur. |
| Outcome: | The proposed model outperforms existing models on measuring relational similarity . it can generalize word pairs and lexico-syntactic patterns and obtain embeddings of word pairs that do not co-occur . |
Recognizing Semantic Relations by Combining Transformers and Fully Connected Models (2020.lrec-1)
Copied to clipboard
| Challenge: | Current approaches to recognizing semantic relations between words are limited and require a word-path model. |
| Approach: | They propose a distributional approach that is based on an attention-based transformer and a word path model that combines useful properties of a convolutional network with a fully connected language model. |
| Outcome: | The proposed model outperforms the state-of-the-art in terms of performance and data sources. |
Language Models and Semantic Relations: A Dual Relationship (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing studies on language models for the extraction of semantic relations have focused on injecting semantic knowledge into these models to enhance them. |
| Approach: | They propose to extract lexical semantic relations from a BERT model and inject them into it using unsupervised methods based on semantic similarity at word and sentence levels. |
| Outcome: | The proposed method allows to enrich a BERT model without using any external semantic resource. |
Bridging the Defined and the Defining: Exploiting Implicit Lexical Semantic Relations in Definition Modeling (D19-1)
Copied to clipboard
| Challenge: | Existing definition modeling methods do not utilize lexical semantic relations between defined words and defining words. |
| Approach: | They propose definition modeling methods that use lexical semantic relations . they use unsupervised pattern-based word-pair embeddings that represent semantic relations of word pairs . |
| Outcome: | The proposed methods improve definition generation and learning embeddings from definitions. |
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. |
The Return of Lexical Dependencies: Neural Lexicalized PCFGs (2020.tacl-1)
Copied to clipboard
| Challenge: | Existing approaches to grammar induction focus on discovering constituents or dependencies. |
| Approach: | They propose to model lexical dependencies using context free grammars instead of lexicals . they show that this unified framework induces both constituents and dependencies . |
| Outcome: | The proposed model overcomes sparsity problems and induces constituents and dependencies better than the current methods. |
Lexical Relation Mining in Neural Word Embeddings (2020.coling-main)
Copied to clipboard
| Challenge: | Conventionally, lexical relations in word vector space have been defined by collections of relatively consistent relationships, or vector offsets, between word-pairs. |
| Approach: | They propose to use Word2Vec space of word-pairs to find lexical relations . they also demonstrate a method for approximating the presence of syntactic and semantic relations based on word vectors extracted from word embeddings. |
| Outcome: | The proposed method outperforms other validated methods in the presence of noisy offsets. |
Exploiting the Syntax-Model Consistency for Neural Relation Extraction (2020.acl-main)
Copied to clipboard
| Challenge: | Existing deep learning models for Relation Extraction (RE) have limited generalization beyond the syntactic structures of the input sentences. |
| Approach: | They propose a deep learning model that uses dependency trees to extract syntactic importance of words for Relation Extraction. |
| Outcome: | The proposed model outperforms existing models on three RE benchmark datasets. |
Talking the Talk Does Not Entail Walking the Walk: On the Limits of Large Language Models in Lexical Entailment Recognition (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Verbs are crucial for expressing actions and relationships between entities, making it essential to properly capture their nuances. |
| Approach: | They propose to use prompting strategies and zero-shot prompting to recognize entailment relations among verbs from two lexical databases, WordNet and HyperLex. |
| Outcome: | The proposed models can tackle the lexical entailment recognition task with moderately good performance, although at varying degree of effectiveness and under different conditions. |
Learning Features from Co-occurrences: A Theoretical Analysis (C18-1)
Copied to clipboard
| Challenge: | Existing theories for word classification and clustering are lacking. |
| Approach: | They propose a theory that uses a function to represent a word by its co-occurrences with other words in context. |
| Outcome: | The proposed model improves word classification and clustering by using multiple features. |