Every child should have parents: a taxonomy refinement algorithm based on hyperbolic term embeddings
June 05, 2019 ยท The Cartographer ยท ๐ Annual Meeting of the Association for Computational Linguistics
"No code URL or promise found in abstract"
"Title-pattern auto-detect: Every child should have parents: a taxonomy refinement algorithm based on hyperbolic term embeddings"
Evidence collected by the PWNC Scanner
Authors
Rami Aly, Shantanu Acharya, Alexander Ossa, Arne Kรถhn, Chris Biemann, Alexander Panchenko
arXiv ID
1906.02002
Category
cs.CL: Computation & Language
Citations
54
Venue
Annual Meeting of the Association for Computational Linguistics
Last Checked
7 days ago
Abstract
We introduce the use of Poincarรฉ embeddings to improve existing state-of-the-art approaches to domain-specific taxonomy induction from text as a signal for both relocating wrong hyponym terms within a (pre-induced) taxonomy as well as for attaching disconnected terms in a taxonomy. This method substantially improves previous state-of-the-art results on the SemEval-2016 Task 13 on taxonomy extraction. We demonstrate the superiority of Poincarรฉ embeddings over distributional semantic representations, supporting the hypothesis that they can better capture hierarchical lexical-semantic relationships than embeddings in the Euclidean space.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Computation & Language
๐
๐
Old Age
๐
๐
Old Age
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
๐
๐
Old Age
XLNet: Generalized Autoregressive Pretraining for Language Understanding
๐ฎ
๐ฎ
The Ethereal
Effective Approaches to Attention-based Neural Machine Translation
๐
๐
Old Age
A large annotated corpus for learning natural language inference
๐
๐
Old Age