| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sorcerer (0) - 1 freq sorcerer' (1) - 1 freq sorcerer's (2) - 1 freq sorcery (2) - 1 freq forderer (2) - 2 freq sorrel (3) - 1 freq loiterer (3) - 1 freq horrer (3) - 1 freq borderers (3) - 4 freq sorners (3) - 2 freq forever (3) - 72 freq orrer (3) - 1 freq sor-ree (3) - 2 freq ordered (3) - 64 freq scriever (3) - 60 freq skreever (3) - 4 freq scorer (3) - 3 freq scorcher (3) - 4 freq sobered (3) - 1 freq sufferer (3) - 1 freq tortered (3) - 1 freq fore'er (3) - 1 freq fordered (3) - 22 freq sorner (3) - 3 freq soberen (3) - 1 freq |
sorcerer (0) - 1 freq sorcerer' (2) - 1 freq sorcery (3) - 1 freq scorer (4) - 3 freq forderer (4) - 2 freq sorcerer's (4) - 1 freq seerer (5) - 1 freq scorcher (5) - 4 freq sufferer (5) - 1 freq sorner (5) - 3 freq murderer (5) - 15 freq soccer (5) - 4 freq steerer (5) - 2 freq scarier (5) - 1 freq sor-ree (5) - 2 freq sorners (5) - 2 freq sincere (5) - 13 freq sorrel (5) - 1 freq scriever (5) - 60 freq orrer (5) - 1 freq sairrer (5) - 1 freq screever (5) - 1 freq horrer (5) - 1 freq narrer (6) - 2 freq horrur (6) - 2 freq |
SoundEx code - S626 sorcerer' - 1 freq sorcerer's - 1 freq scourger - 2 freq surgery - 29 freq scarecrow - 5 freq scorcher - 4 freq scroag-airch't - 1 freq shargered - 1 freq sorcery - 1 freq scarecraw - 3 freq schwarzer - 1 freq surgeries - 1 freq scorecard - 3 freq surchargit - 1 freq sharger - 1 freq shargeret - 8 freq surcharge - 1 freq sorcerer - 1 freq screechyer - 1 freq sarasheridan - 11 freq scoresjournal - 3 freq shergar - 1 freq |
MetaPhone code - SRSRR sorcerer' - 1 freq sorcerer - 1 freq |
SORCERER |
| Time to execute Levenshtein function - 0.197554 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.401056 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.027982 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.036923 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.000767 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. |