# Taxonomy Induction using Hypernym Subsequences

arXiv: https://arxiv.org/abs/1704.07626 · HTML: https://mlsanity.com/paper/1704.07626/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 25 Apr 2017.

## Built on by (most cited first, 4 of 4)

- [TaxoEnrich: Self-Supervised Taxonomy Completion via Structure-Semantic Representations](https://mlsanity.com/paper/2202.04887/) (2022)
- [Enhancing Taxonomy Completion with Concept Generation via Fusing Relational Representations](https://mlsanity.com/paper/2106.02974/) (2021)
- [Enquire One's Parent and Child Before Decision: Fully Exploit Hierarchical Structure for Self-Supervised Taxonomy Expansion](https://mlsanity.com/paper/2101.11268/) (2021)
- [Learning Semantic Text Similarity to rank Hypernyms of Financial Terms](https://mlsanity.com/paper/2303.13475/) (2023)

## Abstract (arXiv)

We propose a novel, semi-supervised approach towards domain taxonomy induction from an input vocabulary of seed terms. Unlike all previous approaches, which typically extract direct hypernym edges for terms, our approach utilizes a novel probabilistic framework to extract hypernym subsequences. Taxonomy induction from extracted subsequences is cast as an instance of the minimumcost flow problem on a carefully designed directed graph. Through experiments, we demonstrate that our approach outperforms stateof- the-art taxonomy induction approaches across four languages. Importantly, we also show that our approach is robust to the presence of noise in the input vocabulary. To the best of our knowledge, no previous approaches have been empirically proven to manifest noise-robustness in the input vocabulary.