Mapping WordNets Using Structural Information
<|reference_start|>Mapping WordNets Using Structural Information: 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.<|reference_end|>
@article{daude2000mapping,
    title={Mapping WordNets Using Structural Information},
    author={J. Daude, L. Padro & G. Rigau},
    journal={38th Anual Meeting of the Association for Computational
  Linguistics (ACL'2000). Hong Kong, October 2000.},
    year={2000},
    archivePrefix={arXiv},
    eprint={cs/0007035},
    primaryClass={cs.CL}
}