TEMP: Taxonomy Expansion with Dynamic Margin Loss through Taxonomy-Paths (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing taxonomies are unable to maintain coverage due to the rising of new concepts . TEMP uses pre-trained contextual encoders to predict the position of new ideas . |
| Approach: | They propose a self-supervised taxonomy expansion method that ranks taxonomies by ranking them . they use pre-trained contextual encoders to train the model with dynamic margin loss . |
| Outcome: | The proposed method outperforms state-of-the-art taxonomy expansion methods by 14.3% and 15.8% on public benchmarks. |
Similar Papers
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. |
TEF: Causality-Aware Taxonomy Expansion via Front-Door Criterion (2025.coling-main)
Copied to clipboard
| Challenge: | Existing research still faces spurious query-anchor matching due to unobserved factors. |
| Approach: | They propose a model that uses the front-door criteria to decompose the expansion process into a parser module and a connector to isolate confounding effects. |
| Outcome: | Extensive experiments on three benchmarks validate the effectiveness of the proposed model. |
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. |
Leveraging WordNet Paths for Neural Hypernym Prediction (2020.coling-main)
Copied to clipboard
| Challenge: | Existing work on lexical relations based on distributed representations has differed widely. |
| Approach: | They propose a model that generates taxonomy paths for hypernym prediction using WordNet sequences. |
| Outcome: | The hypo2path model outperforms the best model by 4.11 points in hit-at-one (H@1) The proposed model outpersforms previous models by a factor of 0.9. |
Rank, Chunk and Expand: Lineage-Oriented Reasoning for Taxonomy Expansion (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing taxonomy expansion methods struggle with representation limits and generalization, while generative methods process all candidates at once, introducing noise and exceeding context limits. |
| Approach: | They propose a plug-and-play framework that combines discriminative ranking and generative reasoning for efficient taxonomy expansion. |
| Outcome: | Experiments show that LORex improves accuracy by 12% and similarity by 5% over state-of-the-art methods. |
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. |
TaxoAdapt: Aligning LLM-Based Multidimensional Taxonomy Construction to Evolving Research Corpora (2025.acl-long)
Copied to clipboard
| Challenge: | Recent automated taxonomies over-rely on a specific corpus, sacrificing generalizability, or depend heavily on the general knowledge of large language models (LLMs) . |
| Approach: | They propose a framework that dynamically adapts an LLM-generated taxonomy to a given corpus across multiple dimensions. |
| Outcome: | The proposed framework performs iterative hierarchical classification, expanding both the taxonomy width and depth based on corpus’ topical distribution. |
Topic Taxonomy Expansion via Hierarchy-Aware Topic Phrase Generation (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for topic taxonomies focus on frequent terms and local topic-subtopic relations, which leads to limited topic term coverage. |
| Approach: | They propose a framework for topic taxonomy expansion that directly generates topic-related terms belonging to new topics. |
| Outcome: | The proposed framework outperforms baseline methods on two real-world text corpora. |
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. |
A Unified Taxonomy-Guided Instruction Tuning Framework for Entity Set Expansion and Taxonomy Expansion (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing studies view entity set expansion, taxonomy expansion, and seed-guided taxonomies as three separate tasks. |
| Approach: | They propose a taxonomy-guided instruction tuning framework to teach a large language model to generate siblings and parents for query entities. |
| Outcome: | The proposed framework outperforms baselines on multiple benchmark datasets. |