Most work on sense disambiguation presumes that one knows beforehand --- e.g. from a thesaurus --- a set of polysemous terms. But published lists invariably give only partial coverage. For example, the English word tan has several obvious senses, but one may overlook the abbreviation for tangent. In this paper, we present an algorithm for identifying interesting polysemous terms and measuring their degree of polysemy, given an unlabeled corpus. The algorithm involves: (i) collecting all terms within a k-term window of the target term; (ii) computing the inter-term distances of the contextual terms, and reducing the multi-dimensional distance space to two dimensions using standard methods; (iii) converting the two-dimensional representation into radial coordinates and using isotonic/antitonic regression to compute the degree to which the distribution deviates from a single-peak model. The amount of deviation is the proposed polysemy index.
Cite as: Sproat, R., Santen, J.P.H.v. (1998) Automatic ambiguity detection. Proc. 5th International Conference on Spoken Language Processing (ICSLP 1998), paper 0041, doi: 10.21437/ICSLP.1998-481
@inproceedings{sproat98b_icslp,
author={Richard Sproat and Jan P. H. van Santen},
title={{Automatic ambiguity detection}},
year=1998,
booktitle={Proc. 5th International Conference on Spoken Language Processing (ICSLP 1998)},
pages={paper 0041},
doi={10.21437/ICSLP.1998-481}
}