| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onkil (0) - 9 freq unkil (1) - 4 freq ontil (1) - 53 freq onkils (1) - 1 freq ponkin (2) - 1 freq nil (2) - 7 freq fankil (2) - 2 freq onie (2) - 778 freq oakiv (2) - 1 freq ookin (2) - 1 freq onks (2) - 1 freq o'neil (2) - 1 freq snail (2) - 33 freq oantil (2) - 1 freq on-it (2) - 2 freq honkin (2) - 27 freq onli (2) - 40 freq ontill (2) - 3 freq onlie (2) - 102 freq oki (2) - 5 freq nkhl (2) - 1 freq poneil (2) - 3 freq onnir (2) - 1 freq onhin (2) - 2 freq onabil (2) - 1 freq |
onkil (0) - 9 freq unkil (1) - 4 freq onkils (2) - 1 freq ontil (2) - 53 freq inkin (3) - 1 freq nail (3) - 46 freq until (3) - 495 freq onabil (3) - 1 freq skil (3) - 3 freq inkir (3) - 1 freq ingil (3) - 5 freq oekl (3) - 1 freq unkin (3) - 4 freq ankle (3) - 36 freq intil (3) - 554 freq nkhl (3) - 1 freq anvil (3) - 5 freq oneill (3) - 2 freq neil (3) - 87 freq onks (3) - 1 freq oantil (3) - 1 freq fankil (3) - 2 freq onli (3) - 40 freq nil (3) - 7 freq onlie (3) - 102 freq |
SoundEx code - O524 ooneeswal - 2 freq own-goal - 1 freq oneself - 1 freq onkils - 1 freq onkil - 9 freq onslaught - 1 freq onchlexkcd - 1 freq |
MetaPhone code - ONKL own-goal - 1 freq onkil - 9 freq |
ONKIL |
| Time to execute Levenshtein function - 0.191050 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.355819 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.027577 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.037177 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.000908 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. |