ML Anthology

The CQC Algorithm: Cycling in Graphs to Semantically Enrich and Enhance a Bilingual Dictionary: Extended Abstract

Tiziano Flati, Roberto Navigli
IJCAI 2013 pp. 3151-3155
/ijcai/2013/flati2013ijcai-cqc/

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.

PDF IJCAI Semantic Scholar

Cite

Text

Flati and Navigli. "The CQC Algorithm: Cycling in Graphs to Semantically Enrich and Enhance a Bilingual Dictionary: Extended Abstract." International Joint Conference on Artificial Intelligence, 2013.

Markdown

[Flati and Navigli. "The CQC Algorithm: Cycling in Graphs to Semantically Enrich and Enhance a Bilingual Dictionary: Extended Abstract." International Joint Conference on Artificial Intelligence, 2013.](https://mlanthology.org/ijcai/2013/flati2013ijcai-cqc/)

BibTeX

@inproceedings{flati2013ijcai-cqc,
  title     = {{The CQC Algorithm: Cycling in Graphs to Semantically Enrich and Enhance a Bilingual Dictionary: Extended Abstract}},
  author    = {Flati, Tiziano and Navigli, Roberto},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2013},
  pages     = {3151-3155},
  url       = {https://mlanthology.org/ijcai/2013/flati2013ijcai-cqc/}
}