Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
irsels (0) - 1 freq wirsels (1) - 80 freq hirsels (1) - 3 freq birsels (1) - 1 freq yirsels (1) - 6 freq irsel (1) - 2 freq reels (2) - 21 freq hirsell (2) - 13 freq ainsels (2) - 1 freq yirsell (2) - 1 freq emsels (2) - 4 freq hirselt (2) - 1 freq corsels (2) - 1 freq ersel (2) - 36 freq imsel (2) - 29 freq yeirsels (2) - 1 freq itsell (2) - 16 freq oursels (2) - 3 freq itsel' (2) - 3 freq wirsells (2) - 2 freq airses (2) - 3 freq hirsel (2) - 119 freq wersels (2) - 1 freq yursels (2) - 1 freq morsels (2) - 4 freq |
irsels (0) - 1 freq yirsels (1) - 6 freq eersels (2) - 1 freq yursels (2) - 1 freq oursels (2) - 3 freq yeirsels (2) - 1 freq wirsels (2) - 80 freq oorsels (2) - 141 freq irsel (2) - 2 freq yersels (2) - 97 freq birsels (2) - 1 freq hirsels (2) - 3 freq wursels (3) - 7 freq morsels (3) - 4 freq wirsaels (3) - 1 freq yirself (3) - 5 freq sels (3) - 7 freq erses (3) - 23 freq oorseels (3) - 2 freq yaersels (3) - 1 freq irises (3) - 1 freq arses (3) - 7 freq yirsel (3) - 89 freq ursel (3) - 2 freq yirsell (3) - 1 freq |
SoundEx code - I624 irishly - 1 freq ir-sel - 2 freq irsel - 2 freq irregular - 10 freq irreglar - 7 freq irraiglar - 4 freq irsels - 1 freq irsgldm - 1 freq irishland - 1 freq |
MetaPhone code - IRSLS irsels - 1 freq |
IRSELS |
Time to execute Levenshtein function - 0.561853 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.887541 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.030990 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.090598 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.001004 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. |