Category:String similarity measures
 | Computing portal |
Here is a list of articles in the category String similarity measures of the Computing portal that unifies foundations of mathematics and computations using computers.
Pages in category "String similarity measures"
The following 17 pages are in this category, out of 17 total.
- String metric (computing)
D
- Damerau–Levenshtein distance (computing)
E
- Edit distance (computing)
G
- Gestalt Pattern Matching (computing)
H
- Hamming distance (computing)
I
- Inversion (discrete mathematics) (computing)
J
- Jaccard index (computing)
- Jaro–Winkler distance (computing)
L
- Lee distance (computing)
- Levenshtein distance (computing)
M
- Most frequent k characters (computing)
O
- Overlap coefficient (computing)
S
- Simple matching coefficient (computing)
- Sørensen–Dice coefficient (computing)
- String kernel (computing)
T
- Tversky index (computing)
W
- Wagner–Fischer algorithm (computing)
Mathematics
Organizations
Books
About