https://bugs.documentfoundation.org/show_bug.cgi?id=129492
--- Comment #1 from Eike Rathke <er...@redhat.com> ---
Maybe this can shed some light:
The algorithm used is a Weighted Levenshtein Distance (including wildcards ?
and *).
The mathematical definition of the real WLD means EITHER maximum X replacements
OR Y characters shorter OR Z characters longer, where a mix of operations is
allowed but each operation draws from a shared 100% pool of operations.
The relaxed (UI Combined, internal SplitCount) mode allows maximum X
replacements AND/OR Y character shorter AND/OR Z characters longer. Only
insertions and deletions share one pool from which they draw, replacements use
a second independent pool. This is more what a user expects if not familiar
with WLD.
More details and an example can be found in the comments at
https://opengrok.libreoffice.org/xref/core/i18npool/source/search/levdis.hxx?r=ee8f0a10#26
--
You are receiving this mail because:
You are the assignee for the bug.
_______________________________________________
Libreoffice-bugs mailing list
Libreoffice-bugs@lists.freedesktop.org
https://lists.freedesktop.org/mailman/listinfo/libreoffice-bugs
