Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
eternitie (0) - 8 freq eternity (2) - 18 freq tentie (3) - 38 freq meenitie (3) - 7 freq veritie (3) - 3 freq eternity's (3) - 2 freq sternit (3) - 1 freq uteilitie (3) - 1 freq energitic (3) - 1 freq stentie (3) - 1 freq cheritie (3) - 3 freq eterne (3) - 2 freq stentit (4) - 9 freq thertie (4) - 5 freq stentin (4) - 2 freq territor (4) - 5 freq ethnicitie (4) - 1 freq returnit (4) - 6 freq ernie (4) - 50 freq traitit (4) - 5 freq hertie (4) - 11 freq acteivitie (4) - 2 freq trootie (4) - 3 freq affinitie (4) - 1 freq threttie (4) - 4 freq |
eternitie (0) - 8 freq eternity (2) - 18 freq eterne (4) - 2 freq sternit (4) - 1 freq turnit (4) - 27 freq tentie (4) - 38 freq alternate (5) - 3 freq treatie (5) - 2 freq tertia (5) - 5 freq twintie (5) - 7 freq autoritie (5) - 3 freq turnt (5) - 621 freq uterine (5) - 1 freq tertio (5) - 1 freq trainie (5) - 3 freq dernit (5) - 4 freq tortie (5) - 5 freq tristie (5) - 1 freq twantie (5) - 2 freq maternity (5) - 5 freq tirnt (5) - 21 freq trinity (5) - 11 freq reunite (5) - 1 freq turnie (5) - 2 freq tonite (5) - 6 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 |
ETERNITIE |
Time to execute Levenshtein function - 0.213459 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.369713 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.027928 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.037061 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.000800 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. |