| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eternitie (0) - 8 freq eternity (2) - 18 freq veritie (3) - 3 freq sternit (3) - 1 freq meenitie (3) - 7 freq stentie (3) - 1 freq terribie (3) - 1 freq eternity's (3) - 2 freq cheritie (3) - 3 freq energitic (3) - 1 freq uteilitie (3) - 1 freq eterne (3) - 2 freq tentie (3) - 38 freq steidie (4) - 1 freq alternate (4) - 3 freq termintit (4) - 2 freq reunite (4) - 1 freq acteivitie (4) - 2 freq fernlie (4) - 1 freq freitie (4) - 2 freq untentie (4) - 2 freq densitie (4) - 1 freq eenie (4) - 4 freq overbite (4) - 1 freq efterlife (4) - 2 freq |
eternitie (0) - 8 freq eternity (2) - 18 freq tentie (4) - 38 freq turnit (4) - 27 freq eterne (4) - 2 freq sternit (4) - 1 freq trainie (5) - 3 freq turnt (5) - 622 freq turnie (5) - 2 freq tertia (5) - 5 freq uterine (5) - 1 freq twantie (5) - 2 freq twintie (5) - 7 freq trinity (5) - 11 freq tonite (5) - 6 freq tirnt (5) - 21 freq returnit (5) - 6 freq lernit (5) - 1 freq tertio (5) - 1 freq eternal (5) - 29 freq dernit (5) - 4 freq autoritie (5) - 3 freq tortie (5) - 5 freq twentie (5) - 1 freq traitit (5) - 5 freq |
SoundEx code - E365 eterne - 2 freq eternal - 29 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 |
ETERNITIE |
| Time to execute Levenshtein function - 0.317332 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.559517 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.027134 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.070073 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.000907 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. |