Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
qualifeed (0) - 1 freq qualifee (1) - 2 freq qualified (1) - 13 freq quaicked (3) - 7 freq qualitie (3) - 12 freq qualify (3) - 4 freq qualiefy (3) - 1 freq qualifyin (3) - 2 freq qualities (3) - 9 freq uplifted (3) - 3 freq mummifeed (3) - 1 freq anglifeed (3) - 1 freq specifeed (4) - 1 freq classifeed (4) - 1 freq life'd (4) - 1 freq culfed (4) - 4 freq pacified (4) - 1 freq quited (4) - 1 freq squalid (4) - 1 freq glorifeed (4) - 1 freq quaiter (4) - 4 freq bullied (4) - 15 freq realised (4) - 165 freq outlined (4) - 1 freq gliffed (4) - 3 freq |
qualifeed (0) - 1 freq qualified (1) - 13 freq qualifee (2) - 2 freq qualify (4) - 4 freq qualifyin (4) - 2 freq qualiefy (4) - 1 freq culfed (5) - 4 freq quilted (5) - 1 freq anglifeed (5) - 1 freq qualities (5) - 9 freq quaicked (5) - 7 freq uplifted (5) - 3 freq qualitie (5) - 12 freq satefeed (6) - 11 freq qualifying (6) - 1 freq quivered (6) - 2 freq ruifed (6) - 1 freq queried (6) - 4 freq wolfed (6) - 5 freq unified (6) - 3 freq quatened (6) - 2 freq quality (6) - 134 freq realized (6) - 15 freq quizzed (6) - 1 freq quavered (6) - 2 freq |
SoundEx code - Q413 qualified - 13 freq qualifeed - 1 freq |
MetaPhone code - KLFT gloved - 4 freq qualified - 13 freq gliffed - 3 freq cleft - 5 freq qualifeed - 1 freq gluffed - 10 freq gleeved - 1 freq culfed - 4 freq caliphate - 1 freq cleaved - 2 freq claught - 49 freq clift - 3 freq glivved - 1 freq glufft - 2 freq gluffit - 1 freq calved - 1 freq glovit - 1 freq cleavit - 1 freq |
QUALIFEED |
Time to execute Levenshtein function - 0.202785 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.369278 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.027238 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.061910 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.000831 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. |