| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dilettantes (0) - 1 freq dilettanti's (2) - 1 freq dilettanti (2) - 2 freq milestanes (3) - 6 freq milestane (4) - 2 freq distances (4) - 10 freq delegates (4) - 3 freq distante (4) - 2 freq dictates (4) - 3 freq millstanes (4) - 2 freq lettan (5) - 1 freq diseases (5) - 8 freq valentines (5) - 8 freq jivetoaster (5) - 1 freq deleteart (5) - 1 freq distanee (5) - 2 freq diamante (5) - 2 freq pilates (5) - 1 freq debutante (5) - 1 freq celebrants (5) - 1 freq dilations (5) - 1 freq millstane (5) - 2 freq distance (5) - 173 freq pleasanter (5) - 1 freq silences (5) - 3 freq |
dilettantes (0) - 1 freq dilettanti (3) - 2 freq dilettanti's (3) - 1 freq milestanes (6) - 6 freq dilations (7) - 1 freq pollutants (7) - 1 freq flettent (7) - 6 freq dictates (7) - 3 freq distante (7) - 2 freq distances (7) - 10 freq delegates (7) - 3 freq distant (8) - 54 freq hailstanes (8) - 2 freq militant (8) - 2 freq quittances (8) - 1 freq wittans (8) - 2 freq dantes (8) - 1 freq destinies (8) - 1 freq hielants (8) - 1 freq decendants (8) - 2 freq deviants (8) - 1 freq lettres (8) - 1 freq diamants (8) - 1 freq dittan (8) - 1 freq flattent (8) - 1 freq |
SoundEx code - D435 dalton - 1 freq dilutin - 10 freq dilations - 1 freq delytin - 1 freq dilettanti - 2 freq dilettanti's - 1 freq dilution - 2 freq diluting - 2 freq deludin - 1 freq €œdilution - 1 freq deletion - 1 freq delting - 2 freq dilettantes - 1 freq dolton - 1 freq |
MetaPhone code - TLTNTS dilettanti's - 1 freq dilettantes - 1 freq |
DILETTANTES |
| Time to execute Levenshtein function - 0.258131 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.383727 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.030327 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.040979 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000980 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |