Affiliation:
1. Pontificia Universidad Católica de Valparaíso , Valparaíso Chile
2. Université de Lille , Lille France
3. DATA61 & Australian National University , Canberra Australia
Abstract
Abstract
In this paper we present the problem of a noisy lexical taxonomy and suggest two tasks as potential remedies. The first task is to identify and eliminate incorrect hypernymy links, and the second is to repopulate the taxonomy with new relations. The first task consists of revising the entire taxonomy and returning a Boolean for each assertion of hypernymy between two nouns (e.g. brie is a kind of cheese). The second task consists of recursively producing a chain of hypernyms for a given noun, until the most general node in the taxonomy is reached (e.g. brie → cheese → food → etc.). In order to achieve these goals, we implemented a hybrid hypernym-detection algorithm that incorporates various intuitions, such as syntagmatic, paradigmatic and morphological association measures as well as lexical patterns. We evaluate these algorithms individually and collectively and report findings in Spanish, English and French.
Subject
Artificial Intelligence,Information Systems,Software
Reference56 articles.
1. Jurij Apresjan, Regular Polysemy, Linguistics (1974), 5–32.
2. Marco Baroni and Alessandro Lenci, Distributional Memory: A General Framework for Corpus-based Semantics, Comput. Linguist. 36 (2010), 673–721.
3. David M Blei, Andrew Y Ng and Michael I Jordan, Latent dirichlet allocation, Journal of Machine Learning Research 3 (2003), 993–1022.
4. Georgeta Bordea, Els Lefever and Paul Buitelaar, SemEval-2016 Task 13: Taxonomy extraction evaluation (texeval-2), in: SemEval-2016, Association for Computational Linguistics, pp. 1081–1091, 2016.
5. Peter F. Brown, Peter V. deSouza, Robert L. Mercer, Vincent J. Della Pietra and Jenifer C. Lai, Class-Based n-gram Models of Natural Language, Computational Linguistics 18 (1992), 467–479.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献