| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onpossibill (0) - 1 freq on-possible (3) - 1 freq unpossible (3) - 4 freq possibil (3) - 7 freq possiboal (4) - 1 freq possible (4) - 179 freq empossible (4) - 1 freq impossibly (4) - 3 freq impossible (4) - 51 freq possibly (4) - 56 freq possibles (5) - 1 freq poasible (5) - 1 freq poassibly (5) - 1 freq esponsible (5) - 1 freq opposeition (5) - 1 freq impoassible (5) - 1 freq nobill (5) - 1 freq possieble (5) - 1 freq opposition (5) - 30 freq possibility (5) - 19 freq positit (6) - 1 freq onabil (6) - 1 freq inveesible (6) - 9 freq unjoukabil (6) - 1 freq composition (6) - 3 freq |
onpossibill (0) - 1 freq unpossible (4) - 4 freq on-possible (5) - 1 freq possibil (5) - 7 freq possibly (6) - 56 freq impossibly (6) - 3 freq impossible (6) - 51 freq possiboal (6) - 1 freq empossible (6) - 1 freq possible (6) - 179 freq possieble (7) - 1 freq impoassible (7) - 1 freq poassibly (7) - 1 freq possibility (7) - 19 freq possibles (7) - 1 freq possibeility (8) - 1 freq unmissable (8) - 2 freq possiebility (8) - 1 freq inacsesibl (8) - 1 freq poasible (8) - 1 freq esponsible (8) - 1 freq nobill (8) - 1 freq unplaesabl (9) - 1 freq sabill (9) - 1 freq lassie'll (9) - 1 freq |
SoundEx code - O512 onbeiss - 3 freq on-possible - 1 freq onabasit - 1 freq onaffectiounat - 1 freq onfaws - 2 freq onbousum - 1 freq onfeize - 1 freq on-best-behaviour - 1 freq onpossibill - 1 freq onbeasts - 1 freq omfj - 1 freq omfg - 1 freq oymevyqsne - 1 freq onwpqi - 1 freq oenfcnd - 1 freq |
MetaPhone code - ONPSBL on-possible - 1 freq onpossibill - 1 freq |
ONPOSSIBILL |
| Time to execute Levenshtein function - 0.214463 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.374458 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.028114 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.044482 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.000905 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. |