| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fowmart (0) - 4 freq foumart (1) - 3 freq format (2) - 37 freq forwart (2) - 4 freq fowrt (2) - 3 freq towart (2) - 54 freq fowert (2) - 10 freq forrart (2) - 3 freq fumart (2) - 1 freq foumarts (2) - 1 freq fulmart (2) - 1 freq €˜fowmart (2) - 1 freq foart (2) - 1 freq formit (3) - 6 freq foment (3) - 2 freq fogarty (3) - 1 freq fowrth (3) - 2 freq thwart (3) - 1 freq sommat (3) - 65 freq atwart (3) - 6 freq smart (3) - 41 freq frawart (3) - 2 freq cowert (3) - 2 freq now-at (3) - 1 freq fower (3) - 697 freq |
fowmart (0) - 4 freq foumart (2) - 3 freq fowert (3) - 10 freq fumart (3) - 1 freq fowrt (3) - 3 freq fulmart (3) - 1 freq foart (4) - 1 freq fowerty (4) - 5 freq fwmre (4) - 1 freq fawkert (4) - 2 freq €˜fowmart (4) - 1 freq format (4) - 37 freq towart (4) - 54 freq forrart (4) - 3 freq foumarts (4) - 1 freq forwart (4) - 4 freq walmart (5) - 1 freq foarty (5) - 1 freq lowert (5) - 1 freq inwart (5) - 1 freq damart (5) - 1 freq powert (5) - 2 freq fower- (5) - 2 freq fowertie (5) - 5 freq founert (5) - 4 freq |
SoundEx code - F563 foonert - 17 freq founert - 4 freq foumart - 3 freq foumartskynnis - 1 freq fowmart - 4 freq foumarts - 1 freq €˜fowmart - 1 freq fumart - 1 freq foonered - 1 freq fooneret - 1 freq founnert - 1 freq funnert - 2 freq feyenoord - 1 freq feenertie - 1 freq foonertness - 1 freq fionaruthbo - 1 freq |
MetaPhone code - FMRT foumart - 3 freq fowmart - 4 freq €˜fowmart - 1 freq fumart - 1 freq |
FOWMART |
| Time to execute Levenshtein function - 0.234266 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.388481 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.039045 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.001011 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. |