| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| itchy-coo (0) - 2 freq itchycoo (1) - 1 freq itchycoos (2) - 1 freq €˜itchy-coo (2) - 1 freq itchycoo's (3) - 1 freq witchypoo (3) - 1 freq witchiepoo (4) - 1 freq itchy (4) - 36 freq atchoo (4) - 1 freq cha-too (4) - 2 freq hitchcock (5) - 1 freq richt-oot (5) - 3 freq ithaca (5) - 2 freq c-cou (5) - 1 freq itchin (5) - 11 freq hech-how (5) - 1 freq ichor (5) - 1 freq itch (5) - 5 freq itchit (5) - 1 freq styoo (5) - 1 freq chico (5) - 5 freq aitchison (5) - 1 freq with-oot (5) - 1 freq atchoooh (5) - 1 freq inchcolm (5) - 3 freq |
itchy-coo (0) - 2 freq itchycoo (2) - 1 freq €˜itchy-coo (4) - 1 freq itchycoos (4) - 1 freq itchy (6) - 36 freq cha-too (6) - 2 freq atchoo (6) - 1 freq witchypoo (6) - 1 freq itchycoo's (6) - 1 freq chico (7) - 5 freq atchoooh (7) - 1 freq aitchison (7) - 1 freq itched (7) - 1 freq tycho (7) - 2 freq itchit (7) - 1 freq chyce (7) - 51 freq chu-ko (7) - 3 freq the-nou (7) - 4 freq tchocky (7) - 6 freq witchiepoo (7) - 1 freq ithaca (7) - 2 freq itchin (7) - 11 freq c-cou (7) - 1 freq itch (7) - 5 freq eitches (8) - 1 freq |
SoundEx code - I322 idiocies - 1 freq i'duke's - 4 freq i'duchess - 1 freq itchy-coo - 2 freq €˜itchy-coo - 1 freq itchycoos - 1 freq itchycoo - 1 freq itsagoinwrang - 1 freq itchycoo's - 1 freq |
MetaPhone code - IXK itchy-coo - 2 freq €˜itchy-coo - 1 freq itchycoo - 1 freq |
ITCHY-COO |
| Time to execute Levenshtein function - 0.298543 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.579239 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.027071 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.037291 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.000817 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. |