| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| footprints (0) - 6 freq fitprints (2) - 8 freq fuitprints (2) - 1 freq futprints (2) - 1 freq fuitprents (3) - 1 freq fitprents (3) - 1 freq footerin (3) - 8 freq sprints (4) - 4 freq ootpit (4) - 28 freq imprints (4) - 2 freq moorings (4) - 1 freq fosterin (4) - 2 freq ootins (4) - 2 freq moothins (4) - 1 freq footert (4) - 3 freq fontaines (4) - 1 freq foontains (4) - 7 freq footman's (4) - 1 freq ootlings (4) - 1 freq ootposts (4) - 1 freq forerins (4) - 1 freq ootshines (4) - 1 freq ootlins (4) - 3 freq foothills (4) - 1 freq pawprints (4) - 1 freq |
footprints (0) - 6 freq futprints (2) - 1 freq fuitprints (2) - 1 freq fitprints (2) - 8 freq fitprents (3) - 1 freq fuitprents (3) - 1 freq fitprent (5) - 1 freq pawprints (6) - 1 freq blueprints (6) - 1 freq sprints (6) - 4 freq footerin (6) - 8 freq prints (6) - 13 freq imprints (6) - 2 freq forderins (7) - 3 freq tyrants (7) - 3 freq footpath (7) - 2 freq fouterin (7) - 6 freq preints (7) - 2 freq outrings (7) - 1 freq florists (7) - 1 freq motorists (7) - 3 freq forrits (7) - 17 freq strents (7) - 1 freq futrets (7) - 2 freq footnotes (7) - 1 freq |
SoundEx code - F316 fitprints - 8 freq fitivver - 31 freq fitever - 14 freq faut-free - 2 freq fitiver - 66 freq fit-ivver's - 1 freq 'fitivver - 1 freq fitprents - 1 freq fuitprents - 1 freq fittiver - 4 freq fitbrig - 1 freq footprints - 6 freq fitprent - 1 freq futprints - 1 freq €˜fativer - 1 freq fativer - 1 freq fuitprints - 1 freq fitiver's - 1 freq fitivir - 2 freq footbridge - 1 freq fit-for-fit - 1 freq fittivir - 1 freq fittiebar - 10 freq fittiebariscalling - 1 freq fittiebarchunty - 1 freq fedupboredstiff - 10 freq |
MetaPhone code - FTPRNTS fitprints - 8 freq fitprents - 1 freq fuitprents - 1 freq footprints - 6 freq futprints - 1 freq fuitprints - 1 freq |
FOOTPRINTS |
| Time to execute Levenshtein function - 0.191305 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.377647 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.027563 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.037261 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.000935 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. |