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 describe how, given a text $T [1..n]$ and a positive constant $\epsilon$,we can build a simple $O (z \log n)$-space index, where $z$ is the number ofphrases in the LZ77 parse of $T$, such that later, given a pattern $P [1..m]$,in $O (m \log \log z + \mathrm{polylog} (m + z))$ time and with highprobability we can find a substring of $P$ that occurs in $T$ and whose lengthis at least a $(1 - \epsilon)$-fraction of the length of a longest commonsubstring of $P$ and $T$.

A fast and simple $O (z \log n)$-space index for finding approximately longest common substrings