| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ‘itherÂ’ (0) - 1 freq ‘herÂ’ (2) - 1 freq ‘kerÂ’ (3) - 1 freq itherÂ’s (3) - 1 freq ‘starÂ’ (3) - 1 freq ‘there (3) - 1 freq faitherÂ’s (3) - 6 freq ‘minkerÂ’ (3) - 1 freq ‘henÂ’ (3) - 2 freq mitherÂ’s (3) - 5 freq mithert (4) - 1 freq swithered (4) - 9 freq gaithered (4) - 70 freq neither'd (4) - 1 freq brither (4) - 345 freq laither (4) - 2 freq ither's (4) - 13 freq ‘here (4) - 1 freq hither (4) - 6 freq laithern (4) - 1 freq €™ither (4) - 3 freq ‘heÂ’s (4) - 1 freq gaitherit (4) - 8 freq whither (4) - 134 freq faithers (4) - 85 freq |
‘ither’ (0) - 1 freq ‘her’ (3) - 1 freq ‘there (5) - 1 freq ‘hen’ (5) - 2 freq ‘star’ (5) - 1 freq ‘ker’ (5) - 1 freq ‘shorn’ (6) - 1 freq ‘car’ (6) - 1 freq ‘that’s (6) - 1 freq founther’ (6) - 1 freq mither’s (6) - 5 freq ither’s (6) - 1 freq faither’s (6) - 6 freq ‘minker’ (6) - 1 freq better’ (7) - 1 freq ‘nae’ (7) - 1 freq ‘stump’ (7) - 1 freq ‘e’ (7) - 1 freq ‘right’ (7) - 1 freq ‘it’s (7) - 1 freq ‘state’ (7) - 1 freq her’ (7) - 1 freq ‘cone’ (7) - 2 freq dother’s (7) - 2 freq ‘like’ (7) - 1 freq |
SoundEx code - I360 ither - 3074 freq 'ither - 7 freq ithir - 35 freq idder - 286 freq iturea - 1 freq ituraea - 1 freq iddir - 11 freq i'watter - 5 freq i'door - 1 freq i'ither - 1 freq i'wethir - 1 freq 'ither' - 1 freq idder' - 1 freq €™ither - 3 freq itherwye - 1 freq €˜ither - 3 freq ithrr - 1 freq ‘itherÂ’ - 1 freq ither' - 1 freq |
MetaPhone code - I0R ither - 3074 freq 'ither - 7 freq ithir - 35 freq i'ither - 1 freq 'ither' - 1 freq €™ither - 3 freq €˜ither - 3 freq ithrr - 1 freq ‘itherÂ’ - 1 freq ither' - 1 freq |
‘ITHER’ |
| Time to execute Levenshtein function - 0.190380 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.387051 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.027666 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.043965 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.001118 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. |