| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fifty-three (0) - 7 freq fiftythree (1) - 2 freq forty-three (2) - 1 freq sixty-three (2) - 1 freq eichty-three (3) - 1 freq thirty-three (3) - 2 freq twinty-three (3) - 4 freq ninety-three (3) - 4 freq saxty-three (3) - 2 freq fig-tree (4) - 3 freq fifty-fower (4) - 1 freq twintythree (4) - 1 freq 'forty-three' (4) - 1 freq 'th-three (4) - 1 freq therty-three (4) - 1 freq fifty-five (4) - 4 freq fifty-two (4) - 1 freq fifty-twa (4) - 2 freq fifty-pence (4) - 1 freq twenty-three (4) - 4 freq fir-tree (4) - 3 freq fifty-seeven (5) - 2 freq fifty-sax (5) - 1 freq twa-three (5) - 130 freq fifty-yaird (5) - 1 freq |
fifty-three (0) - 7 freq fiftythree (2) - 2 freq forty-three (3) - 1 freq sixty-three (4) - 1 freq ninety-three (5) - 4 freq saxty-three (5) - 2 freq eichty-three (5) - 1 freq fifty-fower (6) - 1 freq fifty-two (6) - 1 freq fifty-twa (6) - 2 freq thirty-three (6) - 2 freq twinty-three (6) - 4 freq twenty-three (7) - 4 freq fir-tree (7) - 3 freq hauf-three (7) - 1 freq fig-tree (7) - 3 freq aff-there (7) - 1 freq fifty-pence (7) - 1 freq 'th-three (7) - 1 freq therty-three (7) - 1 freq 'forty-three' (7) - 1 freq fifty-five (7) - 4 freq fifty-six (8) - 1 freq oot-throu (8) - 8 freq twaa-three (8) - 1 freq |
SoundEx code - F133 fifty-three - 7 freq fifty-two - 1 freq fufty-heidit - 1 freq fiftiet - 1 freq fiftythree - 2 freq fifty-twa - 2 freq fifty-odd - 1 freq |
MetaPhone code - FFT0R fifty-three - 7 freq fiftythree - 2 freq |
FIFTY-THREE |
| Time to execute Levenshtein function - 0.204162 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.397564 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.027849 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.041324 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.000952 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. |