| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| faitherin (0) - 1 freq gaitherin (1) - 100 freq faitherit (1) - 1 freq fritterin (2) - 1 freq witherin (2) - 4 freq smitherin (2) - 1 freq gaitherins (2) - 13 freq batherin (2) - 5 freq githerin (2) - 2 freq gaithrin (2) - 2 freq featherin (2) - 2 freq faithers' (2) - 5 freq faither's (2) - 150 freq gaitherie (2) - 2 freq flicherin (2) - 1 freq slitherin (2) - 2 freq ficherin (2) - 6 freq furtherin (2) - 1 freq faithered (2) - 3 freq gaitherin' (2) - 1 freq faithers (2) - 85 freq flitterin (2) - 2 freq gaitheran (2) - 2 freq faither (2) - 1391 freq paitterin (2) - 2 freq |
faitherin (0) - 1 freq gaitherin (2) - 100 freq faitherit (2) - 1 freq featherin (2) - 2 freq gatherin (3) - 9 freq nitherin (3) - 3 freq ficherin (3) - 6 freq faithered (3) - 3 freq gaitheran (3) - 2 freq gaitheren (3) - 8 freq faithers (3) - 85 freq faither' (3) - 5 freq furtherin (3) - 1 freq faither (3) - 1391 freq laithern (3) - 1 freq witherin (3) - 4 freq watherin (3) - 1 freq mitherin (3) - 7 freq faitherly (3) - 1 freq gaithrin (3) - 2 freq githerin (3) - 2 freq batherin (3) - 5 freq ficheren (4) - 1 freq botherin (4) - 13 freq fither (4) - 12 freq |
SoundEx code - F365 fouterin - 6 freq footerin - 8 freq featherin - 2 freq faither-in-law - 2 freq futhermair - 2 freq fathermurphyforpope - 1 freq featurin - 8 freq featuring - 4 freq fither-in-law - 1 freq 'footerin' - 1 freq faitherin - 1 freq fetternear - 1 freq |
MetaPhone code - F0RN featherin - 2 freq faitherin - 1 freq |
FAITHERIN |
| Time to execute Levenshtein function - 0.206389 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.385824 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.027720 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.040001 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.000987 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. |