Topological Data Analysis for Word Sense Disambiguation
read the original abstract
We develop and test a novel unsupervised algorithm for word sense induction and disambiguation which uses topological data analysis. Typical approaches to the problem involve clustering, based on simple low level features of distance in word embeddings. Our approach relies on advanced mathematical concepts in the field of topology which provides a richer conceptualization of clusters for the word sense induction tasks. We use a persistent homology barcode algorithm on the SemCor dataset and demonstrate that our approach gives low relative error on word sense induction. This shows the promise of topological algorithms for natural language processing and we advocate for future work in this promising area.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Topological Data Analysis Applications in Natural Language Processing: A Survey
This survey compiles 137 papers on Topological Data Analysis in NLP, categorizing them into theoretical explanations of language and practical integrations into ML systems while noting open challenges.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.