Wobsah

# 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 tutomu přikazej …

#### Ze symbolowych lajstow:

Klikńće na symbolowej lajsće Tabelowe daty na symbol Datowu sadźbu pytać, potom na kontrolny kašćik Podobnostne pytanje a klikńće potom na tłóčatko Podobnosće (tabelowy napohlad datoweje banki).

Klikńće w symbolowej lajsće Formularowa nawigacija na symbol Datowu sadźbu pytać…, potom na kontrolny kašćik Pytanje podobnosćow a potom na tłóčatko Podobnosće (napohlad tabele datoweje banki).

#### Z tastatury:

Tłóčće w tabelowym napohledźe datoweje banki cmd ⌘Strg+F, wubjerće kontrolny kašćik Podobnostne pytanje a klikńće potom na tłóčatko Podobnosće.

#### Z menijoweje lajsty:

Wubjerće Wobdźěłać – Pytać a wuměnić… – kontrolny kašćik: pytanje podobnosćow a klikńće na tłóčatko Podobnosće…

#### Z tastatury:

Tłóčće cmd ⌘Strg+H, wubjerće kontrolny kašćik Podobnosć a klikńće potom na tłóčatko Podobnosće.

#### Z bóčnicy:

Wočińće w bóčnicy wobwod Pytać, klikńće potom na Pytanske nastajenja, wubjerće kontrolny kašćik Podobnosć a klikńće na tłóčatko Podobnosće….

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

Podobne temy

Levenshtein Distance algorithm in Wikipedia

Prošu podpěrajće nas!