| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| othir (0) - 1 freq ithir (1) - 35 freq other (1) - 579 freq uthir (1) - 1 freq 'thir (1) - 2 freq thir (1) - 1575 freq outhir (1) - 1 freq vthir (1) - 2 freq thie (2) - 8 freq 'this (2) - 73 freq thig (2) - 3 freq fathir (2) - 11 freq owir (2) - 7 freq thi'r (2) - 1 freq 'thirs (2) - 1 freq othe (2) - 4 freq stuir (2) - 4 freq their (2) - 5115 freq othha (2) - 1 freq stir (2) - 19 freq thirs (2) - 41 freq €™hir (2) - 1 freq teir (2) - 11 freq ithrr (2) - 1 freq thim (2) - 193 freq |
othir (0) - 1 freq outhir (1) - 1 freq uthir (1) - 1 freq thir (1) - 1575 freq other (1) - 579 freq ithir (1) - 35 freq ether (2) - 27 freq thier (2) - 3 freq ather (2) - 3 freq thar (2) - 103 freq ther (2) - 111 freq eethir (2) - 10 freq uther (2) - 9 freq ither (2) - 3074 freq uthur (2) - 1 freq thor (2) - 20 freq thair (2) - 1955 freq thur (2) - 373 freq thiry (2) - 1 freq thyr (2) - 6 freq vthir (2) - 2 freq their (2) - 5115 freq 'thir (2) - 2 freq thaire (3) - 47 freq owther (3) - 5 freq |
SoundEx code - O360 other - 579 freq ooter - 25 freq ootower - 22 freq out-throu - 6 freq oot-throu - 8 freq 'out-throu - 1 freq odder - 1 freq odour - 3 freq outdoor - 7 freq otder - 1 freq otter - 3 freq ootowre - 5 freq 'other - 1 freq oot-thru - 1 freq other' - 2 freq owder - 1 freq odhar - 1 freq outer - 4 freq ootdoor - 8 freq ootthrou - 9 freq owthar - 5 freq oh-tuh-rah - 7 freq outower - 5 freq owider - 1 freq owthor - 11 freq othir - 1 freq outhir - 1 freq owther - 5 freq oot-ower - 1 freq oot-owre - 1 freq 'other' - 1 freq out-ower - 1 freq outowre - 1 freq outdoory - 1 freq €˜other - 1 freq odoir - 3 freq o'their - 1 freq |
MetaPhone code - O0R other - 579 freq 'other - 1 freq other' - 2 freq owthar - 5 freq owthor - 11 freq othir - 1 freq outhir - 1 freq owther - 5 freq 'other' - 1 freq €˜other - 1 freq o'their - 1 freq |
OTHIR |
| Time to execute Levenshtein function - 0.426488 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.745964 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.044861 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.071232 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.001377 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. |