| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jamieeast (0) - 2 freq jamieca (3) - 3 freq jamie's (3) - 10 freq ameest (3) - 1 freq miast (4) - 1 freq hamewart (4) - 3 freq lambast (4) - 1 freq gamies (4) - 11 freq jailers (4) - 1 freq jamsie's (4) - 1 freq damnest (4) - 1 freq cameras (4) - 10 freq 'jamie's (4) - 1 freq jeest (4) - 38 freq jameses (4) - 1 freq jaimes (4) - 4 freq jameela (4) - 2 freq damies (4) - 1 freq gamie's (4) - 2 freq jamie'd (4) - 1 freq jaiket (4) - 105 freq jaikets (4) - 13 freq jakies (4) - 2 freq fairest (4) - 7 freq aafilest (4) - 1 freq |
jamieeast (0) - 2 freq ameest (4) - 1 freq jaimes (5) - 4 freq jeest (5) - 38 freq james (5) - 283 freq jaist (5) - 53 freq james' (5) - 2 freq jatest (5) - 1 freq jamesy (5) - 25 freq jamieson (5) - 21 freq jameses (5) - 1 freq miast (5) - 1 freq jamie's (5) - 10 freq jamieca (5) - 3 freq awmiaist (6) - 1 freq hiemaist (6) - 1 freq jamesina (6) - 7 freq jaloust (6) - 3 freq namaste (6) - 2 freq jumpet (6) - 1 freq amost (6) - 1 freq jeems (6) - 91 freq jist (6) - 6672 freq jameson (6) - 2 freq jeust (6) - 35 freq |
SoundEx code - J523 jinkwhit - 1 freq jinked - 8 freq johnston - 18 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.285551 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.481272 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.029679 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.041345 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.001161 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. |