Every Child Should Have Parents: A Taxonomy Refinement Algorithm Based on Hyperbolic Term Embeddings (P19-1)
Copied to clipboard
| Challenge: | Existing approaches to domain-specific taxonomy induction from text are relying on distributional semantics for hyponym-hypernym relationships, but many of them learn prototypical hypernymes, not taking into account the relation between both terms in classification. |
| Approach: | They propose to use Poincaré embeddings to improve existing approaches to domain-specific taxonomy induction from text as a signal for relocating wrong hyponym terms and attaching disconnected terms in a taxonomies. |
| Outcome: | The proposed method significantly improves state-of-the-art methods on the SemEval-2016 Task 13 on taxonomy extraction. |
Similar Papers
Insert or Attach: Taxonomy Completion via Box Embedding (2024.acl-long)
Copied to clipboard
| Challenge: | Existing taxonomy expansion methods embed concepts as vectors in Euclidean space, causing incorrectly model asymmetric relations. |
| Approach: | They propose to use box containment and center closeness to create geometric scorers that capture intrinsic relationships between concepts. |
| Outcome: | The proposed framework outperforms existing methods on four real-world datasets. |
End-to-End Reinforcement Learning for Automatic Taxonomy Induction (P18-1)
Copied to clipboard
| Challenge: | Existing methods for automating taxonomy induction often divide the problem into two subtasks . a novel end-to-end reinforcement learning approach is proposed to improve the accuracy of such methods. |
| Approach: | They propose an end-to-end reinforcement learning approach to automatic taxonomy induction from a set of terms. |
| Outcome: | The proposed approach outperforms state-of-the-art methods on two public datasets of different domains. |
HyperExpan: Taxonomy Expansion with Hyperbolic Representation Learning (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing taxonomies have limited coverage due to expensive manual curation process. |
| Approach: | They propose an algorithm that expands existing taxonomies to preserve their structure in a more expressive hyperbolic embedding space and learns to represent concepts and their relations with a hyperbolical Graph Neural Network. |
| Outcome: | The proposed algorithm outperforms baseline models with representation learning in a Euclidean feature space and achieves state-of-the-art performance on the taxonomy expansion benchmarks. |
More Embeddings, Better Sequence Labelers? (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing work suggests contextual embeddings improve sequence labeling accuracy . but, there is no definite conclusion on whether concatenating different kinds of embeddables is effective . |
| Approach: | They propose a family of contextual embeddings that improves sequence labeling accuracy . they conduct extensive experiments on 3 tasks over 18 datasets and 8 languages . |
| Outcome: | The proposed family of contextual embeddings improves the accuracy of sequence labelers over non-contextual embedders. |
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. |
A supervised approach to taxonomy extraction using word embeddings (L18-1)
Copied to clipboard
| Challenge: | a recent evaluation of a method for organizing texts into a hierarchy showed that it did not outperform a baseline. |
| Approach: | They propose a method that uses supervised learning to combine multiple features with a support vector machine classifier including the baseline features. |
| Outcome: | The proposed method outperforms the baseline method and provides stronger method for identifying taxonomic relations than previous methods. |
Entity or Relation Embeddings? An Analysis of Encoding Strategies for Relation Extraction (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to relation extraction use concatenating embeddings of head and tail entities . however, such representations capture the types of the entities involved, leading to false positives and confusion between relations involving entities of the same type. |
| Approach: | They propose a model which combines [MASK] embeddings with entity embedds to learn relation embeddations. |
| Outcome: | The proposed model outperforms the state-of-the-art on several benchmarks . it uses a self-supervised pre-training strategy which further improves the results. |
Find Parent then Label Children: A Two-stage Taxonomy Completion Method with Pre-trained Language Model (2023.eacl-main)
Copied to clipboard
| Challenge: | Existing taxonomies focus on adding concepts to the leaf nodes of the existing tree, which does not fully utilize the taxonomy’s knowledge and is unable to update the original taxomy structure. |
| Approach: | They propose a two-stage method called ATTEMPT for taxonomy completion that inserts new concepts into the correct position by finding a parent node and labeling child nodes. |
| Outcome: | The proposed method performs best on taxonomy completion and extension tasks, surpassing existing methods. |
A Laypeople Study on Terminology Identification across Domains and Task Definitions (N18-2)
Copied to clipboard
| Challenge: | Existing studies on term annotation show that even experts differ in their understanding of termhood . |
| Approach: | They propose a new dataset of term annotation that examines the common understanding of what constitutes a term. |
| Outcome: | The proposed datasets show that even experts differ in their understanding of termhood . the findings suggest that there is a common understanding of what constitutes a term . |
Autoencoding Improves Pre-trained Word Embeddings (2020.coling-main)
Copied to clipboard
| Challenge: | Existing work has shown that word embeddings are distributed in a narrow cone and that centering and projection can improve the accuracy of pre-trained word embeds without requiring additional training data. |
| Approach: | They propose to remove the top principal components from pre-trained word embeddings and center and project them onto principal component vectors to reinstate isotropy in the embeddable space. |
| Outcome: | The proposed method is equivalent to applying a linear autoencoder to minimize the squared L2 reconstruction error. |