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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Although several self-indexes for highly repetitive text collections exist,developing an index and search algorithm with editing operations remains achallenge. Edit distance with moves (EDM) is a string-to-string distancemeasure that includes substring moves in addition to ordinal editing operationsto turn one string into another. Although the problem of computing EDM isintractable, it has a wide range of potential applications, especially inapproximate string retrieval. Despite the importance of computing EDM, therehas been no efficient method for indexing and searching large text collectionsbased on the EDM measure. We propose the first algorithm, named string indexfor edit distance with moves (siEDM), for indexing and searching strings withEDM. The siEDM algorithm builds an index structure by leveraging the ideabehind the edit sensitive parsing (ESP), an efficient algorithm enablingapproximately computing EDM with guarantees of upper and lower bounds for theexact EDM. siEDM efficiently prunes the space for searching query strings bythe proposed method, which enables fast query searches with the same guaranteeas ESP. We experimentally tested the ability of siEDM to index and searchstrings on benchmark datasets, and we showed siEDM's efficiency.

siEDM: an efficient string index and search algorithm for edit distance with moves