| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ihor (0) - 1 freq ior (1) - 1 freq ihon (1) - 2 freq whor (1) - 1 freq iho (1) - 1 freq igor (1) - 6 freq ivor (1) - 19 freq ichor (1) - 1 freq thor (1) - 20 freq whom (2) - 17 freq idol (2) - 12 freq choo (2) - 3 freq shop (2) - 369 freq 'ho- (2) - 2 freq thorn (2) - 9 freq choir (2) - 14 freq ifo (2) - 1 freq yor (2) - 4 freq rhar (2) - 1 freq horn (2) - 57 freq 'hoo (2) - 79 freq shoar (2) - 4 freq thoa (2) - 4 freq whir (2) - 11 freq 'or (2) - 22 freq |
ihor (0) - 1 freq hoor (2) - 62 freq her (2) - 14018 freq hoar (2) - 4 freq hr (2) - 11 freq har (2) - 8 freq hour (2) - 132 freq ohr (2) - 1 freq oihyr (2) - 1 freq ihre (2) - 1 freq hur (2) - 787 freq hir (2) - 1279 freq igor (2) - 6 freq ihere (2) - 6 freq thor (2) - 20 freq iho (2) - 1 freq ahr (2) - 1 freq whor (2) - 1 freq ior (2) - 1 freq ihon (2) - 2 freq ivor (2) - 19 freq ichor (2) - 1 freq hire (3) - 12 freq thoor (3) - 11 freq hzr (3) - 1 freq |
SoundEx code - I600 ir - 1540 freq irae - 1 freq 'ir - 11 freq ire - 9 freq iry - 1 freq ihere - 6 freq ihor - 1 freq ira - 7 freq ir' - 4 freq iwer - 4 freq æir - 1 freq i'air - 7 freq i'war - 1 freq Ÿiyor - 1 freq ihre - 1 freq €™ir - 5 freq Éire - 2 freq €œir - 2 freq €˜irie - 1 freq €˜ir - 1 freq irr - 2 freq irw - 1 freq ier - 1 freq iar - 2 freq iri - 1 freq irh - 1 freq ior - 1 freq |
MetaPhone code - IHR ihere - 6 freq ihor - 1 freq |
IHOR |
| Time to execute Levenshtein function - 0.170568 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.365920 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.046260 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.036324 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.000810 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. |