| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| beautifu (0) - 16 freq beautify (1) - 4 freq beauti-fu (1) - 1 freq beautiful (1) - 128 freq beautyfu (1) - 1 freq beauti-ful (2) - 3 freq besutiful (2) - 1 freq beautie (2) - 3 freq beauties (2) - 9 freq brautiful (2) - 1 freq 'beautiful (2) - 2 freq beauty's (3) - 2 freq beattie (3) - 6 freq beautifully (3) - 3 freq beastis (3) - 1 freq beatties (3) - 1 freq beatin (3) - 33 freq peitifu (3) - 1 freq beatific (3) - 2 freq beauteous (3) - 3 freq beatit (3) - 1 freq beating (3) - 7 freq beatins (3) - 3 freq beau-ootifu (3) - 4 freq beauty (3) - 125 freq |
beautifu (0) - 16 freq beautify (1) - 4 freq beautyfu (1) - 1 freq beautiful (2) - 128 freq beauti-fu (2) - 1 freq butif (3) - 1 freq beauties (3) - 9 freq beautie (3) - 3 freq beatit (4) - 1 freq beauteous (4) - 3 freq beatific (4) - 2 freq beau-ootifu (4) - 4 freq beauty (4) - 125 freq boontifu (4) - 1 freq peetifu (4) - 3 freq peitifu (4) - 1 freq beaut (4) - 5 freq 'beautiful (4) - 2 freq beattie (4) - 6 freq brautiful (4) - 1 freq beatin (4) - 33 freq besutiful (4) - 1 freq beauti-ful (4) - 3 freq batin (5) - 4 freq beatty (5) - 1 freq |
SoundEx code - B310 by-the-by - 1 freq beautify - 4 freq beautifu - 16 freq bidef - 1 freq 'beautify' - 1 freq beau-ootifu - 4 freq beauti-fu - 1 freq butif - 1 freq beautyfu - 1 freq bdp - 1 freq bootbhoy - 2 freq btv - 1 freq baadp - 1 freq btp - 1 freq btf - 8 freq |
MetaPhone code - BTF beautify - 4 freq beautifu - 16 freq bidef - 1 freq 'beautify' - 1 freq beau-ootifu - 4 freq beauti-fu - 1 freq butif - 1 freq beautyfu - 1 freq btv - 1 freq btf - 8 freq |
BEAUTIFU |
| Time to execute Levenshtein function - 0.208390 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.354921 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.026954 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.038391 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.000779 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. |