| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| journey (0) - 109 freq journay (1) - 3 freq journeys (1) - 2 freq journey' (1) - 1 freq jurney (1) - 2 freq bourne (2) - 1 freq mournes (2) - 2 freq mourner (2) - 2 freq jurnay (2) - 6 freq journos (2) - 4 freq gourley (2) - 17 freq €œjourney (2) - 1 freq journey's (2) - 3 freq journal (2) - 29 freq journo (2) - 1 freq mourne (2) - 6 freq journeyed (2) - 1 freq kourtney (2) - 1 freq mourned (2) - 1 freq burner (3) - 3 freq looney (3) - 3 freq sources (3) - 24 freq sturmey (3) - 1 freq sorley (3) - 2 freq doorkey (3) - 1 freq |
journey (0) - 109 freq journay (1) - 3 freq jurney (1) - 2 freq journo (2) - 1 freq journey' (2) - 1 freq journeys (2) - 2 freq jurnay (2) - 6 freq jurnai (3) - 1 freq journal (3) - 29 freq journeyed (3) - 1 freq mourne (3) - 6 freq journos (3) - 4 freq bourne (3) - 1 freq carney (4) - 1 freq tierney (4) - 1 freq jurgen (4) - 1 freq june (4) - 101 freq juries (4) - 1 freq janey (4) - 10 freq bairney (4) - 1 freq jours (4) - 1 freq jure (4) - 1 freq urny (4) - 4 freq jauries (4) - 2 freq horny (4) - 1 freq |
SoundEx code - J650 journey - 109 freq jsreen - 1 freq jorum - 1 freq jurney - 2 freq jrom - 1 freq jeerin - 3 freq jeremey - 1 freq jeremy - 12 freq journo - 1 freq jehoram - 2 freq jeremiah - 4 freq jorim - 3 freq joram - 2 freq jurnay - 6 freq jurnai - 1 freq journey' - 1 freq journay - 3 freq €œjourney - 1 freq jarrin - 2 freq |
MetaPhone code - JRN journey - 109 freq girn - 59 freq jurney - 2 freq jeerin - 3 freq journo - 1 freq gern - 1 freq girny - 4 freq jurnay - 6 freq geyran - 1 freq girnie - 3 freq gearin - 2 freq gyran - 1 freq jurnai - 1 freq giorno - 2 freq journey' - 1 freq journay - 3 freq gerrin' - 2 freq €œjourney - 1 freq 'girn' - 1 freq jarrin - 2 freq 'girny - 1 freq |
JOURNEY |
| Time to execute Levenshtein function - 0.168535 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.319974 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.029543 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.037891 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.000843 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. |