| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ontilt (0) - 4 freq intilt (1) - 11 freq ontill (1) - 3 freq ontil (1) - 53 freq onpit (2) - 1 freq ontull (2) - 1 freq ettilt (2) - 25 freq cantilt (2) - 1 freq oantil (2) - 1 freq ontied (2) - 1 freq antit (2) - 1 freq intit (2) - 11 freq untelt (2) - 2 freq intil (2) - 554 freq until (2) - 495 freq tilt (2) - 30 freq nailt (2) - 2 freq onkils (2) - 1 freq inti't (2) - 1 freq oneill (2) - 2 freq intill (2) - 125 freq intult (2) - 1 freq intil't (2) - 41 freq onkil (2) - 9 freq contint (2) - 1 freq |
ontilt (0) - 4 freq intilt (1) - 11 freq untelt (2) - 2 freq ontil (2) - 53 freq intult (2) - 1 freq ontill (2) - 3 freq tilt (3) - 30 freq inti't (3) - 1 freq until (3) - 495 freq intil't (3) - 41 freq stilt (3) - 1 freq intil (3) - 554 freq intill (3) - 125 freq nailt (3) - 2 freq intit (3) - 11 freq ontull (3) - 1 freq ettilt (3) - 25 freq cantilt (3) - 1 freq antit (3) - 1 freq oantil (3) - 1 freq ootlat (4) - 6 freq notit (4) - 13 freq entitilt (4) - 1 freq outlet (4) - 3 freq entitlit (4) - 1 freq |
SoundEx code - O534 ontil - 53 freq ontill - 3 freq ontull - 1 freq ontilt - 4 freq ontolojiecal - 1 freq oantil - 1 freq onthelist - 2 freq |
MetaPhone code - ONTLT ontilt - 4 freq |
ONTILT |
| Time to execute Levenshtein function - 0.706950 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.886958 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.094641 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.103357 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.001203 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. |