| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| steurer (0) - 1 freq steerer (1) - 2 freq steerers (2) - 1 freq stirrer (2) - 2 freq sterr (2) - 11 freq sture (2) - 6 freq stouer (2) - 1 freq steeker (2) - 1 freq steyer (2) - 3 freq storer (2) - 1 freq steered (2) - 39 freq stumer (2) - 3 freq staumer (2) - 5 freq steeren (2) - 2 freq steired (2) - 4 freq steiver (2) - 1 freq speirer (2) - 2 freq sterred (2) - 1 freq seerer (2) - 1 freq sterner (2) - 1 freq sterter (2) - 2 freq shearer (2) - 4 freq steeper (2) - 1 freq stere (2) - 1 freq stoured (2) - 4 freq |
steurer (0) - 1 freq steerer (1) - 2 freq storer (2) - 1 freq sterr (2) - 11 freq steeper (3) - 1 freq sterred (3) - 1 freq sterter (3) - 2 freq sterner (3) - 1 freq seerer (3) - 1 freq stoured (3) - 4 freq stereo (3) - 7 freq struner (3) - 3 freq steer (3) - 118 freq steamer (3) - 6 freq speirer (3) - 2 freq stere (3) - 1 freq shearer (3) - 4 freq stouer (3) - 1 freq steeker (3) - 1 freq stirrer (3) - 2 freq steiver (3) - 1 freq steerers (3) - 1 freq steyer (3) - 3 freq sture (3) - 6 freq steered (3) - 39 freq |
SoundEx code - S366 steerer - 2 freq storrar - 1 freq storeruim - 1 freq storeroom - 3 freq steurer - 1 freq steerers - 1 freq stoorworm - 2 freq scutterer - 1 freq storer - 1 freq stirrer - 2 freq |
MetaPhone code - STRR steerer - 2 freq storrar - 1 freq steurer - 1 freq storer - 1 freq stirrer - 2 freq |
STEURER |
| Time to execute Levenshtein function - 0.203795 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.376007 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.027181 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.037232 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.000910 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. |