https://bugs.documentfoundation.org/show_bug.cgi?id=129492
--- Comment #6 from sdc.bla...@youmail.dk ---
(In reply to Heiko Tietze from comment #0)
> The workflow and use case of the similarity search is difficult to
> understand. In particular, Combine reads as if the parameters are put
>
https://bugs.documentfoundation.org/show_bug.cgi?id=129492
--- Comment #5 from Commit Notification
---
Seth Chaiklin committed a patch related to this issue.
It has been pushed to "master":
https://git.libreoffice.org/help/commit/bbb9b402a4197f412a411efeef434b168d0ce96d
Partially resolves:
https://bugs.documentfoundation.org/show_bug.cgi?id=129492
Commit Notification changed:
What|Removed |Added
Whiteboard||target:7.1.0
--
You are
https://bugs.documentfoundation.org/show_bug.cgi?id=129492
--- Comment #4 from sdc.bla...@youmail.dk ---
(In reply to sdc.blanco from comment #3)
> Is similarity search supposed to be able to find two words (i.e, two letter
> strings with a space between them)?
See bug 126294 for similar
https://bugs.documentfoundation.org/show_bug.cgi?id=129492
--- Comment #3 from sdc.bla...@youmail.dk ---
Created attachment 166244
--> https://bugs.documentfoundation.org/attachment.cgi?id=166244=edit
Document with instructinos for testing similarity search
Is similarity search supposed to be
https://bugs.documentfoundation.org/show_bug.cgi?id=129492
sdc.bla...@youmail.dk changed:
What|Removed |Added
CC||er...@redhat.com,
https://bugs.documentfoundation.org/show_bug.cgi?id=129492
--- Comment #1 from Eike Rathke ---
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
https://bugs.documentfoundation.org/show_bug.cgi?id=129492
Olivier Hallot changed:
What|Removed |Added
Ever confirmed|0 |1
