| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| respellin (0) - 1 freq repellin (1) - 2 freq resellin (1) - 1 freq respeckin (2) - 2 freq retellin (2) - 4 freq re-tellin (2) - 1 freq expellin (2) - 1 freq respectin (2) - 4 freq revellin (2) - 3 freq gospellin (2) - 1 freq spellin (2) - 193 freq spellit (3) - 1 freq spellan (3) - 1 freq reservin (3) - 1 freq speldin (3) - 1 freq 'spellins (3) - 1 freq resolvin (3) - 1 freq respecting (3) - 2 freq swellin (3) - 4 freq resemblin (3) - 6 freq spelling (3) - 72 freq speelin (3) - 5 freq zeppelin (3) - 2 freq repeoplin (3) - 2 freq trevellin (3) - 21 freq |
respellin (0) - 1 freq resellin (2) - 1 freq repellin (2) - 2 freq spellin (3) - 193 freq gospellin (3) - 1 freq spellan (4) - 1 freq spillin (4) - 10 freq spullin (4) - 2 freq revellin (4) - 3 freq retellin (4) - 4 freq respeckin (4) - 2 freq expellin (4) - 1 freq re-tellin (4) - 1 freq respectin (4) - 4 freq rebellion (5) - 36 freq repellent (5) - 1 freq legpullin (5) - 1 freq ransellin (5) - 1 freq compellin (5) - 5 freq raivellin (5) - 1 freq stellin (5) - 14 freq rellin (5) - 1 freq shellin (5) - 3 freq sellin (5) - 70 freq replyin (5) - 9 freq |
SoundEx code - R214 reek-bleckened - 1 freq rockpools - 1 freq resplendent - 4 freq re-spell - 1 freq risible - 1 freq respellin - 1 freq roosevelt - 1 freq re-shuffle - 2 freq rrjvalentine - 1 freq rihcpl - 1 freq roezvlrkac - 1 freq |
MetaPhone code - RSPLN respellin - 1 freq |
RESPELLIN |
| Time to execute Levenshtein function - 0.259294 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.456515 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.032174 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.051111 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.000867 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. |