Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
featurin (0) - 8 freq featuring (1) - 4 freq festerin (2) - 5 freq featherin (2) - 2 freq featurt (2) - 1 freq featurs (2) - 14 freq featur (2) - 5 freq featured (2) - 9 freq gesturin (2) - 18 freq venturin (2) - 2 freq feature (2) - 43 freq features (2) - 45 freq featsin (2) - 2 freq measurin (2) - 4 freq fearin (2) - 4 freq lecturin (2) - 3 freq ensurin (3) - 3 freq faerin (3) - 1 freq festenin (3) - 1 freq furin (3) - 1 freq blattrin (3) - 1 freq capturin (3) - 1 freq hearin (3) - 174 freq letterin (3) - 6 freq hectorin (3) - 1 freq |
featurin (0) - 8 freq featuring (2) - 4 freq featsin (3) - 2 freq feature (3) - 43 freq footerin (3) - 8 freq fouterin (3) - 6 freq fearin (3) - 4 freq features (3) - 45 freq festerin (3) - 5 freq featurt (3) - 1 freq featherin (3) - 2 freq featurs (3) - 14 freq featur (3) - 5 freq featured (3) - 9 freq flairin (4) - 2 freq fettin (4) - 1 freq favourin (4) - 1 freq caterin (4) - 4 freq retirin (4) - 10 freq saturn (4) - 8 freq feytin (4) - 1 freq return (4) - 132 freq flarin (4) - 3 freq filterin (4) - 3 freq etterin (4) - 1 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 - FTRN fouterin - 6 freq footerin - 8 freq veteran - 4 freq featurin - 8 freq vettriano - 1 freq 'footerin' - 1 freq |
FEATURIN |
Time to execute Levenshtein function - 0.205728 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.378774 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.029854 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.041687 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.000959 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. |