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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We present a new efficient method for approximate search in electroniclexica. Given an input string (the pattern) and a similarity threshold, thealgorithm retrieves all entries of the lexicon that are sufficiently similar tothe pattern. Search is organized in subsearches that always start with an exactpartial match where a substring of the input pattern is aligned with asubstring of a lexicon word. Afterwards this partial match is extended stepwiseto larger substrings. For aligning further parts of the pattern withcorresponding parts of lexicon entries, more errors are tolerated at eachsubsequent step. For supporting this alignment order, which may start at anypart of the pattern, the lexicon is represented as a structure that enablesimmediate access to any substring of a lexicon word and permits the extensionof such substrings in both directions. Experimental evaluations of theapproximate search procedure are given that show significant efficiencyimprovements compared to existing techniques. Since the technique can be usedfor large error bounds it offers interesting possibilities for approximatesearch in special collections of "long" strings, such as phrases, sentences, orbook ti

Good parts first - a new algorithm for approximate search in lexica and string databases