| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| johnmettham (0) - 1 freq johngrisham (4) - 1 freq somethm (5) - 1 freq jonathan (5) - 9 freq johnmarshall (5) - 2 freq jonatha (5) - 1 freq johnegan (5) - 1 freq johnneh (5) - 6 freq confettae (5) - 1 freq jotham (5) - 4 freq johnwest (5) - 4 freq documenttak (6) - 1 freq johnston' (6) - 1 freq cometh (6) - 6 freq hexham (6) - 1 freq documentar (6) - 1 freq monietoran (6) - 1 freq doonpittan (6) - 1 freq johndeere (6) - 3 freq johnhegley (6) - 1 freq vendetta (6) - 1 freq metther (6) - 1 freq conceptual (6) - 3 freq emmenthal (6) - 1 freq moneygram (6) - 1 freq |
johnmettham (0) - 1 freq johngrisham (7) - 1 freq jotham (9) - 4 freq johnmacleanma (9) - 2 freq johnneh (9) - 6 freq johnwest (9) - 4 freq somethm (9) - 1 freq jonathan (9) - 9 freq johnmarshall (9) - 2 freq jonatha (9) - 1 freq grantham (10) - 1 freq monteith (10) - 2 freq bentham (10) - 1 freq matthat (10) - 4 freq monmouth (10) - 4 freq johnbrash (10) - 25 freq johnston (10) - 19 freq johnmcruvie (10) - 2 freq mattha (10) - 22 freq matthan (10) - 4 freq chatham (10) - 1 freq metther (10) - 1 freq johnbishop (10) - 9 freq jismethen (10) - 1 freq johnston' (10) - 1 freq |
SoundEx code - J535 jauntin - 1 freq jondeen - 3 freq jundyin - 3 freq jandin - 1 freq jonathan - 9 freq jonathan's - 1 freq jointing - 1 freq jamietinlin - 1 freq jonathancyborg - 1 freq jeanettenicl - 1 freq jonathanmeres - 2 freq johnnydundee - 3 freq johnmettham - 1 freq johnnyedmond - 2 freq |
MetaPhone code - JNMTM johnmettham - 1 freq |
JOHNMETTHAM |
| Time to execute Levenshtein function - 0.253392 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.406864 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.028032 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.037360 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.000878 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. |