目录

# Similarity Search

查找与「查找文本类似的条目。选中此复选框，然后点击 ...」按钮以定义类似选项。

例如，类似查找可以查找与「查找」文本相差两个字符的词语。

要访问此命令...

#### From toolbars:

On the Table Data bar, click Find Record icon, then Similarity search check box, then click the Similarities button (database table view).

On the Form Navigation bar, click Record Search icon, then Similarity search check box, then click the Similarities button (database form view).

#### From the keyboard:

On the database table view, press Command Ctrl+F, select Similarity search check box, then click the Similarities button.

#### From the menu bar:

Choose Edit - Find & Replace - Similarity search check box, then click the Similarities button.

#### From the keyboard:

Press Command Ctrl+H, select Similarity check box, then click the Similarities button.

#### From the sidebar:

Open the Find deck, click on Search Options, select Similarity check box and click Similarities button.

## Similarities

定义用于确定文档中的字词是否与查找项类似的条件。

### 交换字符

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

### 删除字符

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

### 合并

查找与类似查找设置的任意组合相匹配的项。

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