Levenshtein distance
E1381494
UNEXPLORED
Levenshtein distance is a string metric that measures the minimum number of single-character insertions, deletions, and substitutions required to transform one string into another.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Levenshtein distance canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T19531776 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Levenshtein distance Context triple: [Hamming distance, relatedTo, Levenshtein distance]
-
A.
Levenstein
Levenstein is a surname, often a variant of Löwenstein, borne by individuals of German or Ashkenazi Jewish origin.
-
B.
Hamming distance
Hamming distance is a measure in information theory and computer science that counts the number of positions at which corresponding symbols in two equal-length strings differ, widely used in error detection and coding theory.
-
C.
Difference Engine
The Difference Engine is an early mechanical calculator designed by Charles Babbage to automatically compute and tabulate polynomial functions, often regarded as a precursor to modern computers.
-
D.
Bhattacharyya distance
Bhattacharyya distance is a statistical measure of similarity between two probability distributions, often used in pattern recognition and classification to quantify their overlap.
-
E.
Bhattacharyya coefficient
The Bhattacharyya coefficient is a statistical measure of similarity between two probability distributions, often used to quantify their overlap in fields like pattern recognition and signal processing.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Levenshtein distance Target entity description: Levenshtein distance is a string metric that measures the minimum number of single-character insertions, deletions, and substitutions required to transform one string into another.
-
A.
Levenstein
Levenstein is a surname, often a variant of Löwenstein, borne by individuals of German or Ashkenazi Jewish origin.
-
B.
Hamming distance
Hamming distance is a measure in information theory and computer science that counts the number of positions at which corresponding symbols in two equal-length strings differ, widely used in error detection and coding theory.
-
C.
Difference Engine
The Difference Engine is an early mechanical calculator designed by Charles Babbage to automatically compute and tabulate polynomial functions, often regarded as a precursor to modern computers.
-
D.
Bhattacharyya distance
Bhattacharyya distance is a statistical measure of similarity between two probability distributions, often used in pattern recognition and classification to quantify their overlap.
-
E.
Bhattacharyya coefficient
The Bhattacharyya coefficient is a statistical measure of similarity between two probability distributions, often used to quantify their overlap in fields like pattern recognition and signal processing.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.