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

Large bilingual parallel texts (also known as bitexts) are usually stored ina compressed form, and previous work has shown that they can be moreefficiently compressed if the fact that the two texts are mutual translationsis exploited. For example, a bitext can be seen as a sequence of biwords---pairs of parallel words with a high probability of co-occurrence--- that canbe used as an intermediate representation in the compression process. However,the simple biword approach described in the literature can only exploitone-to-one word alignments and cannot tackle the reordering of words. Wetherefore introduce a generalization of biwords which can describe multi-wordexpressions and reorderings. We also describe some methods for the binarycompression of generalized biword sequences, and compare their performance whendifferent schemes are applied to the extraction of the biword sequence. Inaddition, we show that this generalization of biwords allows for theimplementation of an efficient algorithm to look on the compressed bitext forwords or text segments in one of the texts and retrieve their counterparttranslations in the other text ---an application usually referred to astranslation spotting--- with only some minor modifications in the compressionalgorithm.

Generalized Biwords for Bitext Compression and Translation Spotting