| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| footprints (0) - 6 freq futprints (2) - 1 freq fitprints (2) - 8 freq fuitprints (2) - 1 freq fuitprents (3) - 1 freq footerin (3) - 7 freq fitprents (3) - 1 freq moorings (4) - 1 freq ootrin (4) - 1 freq fosterin (4) - 2 freq imprints (4) - 2 freq blueprints (4) - 1 freq prints (4) - 12 freq ootposts (4) - 1 freq outrings (4) - 1 freq foondries (4) - 2 freq foondrin (4) - 1 freq footbridge (4) - 1 freq florists (4) - 1 freq footert (4) - 3 freq ootlines (4) - 6 freq scotriots (4) - 7 freq ootins (4) - 2 freq doctrines (4) - 2 freq footerie (4) - 3 freq |
footprints (0) - 6 freq futprints (2) - 1 freq fuitprints (2) - 1 freq fitprints (2) - 8 freq fuitprents (3) - 1 freq fitprents (3) - 1 freq fitprent (5) - 1 freq prints (6) - 12 freq blueprints (6) - 1 freq pawprints (6) - 1 freq sprints (6) - 4 freq imprints (6) - 2 freq footerin (6) - 7 freq strunts (7) - 2 freq forderins (7) - 3 freq prents (7) - 10 freq footman's (7) - 1 freq preints (7) - 2 freq furiants (7) - 1 freq strents (7) - 1 freq motorists (7) - 3 freq tyrants (7) - 2 freq foxtrots (7) - 1 freq eftirins (7) - 3 freq footpath (7) - 2 freq |
SoundEx code - F316 fitprints - 8 freq fitivver - 31 freq fitever - 14 freq faut-free - 2 freq fitiver - 65 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.180838 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.357423 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.027213 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.037061 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.000826 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. |