Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
fifteenth (0) - 17 freq fifteent (1) - 3 freq fifteen (2) - 103 freq bpifteenth (2) - 1 freq sixteenth (2) - 9 freq fowrteenth (3) - 1 freq fiftiet (3) - 1 freq umpteenth (3) - 9 freq saxteenth (3) - 6 freq nineteenth (3) - 13 freq fiftein (3) - 1 freq sixteent (3) - 3 freq f-teeth (3) - 1 freq umteenth (3) - 2 freq fifteeen (3) - 1 freq forteent (3) - 2 freq eichteenth (3) - 3 freq fiftene (3) - 1 freq fiteech (3) - 1 freq echteenth (3) - 7 freq thirteenth (3) - 2 freq fitteen (3) - 1 freq fourteenth (3) - 6 freq fufteen (3) - 5 freq aichteenth (3) - 1 freq |
fifteenth (0) - 17 freq fifteent (2) - 3 freq fourteenth (4) - 6 freq sixteenth (4) - 9 freq fifteen (4) - 103 freq bpifteenth (4) - 1 freq eichteenth (5) - 3 freq forteent (5) - 2 freq fiftene (5) - 1 freq fufteen (5) - 5 freq aichteenth (5) - 1 freq fifteeen (5) - 1 freq echteenth (5) - 7 freq umteenth (5) - 2 freq umpteenth (5) - 9 freq fiftiet (5) - 1 freq fowrteenth (5) - 1 freq nineteenth (5) - 13 freq saxteenth (5) - 6 freq fiftein (5) - 1 freq f-teeth (5) - 1 freq festent (6) - 1 freq fu-lenth (6) - 1 freq fifth (6) - 29 freq saftent (6) - 3 freq |
SoundEx code - F135 fifteen - 103 freq fifteenth - 17 freq fufteen - 5 freq five-tae-nine - 1 freq fiefdom - 1 freq fifedom - 1 freq fifteen-yir-auld - 1 freq fifteent - 3 freq 'fiftene - 2 freq fiftene - 1 freq fiftein - 1 freq fifteeen - 1 freq fifteen-year-auld - 2 freq |
MetaPhone code - FFTN0 fifteenth - 17 freq |
FIFTEENTH |
Time to execute Levenshtein function - 0.237638 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.365799 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.027307 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.037708 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.000942 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. |