- Applied mathematics
- >
- Algorithms
- >
- Algorithms on strings
- >
- String metrics

- Applied mathematics
- >
- Theoretical computer science
- >
- Information theory
- >
- String metrics

- Combinatorics on words
- >
- Formal languages
- >
- Algorithms on strings
- >
- String metrics

- Data types
- >
- String (computer science)
- >
- Algorithms on strings
- >
- String metrics

- Fields of geometry
- >
- Metric geometry
- >
- Similarity measures
- >
- String metrics

- Formalism (deductive)
- >
- Formal languages
- >
- Algorithms on strings
- >
- String metrics

- Mathematical analysis
- >
- Sequences and series
- >
- String (computer science)
- >
- String metrics

- Mathematical logic
- >
- Algorithms
- >
- Algorithms on strings
- >
- String metrics

- Mathematical logic
- >
- Formal languages
- >
- Algorithms on strings
- >
- String metrics

- Mathematical structures
- >
- Sequences and series
- >
- String (computer science)
- >
- String metrics

- Metalogic
- >
- Formal languages
- >
- Algorithms on strings
- >
- String metrics

- Metric geometry
- >
- Distance
- >
- Similarity measures
- >
- String metrics

- Sequences and series
- >
- String (computer science)
- >
- Algorithms on strings
- >
- String metrics

- Statistical theory
- >
- Information theory
- >
- Similarity measures
- >
- String metrics

- Statistics
- >
- Statistical theory
- >
- Information theory
- >
- String metrics

- Subtraction
- >
- Distance
- >
- Similarity measures
- >
- String metrics

- Theoretical computer science
- >
- Algorithms
- >
- Algorithms on strings
- >
- String metrics

- Theoretical computer science
- >
- Formal languages
- >
- Algorithms on strings
- >
- String metrics

- Theoretical computer science
- >
- Information theory
- >
- Similarity measures
- >
- String metrics

- Type systems
- >
- Data types
- >
- String (computer science)
- >
- String metrics

String metric

In mathematics and computer science, a string metric (also known as a string similarity metric or string distance function) is a metric that measures distance ("inverse similarity") between two text s

Gestalt pattern matching

Gestalt pattern matching, also Ratcliff/Obershelp pattern recognition, is a string-matching algorithm for determining the similarity of two strings. It was developed in 1983 by John W. Ratcliff and an

Damerau–Levenshtein distance

In information theory and computer science, the Damerau–Levenshtein distance (named after Frederick J. Damerau and Vladimir I. Levenshtein) is a string metric for measuring the edit distance between t

Hamming distance

In information theory, the Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different. In other words, it measures the minimum num

Overlap coefficient

The overlap coefficient, or Szymkiewicz–Simpson coefficient, is a similarity measure that measures the overlap between two finite sets. It is related to the Jaccard index and is defined as the size of

Wagner–Fischer algorithm

In computer science, the Wagner–Fischer algorithm is a dynamic programming algorithm that computes the edit distance between two strings of characters.

String kernel

In machine learning and data mining, a string kernel is a kernel function that operates on strings, i.e. finite sequences of symbols that need not be of the same length. String kernels can be intuitiv

Sørensen–Dice coefficient

The Sørensen–Dice coefficient (see below for other names) is a statistic used to gauge the similarity of two samples. It was independently developed by the botanists Thorvald Sørensen and Lee Raymond

Lee distance

In coding theory, the Lee distance is a distance between two strings and of equal length n over the q-ary alphabet {0, 1, …, q − 1} of size q ≥ 2. It is a metric defined as If q = 2 or q = 3 the Lee d

Tversky index

The Tversky index, named after Amos Tversky, is an asymmetric similarity measure on sets that compares a variant to a prototype. The Tversky index can be seen as a generalization of the Sørensen–Dice

Edit distance

In computational linguistics and computer science, edit distance is a string metric, i.e. a way of quantifying how dissimilar two strings (e.g., words) are to one another, that is measured by counting

Jaro–Winkler distance

In computer science and statistics, the Jaro–Winkler distance is a string metric measuring an edit distance between two sequences. It is a variant proposed in 1990 by of the Jaro distance metric (1989

Levenshtein distance

In information theory, linguistics, and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between t

Inversion (discrete mathematics)

In computer science and discrete mathematics, an inversion in a sequence is a pair of elements that are out of their natural order.

Jaccard index

The Jaccard index, also known as the Jaccard similarity coefficient, is a statistic used for gauging the similarity and diversity of sample sets. It was developed by Grove Karl Gilbert in 1884 as his

Simple matching coefficient

The simple matching coefficient (SMC) or Rand similarity coefficient is a statistic used for comparing the similarity and diversity of sample sets. Given two objects, A and B, each with n binary attri

© 2023 Useful Links.