The CQC Algorithm: Cycling in Graphs to Semantically Enrich and Enhance a Bilingual Dictionary: Extended abstract
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 3151-3154.
Abstract
Bilingual machine-readable dictionaries are knowledge resources useful in many automatic tasks.However, compared to monolingual computational lexicons like WordNet, bilingual dictionaries typically provide a lower amount of structured information such as lexical and semantic relations, and often do not cover the entire range of possible translations for a word of interest. In this paper we present Cycles and Quasi-Cycles (CQC), a novel algorithm for the automated disambiguation of ambiguous translations in the lexical entries of a bilingual machine-readable dictionary.
@inproceedings{ijcai2013p476,
title = {The CQC Algorithm: Cycling in Graphs to Semantically Enrich and Enhance a Bilingual Dictionary: Extended abstract},
author = {Flati, Tiziano and Navigli, Roberto},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {3151--3154},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/476},
}
TY - CPAPER TI - The CQC Algorithm: Cycling in Graphs to Semantically Enrich and Enhance a Bilingual Dictionary: Extended abstract AU - Flati, Tiziano AU - Navigli, Roberto T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 3151 EP - 3154 UR - https://ijcai.org/proceedings/2013/476 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
