| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eternally (0) - 7 freq externally (1) - 1 freq eternell (2) - 1 freq internally (2) - 4 freq iterally (2) - 1 freq eternal (2) - 25 freq sternly (3) - 7 freq leeterally (3) - 2 freq ethically (3) - 1 freq eternity (3) - 18 freq verbally (3) - 1 freq terminally (3) - 1 freq generally (3) - 55 freq external (3) - 7 freq feenally (3) - 1 freq materially (3) - 1 freq literally (3) - 42 freq eheswally (3) - 1 freq eeswally (3) - 4 freq eyeballs (4) - 4 freq beriall (4) - 1 freq pernelle (4) - 3 freq tentily (4) - 22 freq really (4) - 1212 freq waterfall (4) - 2 freq |
eternally (0) - 7 freq eternell (2) - 1 freq externally (2) - 1 freq eternal (3) - 25 freq iterally (3) - 1 freq internally (3) - 4 freq terminally (4) - 1 freq literally (5) - 42 freq pernelle (5) - 3 freq peronall (5) - 1 freq materially (5) - 1 freq tryall (5) - 1 freq gornall (5) - 1 freq terrell (5) - 4 freq trolly (5) - 1 freq sternly (5) - 7 freq leeterally (5) - 2 freq feenally (5) - 1 freq ethically (5) - 1 freq verbally (5) - 1 freq eternity (5) - 18 freq external (5) - 7 freq maternal (6) - 11 freq verball (6) - 1 freq formally (6) - 7 freq |
SoundEx code - E365 eterne - 2 freq eternal - 25 freq etterin - 1 freq eternitie - 8 freq eternally - 7 freq eternity - 18 freq ethernan - 5 freq ethernan's - 1 freq eternity's - 2 freq eternell - 1 freq eduroam - 1 freq edrom - 1 freq |
MetaPhone code - ETRNL eternal - 25 freq eternally - 7 freq eternell - 1 freq |
ETERNALLY |
| Time to execute Levenshtein function - 0.198508 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.361520 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.026945 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.036822 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.000859 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. |