Mapping WordNets Using Structural Information

Simple item page
dc.creatorDaude, J.
dc.creatorPadro, L.
dc.creatorRigau, G.
dc.date2000-07-25
dc.date.accessioned2026-07-07T03:16:24Z
dc.date.available2026-07-07T03:16:24Z
dc.descriptionWe 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.
dc.description8 pages, uses epsfig. To appear in ACL'2000 proceedings
dc.identifierhttps://arxiv.org/abs/cs/0007035
dc.identifierhttp://arxiv.org/abs/cs/0007035
dc.identifier38th Anual Meeting of the Association for Computational Linguistics (ACL'2000). Hong Kong, October 2000.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30340
dc.subjectComputation and Language
dc.subjectI.2.7
dc.titleMapping WordNets Using Structural Information
dc.typetext

Files

Collections

arXiv