| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iterally (0) - 1 freq literally (1) - 42 freq eternally (2) - 7 freq ideally (2) - 2 freq liberally (2) - 1 freq internally (2) - 4 freq trolly (3) - 1 freq leeterally (3) - 2 freq miserably (3) - 3 freq totally (3) - 121 freq overall (3) - 7 freq sternly (3) - 7 freq morally (3) - 3 freq stealy (3) - 2 freq eraly (3) - 1 freq legally (3) - 13 freq materially (3) - 1 freq orally (3) - 2 freq aurally (3) - 1 freq i'telly (3) - 1 freq naturally (3) - 44 freq naiturally (3) - 2 freq literal (3) - 7 freq generally (3) - 56 freq naitrally (3) - 1 freq |
iterally (0) - 1 freq literally (2) - 42 freq trolly (3) - 1 freq eternally (3) - 7 freq trolley (4) - 27 freq naitrally (4) - 1 freq traill (4) - 2 freq naturally (4) - 44 freq reeeally (4) - 1 freq naiturally (4) - 2 freq itall (4) - 1 freq rally (4) - 10 freq thrall (4) - 4 freq 'really (4) - 7 freq brally (4) - 4 freq trill (4) - 3 freq aurally (4) - 1 freq tryall (4) - 1 freq materially (4) - 1 freq totally (4) - 121 freq overall (4) - 7 freq troll (4) - 11 freq leeterally (4) - 2 freq internally (4) - 4 freq orally (4) - 2 freq |
SoundEx code - I364 itherwhiles - 2 freq ither'll - 1 freq iterally - 1 freq |
MetaPhone code - ITRL iterally - 1 freq |
ITERALLY |
| Time to execute Levenshtein function - 0.671756 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 - 1.513686 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.088446 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.115848 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.001057 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. |