| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uselessfactsfaedavie (0) - 1 freq setisfactorie (11) - 1 freq self-satisfeed (11) - 1 freq self-satisfied (11) - 1 freq tellemstevedave (11) - 3 freq understaandable (12) - 1 freq slesterie (12) - 1 freq uselessness (12) - 1 freq unelected (12) - 1 freq self-sacrifice (12) - 1 freq peterstefanovi (12) - 6 freq unsatisfactorie (12) - 1 freq heles-agowdie (12) - 2 freq self-confidence (12) - 4 freq understandable (12) - 2 freq selective (12) - 4 freq unnerstandable (12) - 1 freq sel-satisfaction (12) - 1 freq selected (12) - 8 freq lenethedane (13) - 4 freq elevated (13) - 2 freq forresacadlib (13) - 1 freq self-causin (13) - 1 freq selectivemutism (13) - 1 freq slowasasnail (13) - 1 freq |
uselessfactsfaedavie (0) - 1 freq self-satisfeed (16) - 1 freq self-satisfied (16) - 1 freq setisfactorie (17) - 1 freq selective (18) - 4 freq selected (18) - 8 freq sel-satisfaction (18) - 1 freq saltsportslive (18) - 46 freq uselessness (18) - 1 freq dissatisfied (18) - 1 freq tellemstevedave (18) - 3 freq unsatisfied (19) - 1 freq self-assured (19) - 1 freq isleseafoods (19) - 1 freq lesser-used (19) - 1 freq clessmates (19) - 1 freq classifaction (19) - 1 freq selfconsait (19) - 1 freq self-sacrifice (19) - 1 freq peterstefanovi (19) - 6 freq unelected (19) - 1 freq slesterie (19) - 1 freq clessification (19) - 2 freq clessified (19) - 3 freq unsatisfactorie (19) - 1 freq |
SoundEx code - U242 uselessness - 1 freq uisless - 6 freq useless - 36 freq ugliest - 1 freq usless - 1 freq uiseless - 4 freq usual''s - 1 freq uissless - 1 freq uglies - 1 freq ukclx - 1 freq uaslkeuonw - 1 freq uclzxd - 1 freq uoacollections - 1 freq uselessfactsfaedavie - 1 freq ujlzla - 1 freq |
MetaPhone code - USLSFKTS |
USELESSFACTSFAEDAVIE |
| Time to execute Levenshtein function - 0.248757 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.433710 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.027314 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.038468 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.000898 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. |