2000/07/25 by J. Daude, L. Padro, G. Rigau
Computer Science · #cs.CL
published as 38th Anual Meeting of the Association for Computational Linguistics (ACL'2000). Hong Kong, October 2000. · 8 pages, uses epsfig. To appear in ACL'2000 proceedings
arxiv created 2000/07/25 · arxiv updated 2009/11/30
We present a robust approach for linking already existing lexical/semantic hierarchies. We used a constraint satisfaction algorithm (relaxation labeling) to select --among a set of candidates-- the node in a target taxonomy that bests matches each node in a source taxonomy. In particular, we use it to map the nominal part of WordNet 1.5 onto WordNet 1.6, with a very high precision and a very low remaining ambiguity.