| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fowertie-twa (0) - 1 freq fowerty-twa (2) - 1 freq fowerteent (4) - 2 freq fowerteenth (4) - 2 freq fowertie (4) - 5 freq forty-twa (4) - 2 freq fowertie-thrie (4) - 1 freq fowerties (4) - 1 freq fowerteen (5) - 46 freq forty-twae (5) - 2 freq ower-the-tap (5) - 1 freq owerview (5) - 10 freq fower-letter (5) - 1 freq fowrteent (5) - 1 freq fortiet (5) - 2 freq therty-twa (5) - 1 freq forty-two (5) - 4 freq twenty-twa (5) - 4 freq fortieth (5) - 1 freq fowrteenth (5) - 1 freq owersettar (6) - 1 freq foretelt (6) - 4 freq owertaen (6) - 2 freq owernight (6) - 2 freq foartie (6) - 5 freq |
fowertie-twa (0) - 1 freq fowerty-twa (2) - 1 freq forty-twa (5) - 2 freq forty-twae (6) - 2 freq fowerteent (6) - 2 freq forty-two (6) - 4 freq fowertie-thrie (6) - 1 freq fowerteenth (6) - 2 freq fowrteenth (7) - 1 freq fowrteent (7) - 1 freq twenty-twa (7) - 4 freq therty-twa (7) - 1 freq fowertie (7) - 5 freq fowerties (7) - 1 freq fower-toed (8) - 1 freq twenty-two (8) - 4 freq thirty-twa (8) - 1 freq fortieth (8) - 1 freq fortiet (8) - 2 freq fifty-twa (8) - 2 freq fowerteen (8) - 46 freq fower-fit (9) - 1 freq fowerty (9) - 5 freq fower-oor (9) - 1 freq forteent (9) - 2 freq |
SoundEx code - F633 forty-two - 4 freq forty-twae - 2 freq feartit - 1 freq frithat - 7 freq fortuitous - 2 freq 'forty-three' - 1 freq fortitude - 3 freq frettit - 1 freq frothed - 4 freq fowertie-thrie - 1 freq fowertie-twa - 1 freq farted - 3 freq fowerty-twa - 1 freq fartet - 2 freq fortiet - 2 freq furthettins - 1 freq fair-heidit - 2 freq fairdit - 1 freq fower-toed - 1 freq fretted - 1 freq forty-odd - 1 freq forty-twa - 2 freq fortieth - 1 freq fortuitously - 1 freq forty-three - 1 freq |
MetaPhone code - FWRTTW fowertie-twa - 1 freq fowerty-twa - 1 freq |
FOWERTIE-TWA |
| Time to execute Levenshtein function - 0.216830 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.422672 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.028658 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.038395 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.001027 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. |