| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ither-bill (0) - 1 freq ithers'll (3) - 1 freq ither'll (3) - 1 freq itherwhiles (4) - 2 freq then-bit (4) - 1 freq peter-uill (4) - 1 freq theretil (4) - 3 freq ithergaits (4) - 9 freq nethermill (4) - 1 freq thornhill (4) - 4 freq them-all (4) - 1 freq ither-weys (4) - 1 freq tither'll (4) - 1 freq itherwice (4) - 2 freq hithertil (4) - 1 freq mither'll (4) - 1 freq itherwarld (4) - 3 freq itherworld (4) - 1 freq ithergait (4) - 1 freq itherwise (4) - 61 freq mither-side (4) - 1 freq thrill (4) - 18 freq they-well (4) - 1 freq there'll (4) - 63 freq hyper-birl (4) - 2 freq |
ither-bill (0) - 1 freq ither'll (5) - 1 freq ithers'll (5) - 1 freq therell (6) - 1 freq thornhill (6) - 4 freq there'll (6) - 63 freq thrill (6) - 18 freq they-well (6) - 1 freq them-all (6) - 1 freq thurible (7) - 2 freq hert-ill (7) - 1 freq hyper-birl (7) - 2 freq hard-ball (7) - 1 freq 'there'll (7) - 1 freq thur'll (7) - 3 freq thirablo (7) - 1 freq thor'll (7) - 1 freq thir'll (7) - 5 freq thare'll (7) - 2 freq turnbull (7) - 9 freq door-bell (7) - 1 freq truebill (7) - 2 freq harebell (7) - 3 freq thrall (7) - 4 freq mither'll (7) - 1 freq |
SoundEx code - I361 idder'-but - 1 freq i'drive - 1 freq ither-bill - 1 freq |
MetaPhone code - I0RBL ither-bill - 1 freq |
ITHER-BILL |
| Time to execute Levenshtein function - 0.244829 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.451029 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.031948 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.038106 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.001098 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. |