source/text/shared/01/02100100.xhp |   19 ++++++++++---------
 1 file changed, 10 insertions(+), 9 deletions(-)

New commits:
commit 9d2a16b7eb33cf0ff58e010d502d64c6dfcdff4f
Author:     Olivier Hallot <olivier.hal...@libreoffice.org>
AuthorDate: Tue Aug 13 18:22:53 2024 -0300
Commit:     Olivier Hallot <olivier.hal...@libreoffice.org>
CommitDate: Wed Aug 14 15:58:36 2024 +0200

    tdf#129492 Similarity search examples
    
    + Added example for add/remove characters for similarity
    + Suppressed hidden <ahelp> (already moved to dialog)
    + Link to wikipedia
    + reorder paragraphs
    
    Change-Id: Idb041e31a2041a4603766a75da22459fa74d75b8
    Reviewed-on: https://gerrit.libreoffice.org/c/help/+/171841
    Tested-by: Jenkins
    Reviewed-by: Olivier Hallot <olivier.hal...@libreoffice.org>

diff --git a/source/text/shared/01/02100100.xhp 
b/source/text/shared/01/02100100.xhp
index e0b0cb644d..d2fc8fe380 100644
--- a/source/text/shared/01/02100100.xhp
+++ b/source/text/shared/01/02100100.xhp
@@ -39,30 +39,31 @@
     <paragraph role="paragraph" id="par_id3146856"><ahelp 
hid="svx/ui/findreplacedialog/similarity">Find terms that are similar to the 
<emph>Find</emph> text. Select this checkbox, and then click the 
<emph>Similarities</emph> button to define the similarity 
options.</ahelp></paragraph>
     </section>
 </section>
+<paragraph role="paragraph" id="par_id3149551">For example, a similarity 
search can find words that differ from the <emph>Find</emph> text by two 
characters.</paragraph>
 <section id="howtoget">
 <embed href="text/shared/00/edit_menu.xhp#similarity_search_access"/>
 </section>
-<paragraph role="paragraph" id="par_id3149551">For example, a similarity 
search can find words that differ from the <emph>Find</emph> text by two 
characters.</paragraph>
 <bookmark branch="hid/svx/ui/findreplacedialog/similaritybtn" 
id="bm_id3155351" localize="false"/>
-<paragraph role="paragraph" id="par_id3145629"><ahelp 
hid="svx/ui/findreplacedialog/similaritybtn" visibility="hidden">Set the 
options for the similarity search.</ahelp></paragraph>
-<h2 id="hd_id3149511">Settings</h2>
+<h2 id="hd_id3149511">Similarities</h2>
 <paragraph role="paragraph" id="par_id3152594">Define the criteria for 
determining if a word is similar to the search term.</paragraph>
 <bookmark branch="hid/cui/ui/similaritysearchdialog/otherfld" 
id="bm_id3155338" localize="false"/>
 <h3 id="hd_id3153551">Exchange characters</h3>
-<paragraph role="paragraph" id="par_id3152551"><ahelp 
hid="cui/ui/similaritysearchdialog/otherfld">Enter the number of characters in 
the search term that can be exchanged.</ahelp> For example, if you specify 2 
exchanged characters, "sweep" and "creep" are considered similar.</paragraph>
+<paragraph role="paragraph" id="par_id3152551"><ahelp 
hid="cui/ui/similaritysearchdialog/otherfld">Enter the number of characters in 
the search term that can be exchanged.</ahelp> For example, if you specify 2 
exchanged characters, "sweep" and "creep" are considered similar, when 
exchanging "sw" and "cr".</paragraph>
 <bookmark branch="hid/cui/ui/similaritysearchdialog/longerfld" 
id="bm_id3150443" localize="false"/>
 <h3 id="hd_id3147010">Add characters</h3>
-<paragraph role="paragraph" id="par_id3109847"><ahelp 
hid="cui/ui/similaritysearchdialog/longerfld">Enter the maximum number of 
characters by which a word can exceed the number of characters in the search 
term.</ahelp></paragraph>
+<paragraph role="paragraph" id="par_id3109847"><ahelp 
hid="cui/ui/similaritysearchdialog/longerfld">Enter the maximum number of 
characters by which a word can exceed the number of characters in the search 
term.</ahelp> For example, if you specify 3 additional characters, "long" and 
"longest" are considered similar, but not "longitude".</paragraph>
 <bookmark branch="hid/cui/ui/similaritysearchdialog/shorterfld" 
id="bm_id3158430" localize="false"/>
 <h3 id="hd_id3166460">Remove characters</h3>
-<paragraph role="paragraph" id="par_id3148685"><ahelp 
hid="cui/ui/similaritysearchdialog/shorterfld">Enter the number of characters 
by which a word can be shorter than the search term.</ahelp></paragraph>
+<paragraph role="paragraph" id="par_id3148685"><ahelp 
hid="cui/ui/similaritysearchdialog/shorterfld">Enter the number of characters 
by which a word can be shorter than the search term.</ahelp>For example, if you 
specify 3 removed characters, "longitude" and "longest" are considered similar, 
but not "long".</paragraph>
 <bookmark branch="hid/cui/ui/similaritysearchdialog/relaxbox" 
id="bm_id3159400" localize="false"/>
 <h3 id="hd_id3153700">Combine</h3>
 <paragraph role="paragraph" id="par_id3156553"><ahelp 
hid="cui/ui/similaritysearchdialog/relaxbox">Searches for a term that matches 
any combination of the similarity search settings.</ahelp></paragraph>
-<tip id="par_id491602292458634">Using Combine better meets a user's 
expectations from looking at the settings, but may return false positives. Not 
using Combine may match less than expected, but does not return false 
positives.</tip>
-<note id="par_id401602236795437">A Weighted Levenshtein Distance (WLD) 
algorithm is used. If Combine is not checked, then settings are treated as an 
exclusive-OR (strict WLD).
-If Combine is checked, then settings are treated as an inclusive-OR (relaxed 
WLD).
+<tip id="par_id491602292458634">Using <emph>Combine</emph> better meets a 
user's expectations from looking at the settings, but may return false 
positives. Not using <emph>Combine</emph> may match less than expected, but 
does not return false positives.</tip>
+<note id="par_id401602236795437">A Weighted Levenshtein Distance (WLD) 
algorithm is used. If <emph>Combine</emph> is not checked, then settings are 
treated as an exclusive-OR (strict WLD). If <emph>Combine</emph> is checked, 
then settings are treated as an inclusive-OR (relaxed WLD).
 </note>
 <warning id="par_id371602294412458">Be careful when using <emph>Replace 
All</emph> with Similarity Search. Best to be certain first about what will be 
found.</warning>
+<section id="relatedtopics">
+    <paragraph role="paragraph" id="par_id561723580819885"><link 
href="https://en.wikipedia.org/wiki/Levenshtein_distance";>Levenshtein Distance 
algorithm in Wikipedia</link></paragraph>
+</section>
 </body>
 </helpdocument>

Reply via email to