| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yuiseless (0) - 2 freq uiseless (1) - 4 freq uisless (2) - 6 freq yaisless (2) - 1 freq noiseless (2) - 1 freq yisless (2) - 3 freq muiveless (2) - 1 freq uissless (2) - 1 freq useless (2) - 36 freq muinless (3) - 4 freq haiveless (3) - 1 freq tuneless (3) - 2 freq timeless (3) - 5 freq listless (3) - 1 freq menseless (3) - 9 freq lifeless (3) - 7 freq ruitless (3) - 2 freq ruifless (3) - 2 freq guiltless (3) - 1 freq rueless (3) - 1 freq voiceless (3) - 19 freq tuithless (3) - 2 freq gisless (3) - 1 freq guiless (3) - 1 freq senseless (3) - 3 freq |
yuiseless (0) - 2 freq uiseless (1) - 4 freq yisless (2) - 3 freq yaisless (2) - 1 freq uisless (2) - 6 freq useless (2) - 36 freq usless (3) - 1 freq eeseless (3) - 6 freq noiseless (3) - 1 freq uissless (3) - 1 freq gisless (4) - 1 freq hooseless (4) - 1 freq muiveless (4) - 1 freq sealess (4) - 1 freq guiless (4) - 1 freq rueless (4) - 1 freq yisses (5) - 2 freq airless (5) - 1 freq daeless (5) - 4 freq yursels (5) - 1 freq ageless (5) - 5 freq gisliss (5) - 1 freq eyeless (5) - 1 freq shoeless (5) - 1 freq saikless (5) - 7 freq |
SoundEx code - Y242 yisless - 3 freq yokels - 1 freq yokel's - 1 freq yuiseless - 2 freq yaisless - 1 freq yackles - 1 freq yxlqmyclic - 1 freq ygluegqb - 1 freq yqlhc - 1 freq |
MetaPhone code - YSLS yisless - 3 freq yuiseless - 2 freq yaisless - 1 freq |
YUISELESS |
| Time to execute Levenshtein function - 0.208544 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.361635 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.036707 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.038978 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.000855 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. |