Mapping WordNets Using Structural Information
计算与语言
2007-05-23 v1
摘要
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.
引用
@article{arxiv.cs/0007035,
title = {Mapping WordNets Using Structural Information},
author = {J. Daude and L. Padro and G. Rigau},
journal= {arXiv preprint arXiv:cs/0007035},
year = {2007}
}
备注
8 pages, uses epsfig. To appear in ACL'2000 proceedings