| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ellenrwilson (0) - 1 freq glenhswilson (4) - 1 freq loganwilson (5) - 1 freq ellonwill (5) - 2 freq bryanwilson (5) - 1 freq gerrywilson (5) - 1 freq iewilson (5) - 1 freq allergies (6) - 2 freq rabwilson (6) - 3 freq dennison (6) - 10 freq televison (6) - 1 freq sklentwise (6) - 1 freq ollerton (6) - 1 freq elecktion (6) - 1 freq windywilson (6) - 4 freq essention (6) - 1 freq election (6) - 87 freq lloydwatson (6) - 2 freq kayenicolson (6) - 1 freq andrewwilson (6) - 2 freq hewitson (6) - 1 freq lentils (6) - 2 freq ellen's (6) - 6 freq extension (6) - 11 freq ellahickson (6) - 4 freq |
ellenrwilson (0) - 1 freq loganwilson (7) - 1 freq glenhswilson (7) - 1 freq gerrywilson (8) - 1 freq bryanwilson (8) - 1 freq ellonwill (8) - 2 freq allierenison (9) - 1 freq glenwelsh (9) - 2 freq lloydwatson (9) - 2 freq iewilson (9) - 1 freq windywilson (9) - 4 freq ellahickson (10) - 4 freq glenlyon (10) - 6 freq kwilson (10) - 2 freq energisin (10) - 1 freq henryson (10) - 14 freq unraison (10) - 1 freq neilson (10) - 11 freq ellen's (10) - 6 freq wilson (10) - 48 freq mwilson (10) - 1 freq lentils (10) - 2 freq rabwilson (10) - 3 freq allergies (10) - 2 freq ill-wysin (10) - 1 freq |
SoundEx code - E456 eyeliner - 3 freq elmer - 2 freq eyeliners - 1 freq eleanor - 10 freq elmar - 2 freq eleanordacq - 1 freq ellenrwilson - 1 freq |
MetaPhone code - ELNRWLSN ellenrwilson - 1 freq |
ELLENRWILSON |
| Time to execute Levenshtein function - 0.224426 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.413482 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.030324 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.038162 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.000832 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. |