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 @@ Find terms that are similar to the Find text. Select this checkbox, and then click the Similarities button to define the similarity options. +For example, a similarity search can find words that differ from the Find text by two characters.
-For example, a similarity search can find words that differ from the Find text by two characters. -Set the options for the similarity search. -

Settings

+

Similarities

Define the criteria for determining if a word is similar to the search term.

Exchange characters

-Enter the number of characters in the search term that can be exchanged. For example, if you specify 2 exchanged characters, "sweep" and "creep" are considered similar. +Enter the number of characters in the search term that can be exchanged. For example, if you specify 2 exchanged characters, "sweep" and "creep" are considered similar, when exchanging "sw" and "cr".

Add characters

-Enter the maximum number of characters by which a word can exceed the number of characters in the search term. +Enter the maximum number of characters by which a word can exceed the number of characters in the search term. For example, if you specify 3 additional characters, "long" and "longest" are considered similar, but not "longitude".

Remove characters

-Enter the number of characters by which a word can be shorter than the search term. +Enter the number of characters by which a word can be shorter than the search term.For example, if you specify 3 removed characters, "longitude" and "longest" are considered similar, but not "long".

Combine

Searches for a term that matches any combination of the similarity search settings. -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. -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). +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. +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). Be careful when using Replace All with Similarity Search. Best to be certain first about what will be found. +
+ Levenshtein Distance algorithm in Wikipedia +