Wopśimjeśe

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

Pśistup k toś tomu pśikazoju …

#### Ze symbolowych rědkow:

Klikniśo na symbolowej rědce Tabelowe daty na symbol Datowu sajźbu pytaś, pón na kontrolny kašćik Pytanje pódobnosći a klikniśo pón na tłocašk Pódobnosći (tabelowy naglěd datoweje banki).

Klikniśo w symbolowej rědce Formularowa nawigacija na symbol Datowu sajźbu pytaś…, pón na kontrolny kašćik Pytanje pódobnosćow a pón na tłocašk Pódobnosći (naglěd tabele datoweje banki).

#### Z tastatury:

Tłocćo w tabelowem naglěźe datoweje banki cmd ⌘Strg+F, wubjeŕśo kontrolny kašćik Pytanje pódobnosćow a klikniśo pón na tłocašk Pódobnosći.

#### Z menijoweje rědki:

Wubjeŕśo Wobźěłaś – Pytaś a wuměniś… – kontrolny kašćik: pytanje pódobnosćow a klikniśo na tłocašk Pódobnosći…

#### Z tastatury:

Tłocćo cmd ⌘Strg+H, wubjeŕśo kontrolny kašćik Pódobnosć a klikniśo pón na tłocašk Pódobnosći.

#### Z bocnice:

Wócyńśo w bocnicy wobceŕk Pytaś, klikniśo pón na Pytańske nastajenja, wubjeŕśo kontrolny kašćik Pódobnosć a klikniśo na tłocašk Pódobnosći….

## 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, 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. 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".

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

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

Pódobne temy

Levenshtein Distance algorithm in Wikipedia

Pšosym pódprějśo nas!