https://bugs.documentfoundation.org/show_bug.cgi?id=150693
stragu <[email protected]> changed: What |Removed |Added ---------------------------------------------------------------------------- See Also| |https://bugs.documentfounda | |tion.org/show_bug.cgi?id=12 | |9492 CC| |[email protected] | |.org Version|7.2.7.2 release |6.3.6.2 release Status|UNCONFIRMED |NEW Ever confirmed|0 |1 --- Comment #8 from stragu <[email protected]> --- The labels were the same in: Version: 6.3.6.2 Build ID: 2196df99b074d8a661f4036fca8fa0cbfa33a497 CPU threads: 8; OS: Linux 5.15; UI render: default; VCL: gtk3; Locale: en-AU (en_AU.UTF-8); UI-Language: en-US Calc: threaded I would be happy with: - Exchange at most [] characters - Add at most [] characters - Remove at most [] characters (In reply to Eike Rathke from comment #5) > For choosing the wording it may be important to know roughly about the > Weighted Levenshtein Distance (WLD) algorithm. It looks for a possible > transformation of the search term to a text string by measuring an "edit > distance". That transformation can be accomplished by different operations, > for example "ab" can be transformed to "ac" by either replacing/substituting > 'b' with 'c' (distance of 1), or by removing/deleting 'b' and then > adding/inserting 'c' (distance of 2). > See also https://en.wikipedia.org/wiki/Levenshtein_distance In that sense, the documentation could be improved: https://help.libreoffice.org/7.5/en-US/text/shared/01/02100100.html?System=UNIX&DbPAR=WRITER&HID=cui/ui/similaritysearchdialog/grid1#bm_id3154815 Using wording like "how many times a character can be added when computing the edit distance between the search string and the matched string". Related to this, there's bug 129492 -- You are receiving this mail because: You are the assignee for the bug.
