| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eterne (0) - 2 freq turne (2) - 1 freq sternt (2) - 1 freq stere (2) - 1 freq terns (2) - 2 freq stern (2) - 46 freq westerne (2) - 1 freq lerne (2) - 1 freq sterns (2) - 26 freq sterner (2) - 2 freq tern (2) - 1 freq sterve (2) - 14 freq eternell (2) - 1 freq everie (2) - 4 freq eerie (2) - 34 freq uterine (2) - 1 freq erne (2) - 4 freq stirne (2) - 1 freq eternal (2) - 29 freq exerce (2) - 1 freq berne (2) - 1 freq everee (2) - 1 freq ceterae (2) - 1 freq emerge (2) - 12 freq terre (2) - 1 freq |
eterne (0) - 2 freq tern (2) - 1 freq uterine (2) - 1 freq turne (2) - 1 freq terre (3) - 1 freq eternal (3) - 29 freq stirne (3) - 1 freq trone (3) - 6 freq turnie (3) - 2 freq tryne (3) - 5 freq turn (3) - 818 freq torn (3) - 51 freq tirn (3) - 35 freq trine (3) - 2 freq erne (3) - 4 freq tyrone (3) - 6 freq berne (3) - 1 freq tierney (3) - 1 freq terns (3) - 2 freq stern (3) - 46 freq lerne (3) - 1 freq stearn (4) - 1 freq atore (4) - 2 freq thone (4) - 13 freq tron (4) - 11 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 - ETRN eterne - 2 freq etterin - 1 freq |
ETERNE |
| Time to execute Levenshtein function - 0.223046 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.402137 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.030968 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.039245 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.002771 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. |