Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lloydwatson (0) - 2 freq playstation (5) - 5 freq imwatson (5) - 1 freq thordarson (5) - 4 freq foondation (5) - 6 freq bloviation (5) - 1 freq watson (5) - 46 freq location (5) - 35 freq greggwatson (5) - 1 freq leason (6) - 1 freq slowan (6) - 1 freq adoration (6) - 6 freq blowstin (6) - 2 freq bandwagon (6) - 1 freq lydon (6) - 1 freq loasen (6) - 3 freq quotation (6) - 19 freq operation (6) - 41 freq glydan (6) - 1 freq clydefcsof (6) - 1 freq clydesof (6) - 5 freq lowsen (6) - 2 freq coronation (6) - 8 freq london (6) - 182 freq radiation (6) - 3 freq |
lloydwatson (0) - 2 freq imwatson (8) - 1 freq watson (8) - 46 freq lowsin (9) - 47 freq allocatin (9) - 1 freq plowtin (9) - 2 freq ellenrwilson (9) - 1 freq lawson (9) - 2 freq plowts (9) - 1 freq illumination (9) - 2 freq hewitson (9) - 1 freq alliteration (9) - 5 freq loganwilson (9) - 1 freq goldson (9) - 1 freq datsun (9) - 3 freq alleyways (9) - 1 freq liquidation (9) - 2 freq allowans (9) - 1 freq gledson (9) - 8 freq validation (9) - 2 freq blowts (9) - 1 freq godwits (9) - 1 freq blodwin (9) - 1 freq lowtin (9) - 1 freq flowetin (9) - 1 freq |
SoundEx code - L332 lutwidge - 3 freq €œlie-toats - 1 freq ldetj - 1 freq lloydwatson - 2 freq |
MetaPhone code - LTWTSN lloydwatson - 2 freq |
LLOYDWATSON |
Time to execute Levenshtein function - 0.215766 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.401735 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.040916 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.070165 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.000866 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. |