Similarity Search

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.

แƒ‘แƒ แƒซแƒแƒœแƒ”แƒ‘แƒแƒ–แƒ” แƒฌแƒ•แƒ“แƒแƒ›แƒ˜แƒกแƒแƒ—แƒ•แƒ˜แƒก...


แƒ›แƒกแƒ’แƒแƒ•แƒกแƒ”แƒ‘แƒ”แƒ‘แƒ˜

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, when exchanging "sw" and "cr".

แƒœแƒ”แƒ‘แƒ˜แƒกแƒ›แƒ˜แƒ”แƒ แƒ˜ แƒกแƒ˜แƒ›แƒ‘แƒแƒšแƒ

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.For example, if you specify 3 removed characters, "longitude" and "longest" are considered similar, but not "long".

แƒ™แƒแƒ›แƒ‘แƒ˜แƒœแƒ˜แƒ แƒ”แƒ‘แƒ

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).


แƒ’แƒแƒ•แƒ แƒ—แƒฎแƒ˜แƒšแƒ”แƒ‘แƒ˜แƒก แƒฎแƒแƒขแƒฃแƒšแƒ

Be careful when using Replace All with Similarity Search. Best to be certain first about what will be found.


Please support us!

Please support us!