| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| footnote (0) - 1 freq footnotes (1) - 1 freq fortnite (2) - 2 freq fitnote (2) - 2 freq footert (3) - 3 freq foothie (3) - 3 freq foothold (3) - 2 freq footage (3) - 13 freq dootsome (3) - 1 freq fitnot (3) - 1 freq foont (3) - 2 freq ootsite (3) - 1 freq fortnat (3) - 1 freq foxtrot (3) - 2 freq ootgate (3) - 1 freq fortunate (3) - 9 freq ootcome (3) - 48 freq fuitnotes (3) - 1 freq fooste (3) - 1 freq footerie (3) - 3 freq foxtrots (3) - 1 freq fortrose (3) - 2 freq footie (3) - 2 freq footpath (3) - 2 freq fitnotes (3) - 2 freq |
footnote (0) - 1 freq fitnote (2) - 2 freq footnotes (2) - 1 freq fortnite (3) - 2 freq fitnot (3) - 1 freq fitnotes (4) - 2 freq foont (4) - 2 freq fortunate (4) - 9 freq fortnat (4) - 1 freq fuitnotes (4) - 1 freq footert (4) - 3 freq finite (5) - 3 freq fozent (5) - 2 freq fottie (5) - 1 freq front (5) - 757 freq foment (5) - 2 freq footan (5) - 1 freq fount (5) - 2 freq founnit (5) - 3 freq toonty (5) - 2 freq fronty (5) - 6 freq footeen (5) - 1 freq footin (5) - 1 freq fortunat (5) - 1 freq footie (5) - 2 freq |
SoundEx code - F353 fattened - 2 freq fat-end - 1 freq fit-dunt - 1 freq fuitnotes - 1 freq footnote - 1 freq fitnotes - 2 freq fitnote - 2 freq fitnot - 1 freq footnotes - 1 freq foodanddrinksco - 1 freq |
MetaPhone code - FTNT fattened - 2 freq fat-end - 1 freq footnote - 1 freq fitnote - 2 freq fitnot - 1 freq vadundee - 1 freq |
FOOTNOTE |
| Time to execute Levenshtein function - 0.194625 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.389023 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.027996 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.038611 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.000921 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. |