| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fifteent (0) - 3 freq fifteen (1) - 103 freq fifteenth (1) - 17 freq fiftiet (2) - 1 freq fiftein (2) - 1 freq forteent (2) - 2 freq fifteeen (2) - 1 freq sixteent (2) - 3 freq fiftene (2) - 1 freq fufteen (2) - 5 freq fitteen (2) - 1 freq kisteen (3) - 1 freq fitten (3) - 22 freq forteen (3) - 3 freq flattent (3) - 1 freq saxteent (3) - 4 freq listent (3) - 10 freq fitest (3) - 1 freq fisheen (3) - 6 freq fowrteent (3) - 1 freq fittet (3) - 3 freq dif'rent (3) - 1 freq eighteent (3) - 1 freq flettent (3) - 6 freq echteent (3) - 7 freq |
fifteent (0) - 3 freq fifteenth (2) - 17 freq fifteen (2) - 103 freq fiftene (3) - 1 freq fufteen (3) - 5 freq fifteeen (3) - 1 freq forteent (3) - 2 freq fiftiet (3) - 1 freq fiftein (3) - 1 freq saftent (4) - 3 freq festent (4) - 1 freq fitteen (4) - 1 freq sixteent (4) - 3 freq fittret (5) - 1 freq mittent (5) - 1 freq firnent (5) - 1 freq footeen (5) - 1 freq fient (5) - 6 freq fittert (5) - 1 freq intent (5) - 37 freq 'fiftene (5) - 2 freq figment (5) - 1 freq filament (5) - 2 freq fitnot (5) - 1 freq effluent (5) - 1 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 - FFTNT fifteent - 3 freq |
FIFTEENT |
| Time to execute Levenshtein function - 0.589632 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 - 1.398536 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.101024 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.104847 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.000855 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. |