| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onkils (0) - 1 freq onkil (1) - 9 freq oils (2) - 2 freq oboils (2) - 1 freq unkil (2) - 4 freq ontil (2) - 53 freq oneill (2) - 2 freq tonsils (2) - 3 freq runkils (2) - 1 freq nails (2) - 80 freq ontill (2) - 3 freq anvils (2) - 1 freq onks (2) - 1 freq fankils (2) - 1 freq snails (2) - 13 freq angils (2) - 1 freq ontilt (2) - 4 freq ochils (2) - 8 freq cakies (3) - 1 freq online (3) - 143 freq ouks (3) - 2 freq bekis (3) - 6 freq tinkies (3) - 2 freq monks (3) - 23 freq oiles (3) - 1 freq |
onkils (0) - 1 freq onkil (2) - 9 freq anvils (3) - 1 freq ankles (3) - 24 freq fankils (3) - 1 freq angils (3) - 1 freq runkils (3) - 1 freq onks (3) - 1 freq nails (3) - 80 freq unkil (3) - 4 freq ingels (4) - 2 freq rankels (4) - 1 freq inklins (4) - 2 freq nirls (4) - 1 freq lokals (4) - 1 freq incels (4) - 1 freq nals (4) - 1 freq unkens (4) - 1 freq skeils (4) - 1 freq nikies (4) - 1 freq ainvils (4) - 1 freq winkels (4) - 1 freq novils (4) - 1 freq nls (4) - 6 freq kilos (4) - 1 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 - ONKLS onkils - 1 freq |
ONKILS |
| Time to execute Levenshtein function - 0.246964 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.392544 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.030861 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.038583 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.000870 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. |