| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| irksome (0) - 4 freq mirksome (1) - 3 freq iresome (1) - 1 freq virrsome (2) - 6 freq tiresome (2) - 6 freq derksome (2) - 2 freq 'some (3) - 10 freq €˜some (3) - 5 freq leasome (3) - 1 freq loosome (3) - 2 freq bowsome (3) - 1 freq awsome (3) - 2 freq twasome (3) - 1 freq loesome (3) - 7 freq ransome (3) - 1 freq fredome (3) - 1 freq rome (3) - 35 freq insole (3) - 1 freq resume (3) - 6 freq mirksome's (3) - 1 freq hertsome (3) - 10 freq aesome (3) - 7 freq lousome (3) - 3 freq luesome (3) - 2 freq crusoe (3) - 3 freq |
irksome (0) - 4 freq iresome (2) - 1 freq mirksome (2) - 3 freq derksome (3) - 2 freq resume (4) - 6 freq irks (4) - 1 freq oorisome (4) - 1 freq daurksome (4) - 1 freq virrsome (4) - 6 freq tiresome (4) - 6 freq ransome (4) - 1 freq winsome (5) - 5 freq leesome (5) - 9 freq erldome (5) - 2 freq rhome (5) - 4 freq oÂ’some (5) - 1 freq fecksome (5) - 1 freq dinsome (5) - 3 freq fousome (5) - 17 freq fulsome (5) - 1 freq i'same (5) - 10 freq hairtsome (5) - 5 freq rkos (5) - 1 freq honksome (5) - 1 freq rasmie (5) - 10 freq |
SoundEx code - I625 irksome - 4 freq irreconcilable - 1 freq irishman - 6 freq iresome - 1 freq irishness - 1 freq irishmen - 1 freq |
MetaPhone code - IRKSM irksome - 4 freq |
IRKSOME |
| Time to execute Levenshtein function - 0.231983 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.361778 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.027276 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.042365 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.001074 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. |