English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Bilingual machine-readable dictionaries are knowledge resources useful inmany automatic tasks. However, compared to monolingual computational lexiconslike WordNet, bilingual dictionaries typically provide a lower amount ofstructured information, such as lexical and semantic relations, and often donot cover the entire range of possible translations for a word of interest. Inthis paper we present Cycles and Quasi-Cycles (CQC), a novel algorithm for theautomated disambiguation of ambiguous translations in the lexical entries of abilingual machine-readable dictionary. The dictionary is represented as agraph, and cyclic patterns are sought in the graph to assign an appropriatesense tag to each translation in a lexical entry. Further, we use thealgorithms output to improve the quality of the dictionary itself, bysuggesting accurate solutions to structural problems such as misalignments,partial alignments and missing entries. Finally, we successfully apply CQC tothe task of synonym extraction.

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