| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jamieeast (0) - 2 freq ameest (3) - 1 freq jamie's (3) - 10 freq jamieca (3) - 3 freq jaist (4) - 53 freq james's (4) - 3 freq jameses (4) - 1 freq cameras (4) - 10 freq jaiket (4) - 105 freq jack-easy (4) - 2 freq mpkeast (4) - 3 freq jakies (4) - 2 freq jamsie's (4) - 1 freq aafilest (4) - 1 freq jatest (4) - 1 freq miast (4) - 1 freq hameart (4) - 3 freq jamie (4) - 131 freq james (4) - 283 freq hamewart (4) - 3 freq lambast (4) - 1 freq gamie's (4) - 2 freq jamieson (4) - 21 freq jaimes (4) - 4 freq jailers (4) - 1 freq |
jamieeast (0) - 2 freq ameest (4) - 1 freq miast (5) - 1 freq james' (5) - 2 freq jamieson (5) - 21 freq jaimes (5) - 4 freq jamesy (5) - 25 freq james (5) - 283 freq jatest (5) - 1 freq jamieca (5) - 3 freq jamie's (5) - 10 freq jameses (5) - 1 freq jaist (5) - 53 freq jeest (5) - 38 freq jamesca (6) - 1 freq juist (6) - 1764 freq namaste (6) - 2 freq mist (6) - 81 freq aamaist (6) - 56 freq awmiaist (6) - 1 freq smaest (6) - 2 freq maist (6) - 1959 freq jams (6) - 3 freq maest (6) - 15 freq jjuist (6) - 1 freq |
SoundEx code - J523 jinkwhit - 1 freq jinked - 9 freq johnston - 19 freq junction - 11 freq junctien's - 1 freq joanstoon - 1 freq johnston' - 1 freq johnstone - 35 freq jinged - 1 freq jinkit - 7 freq jaunched - 1 freq jinxed - 2 freq jensdóttir - 1 freq jamstane - 1 freq junkit - 1 freq jensdottir - 2 freq janeygodley - 50 freq janegotagun - 1 freq jmacdeee - 1 freq jamestudhope - 2 freq johnmcd - 2 freq joewhimster - 7 freq jamieeast - 2 freq jamesaithie - 3 freq jamesdoleman - 4 freq janeygodley's - 1 freq jomcd - 3 freq johnwest - 4 freq jamesedwinmusic - 1 freq jwmmctykzk - 1 freq jmscd - 1 freq jonstackpool - 1 freq |
MetaPhone code - JMST jamieeast - 2 freq |
JAMIEEAST |
| Time to execute Levenshtein function - 0.375494 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.533130 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.027426 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.037100 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.000877 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. |