Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
fower-toed (0) - 1 freq fower-some (3) - 1 freq fower-oor (3) - 1 freq fowerties (3) - 1 freq fowertie (3) - 5 freq fowerteen (3) - 46 freq owerstep (4) - 1 freq owertook (4) - 2 freq owergied (4) - 1 freq fower-year (4) - 2 freq owerheed (4) - 1 freq owerfaced (4) - 1 freq jowered (4) - 1 freq towered (4) - 1 freq fowert (4) - 10 freq ower-prood (4) - 1 freq flouer-bed (4) - 1 freq powered (4) - 2 freq owertones (4) - 1 freq ower-steer (4) - 1 freq fowersome (4) - 2 freq fower- (4) - 2 freq fowreteen (4) - 1 freq 'fowerteen (4) - 2 freq owerflowed (4) - 1 freq |
fower-toed (0) - 1 freq fowerteen (5) - 46 freq fowerties (5) - 1 freq fowertie (5) - 5 freq fower-some (5) - 1 freq fower-oor (5) - 1 freq flouer-bed (6) - 1 freq fower-leaved (6) - 2 freq four-eyed (6) - 1 freq fowreteen (6) - 1 freq fowert (6) - 10 freq fower- (6) - 2 freq fowerty (6) - 5 freq fower-leafed (6) - 1 freq fowerth (6) - 6 freq fower-fit (6) - 1 freq ower-time (6) - 1 freq ower-heid (6) - 2 freq fower-year (6) - 2 freq federated (6) - 1 freq lowered (7) - 25 freq owerword (7) - 1 freq fowerteent (7) - 2 freq forhooed (7) - 1 freq ower-sized (7) - 1 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 - FWRTT fower-toed - 1 freq |
FOWER-TOED |
Time to execute Levenshtein function - 0.264678 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.449855 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.065069 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.037395 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.000906 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. |