| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eternal (0) - 25 freq external (1) - 7 freq 'external (2) - 1 freq internal (2) - 19 freq vernal (2) - 3 freq eternally (2) - 7 freq ethernan (2) - 5 freq paternal (2) - 8 freq maternal (2) - 11 freq eterne (2) - 2 freq ethereal (2) - 2 freq neteral (2) - 1 freq eternell (2) - 1 freq penal (3) - 5 freq yernan (3) - 1 freq sterran (3) - 1 freq tertan (3) - 1 freq literal (3) - 7 freq retinal (3) - 1 freq eternity (3) - 18 freq aerial (3) - 5 freq thrial (3) - 1 freq derval (3) - 17 freq thermal (3) - 12 freq turnan (3) - 20 freq |
eternal (0) - 25 freq external (2) - 7 freq maternal (3) - 11 freq paternal (3) - 8 freq eternell (3) - 1 freq eterne (3) - 2 freq vernal (3) - 3 freq internal (3) - 19 freq eternally (3) - 7 freq diurnal (4) - 1 freq jurnal (4) - 1 freq turnan (4) - 20 freq sternly (4) - 7 freq journal (4) - 29 freq kernel (4) - 1 freq otral (4) - 1 freq traal (4) - 1 freq ternos (4) - 1 freq tonal (4) - 8 freq terns (4) - 2 freq eternity (4) - 18 freq neteral (4) - 1 freq ethereal (4) - 2 freq ethernan (4) - 5 freq 'external (4) - 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 - ETRNL eternal - 25 freq eternally - 7 freq eternell - 1 freq |
ETERNAL |
| Time to execute Levenshtein function - 0.456399 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.723678 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.074306 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.037090 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.000960 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. |