| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| johnwest (0) - 4 freq john's (3) - 43 freq loangest (3) - 1 freq 'onest (3) - 1 freq howest (3) - 1 freq jowes (3) - 5 freq honest (3) - 195 freq soonest (3) - 1 freq roondest (3) - 2 freq lowest (3) - 10 freq jones' (3) - 2 freq jones (3) - 39 freq johns (3) - 9 freq youngest (3) - 34 freq johnwick (3) - 1 freq johnnys (3) - 1 freq contest (3) - 16 freq johnneh (3) - 6 freq nor'west (3) - 1 freq jowelt (3) - 2 freq johnie (3) - 9 freq bonniest (3) - 48 freq johne (3) - 1 freq johnne (3) - 1 freq johannes (3) - 1 freq |
johnwest (0) - 4 freq johnnys (5) - 1 freq johnwick (5) - 1 freq johns (5) - 9 freq johnnies (5) - 1 freq honest (5) - 195 freq howest (5) - 1 freq john's (5) - 43 freq johannes (5) - 1 freq johnne (6) - 1 freq ghawst (6) - 2 freq longest (6) - 4 freq fondest (6) - 1 freq honesty (6) - 21 freq johnston (6) - 19 freq hanest (6) - 1 freq johnsmi (6) - 12 freq thinnest (6) - 2 freq johnson (6) - 59 freq johne (6) - 1 freq newest (6) - 15 freq unhonest (6) - 1 freq honist (6) - 1 freq roondest (6) - 2 freq jones (6) - 39 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 - JNWST johnwest - 4 freq |
JOHNWEST |
| Time to execute Levenshtein function - 0.234616 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.387891 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.027755 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.037940 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.000897 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. |