| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elizabeth (0) - 16 freq elisabeth (1) - 1 freq elizabe (2) - 5 freq elizabethan (2) - 2 freq elizabeth's (2) - 1 freq leezabeth (3) - 1 freq lysbeth (4) - 1 freq elijah (4) - 25 freq alphabets (4) - 1 freq hiraeth (4) - 1 freq lieth (4) - 2 freq lizacatz (4) - 3 freq nazareth (4) - 24 freq clingeth (4) - 1 freq alphabet (4) - 15 freq lïzbeth (4) - 13 freq elibeli (4) - 1 freq elspeth (4) - 50 freq liath (4) - 1 freq glideth (4) - 1 freq liet (5) - 4 freq plinth (5) - 3 freq luath (5) - 16 freq daeth (5) - 17 freq lizard's (5) - 7 freq |
elizabeth (0) - 16 freq elisabeth (2) - 1 freq elizabethan (3) - 2 freq leezabeth (3) - 1 freq elizabeth's (4) - 1 freq elizabe (4) - 5 freq lysbeth (5) - 1 freq lïzbeth (6) - 13 freq liath (6) - 1 freq nazareth (6) - 24 freq elspeth (6) - 50 freq lieth (6) - 2 freq lizacatz (6) - 3 freq lanth (7) - 3 freq bloodbath (7) - 1 freq lozart (7) - 1 freq zeneth (7) - 1 freq loath (7) - 4 freq linth (7) - 42 freq eleiventh (7) - 1 freq eleevinth (7) - 1 freq i'bath (7) - 1 freq lingth (7) - 2 freq eleventh (7) - 6 freq beth (7) - 26 freq |
SoundEx code - E421 elspeth - 50 freq else'-bit - 1 freq eligible - 4 freq else'--but - 1 freq elizabeth - 16 freq elusive - 5 freq elizabethan - 2 freq else'-but - 2 freq elspeth's - 7 freq elisabeth - 1 freq elizabeth's - 1 freq elxsbhppjd - 1 freq elliesbeaton - 1 freq elspethkerrsnp - 1 freq elizabe - 5 freq elhscp - 6 freq elskifatboyslim - 2 freq |
MetaPhone code - ELSB0 elizabeth - 16 freq elisabeth - 1 freq |
ELIZABETH |
| Time to execute Levenshtein function - 0.186256 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.362480 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.027137 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.037270 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.000855 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. |