| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eternity (0) - 18 freq maternity (2) - 5 freq eternitie (2) - 8 freq eternity's (2) - 2 freq sternit (2) - 1 freq enterit (3) - 2 freq trinity (3) - 11 freq fraternity (3) - 6 freq sterility (3) - 1 freq uteelity (3) - 1 freq returnit (3) - 6 freq modernity (3) - 1 freq tunity (3) - 1 freq tenty (3) - 6 freq terrify (3) - 1 freq emergit (3) - 1 freq lernit (3) - 1 freq eternal (3) - 25 freq eerily (3) - 1 freq turnit (3) - 27 freq verity (3) - 2 freq sternies (3) - 1 freq sternly (3) - 7 freq efternin (3) - 11 freq exertit (3) - 2 freq |
eternity (0) - 18 freq eternitie (2) - 8 freq trinity (3) - 11 freq maternity (3) - 5 freq sternit (3) - 1 freq turnit (3) - 27 freq eternal (4) - 25 freq lernit (4) - 1 freq serenity (4) - 2 freq dernit (4) - 4 freq taranty (4) - 1 freq turnt (4) - 621 freq tenty (4) - 6 freq eternity's (4) - 2 freq sternt (4) - 1 freq eterne (4) - 2 freq etnty (4) - 1 freq returnit (4) - 6 freq tunity (4) - 1 freq tirnt (4) - 21 freq turnout (5) - 3 freq leernt (5) - 2 freq tartit (5) - 1 freq traety (5) - 1 freq kirnit (5) - 1 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 - ETRNT eternitie - 8 freq eternity - 18 freq |
ETERNITY |
| Time to execute Levenshtein function - 0.499125 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.514099 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.029227 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.068908 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.000860 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. |