| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nbioiwlb (0) - 1 freq bowls (4) - 20 freq noisily (4) - 9 freq bowlt (4) - 1 freq bowly (4) - 3 freq boily (4) - 1 freq biow (4) - 1 freq browls (4) - 2 freq bowle (4) - 2 freq boils (4) - 4 freq siowly (4) - 2 freq nihil (4) - 4 freq bowl (4) - 73 freq boil (4) - 19 freq bowld (4) - 3 freq neidil (4) - 1 freq oboils (4) - 1 freq bouls (5) - 2 freq nit-wit (5) - 1 freq howlt (5) - 1 freq nibbelt (5) - 2 freq howld (5) - 17 freq nicely (5) - 16 freq soil (5) - 30 freq cobweb (5) - 1 freq |
nbioiwlb (0) - 1 freq bowle (6) - 2 freq bowl (6) - 73 freq bowls (6) - 20 freq bowld (6) - 3 freq bowly (6) - 3 freq bowlt (6) - 1 freq anbile (7) - 1 freq nibblt (7) - 1 freq nebbiolo (7) - 1 freq bawls (7) - 5 freq noble (7) - 32 freq inbuilt (7) - 2 freq nobil (7) - 1 freq noabil (7) - 1 freq nabob (7) - 1 freq bowled (7) - 1 freq ynbiw (7) - 1 freq bawl (7) - 4 freq 'bowly' (7) - 1 freq nibble (7) - 8 freq nibals (7) - 1 freq bowels (7) - 9 freq bowil (7) - 1 freq nobill (7) - 1 freq |
SoundEx code - N141 newbelfast - 4 freq nbioiwlb - 1 freq |
MetaPhone code - NBLB nbioiwlb - 1 freq |
NBIOIWLB |
| Time to execute Levenshtein function - 0.178091 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.357273 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.028518 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.038722 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.000859 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. |