Mapping WordNets Using Structural Information
J. Daude, L. Padro & G. Rigau

TL;DR
This paper introduces a robust method using relaxation labeling to accurately map lexical hierarchies, specifically aligning WordNet 1.5 with WordNet 1.6, achieving high precision and low ambiguity.
Contribution
It presents a novel application of constraint satisfaction algorithms for mapping lexical hierarchies, improving accuracy in linking WordNet versions.
Findings
High precision in mapping WordNet versions
Low ambiguity in node matching
Effective use of relaxation labeling algorithm
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · Topic Modeling · Text and Document Classification Technologies
