| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| spellin (0) - 193 freq speldin (1) - 1 freq spellin' (1) - 1 freq spullin (1) - 2 freq speelin (1) - 5 freq spellins (1) - 71 freq stellin (1) - 14 freq sellin (1) - 70 freq shellin (1) - 3 freq spillin (1) - 10 freq smellin (1) - 15 freq spellit (1) - 1 freq swellin (1) - 4 freq speilin (1) - 1 freq spelling (1) - 72 freq spellan (1) - 1 freq sterlin (2) - 1 freq spellings (2) - 29 freq spewin (2) - 19 freq speldit (2) - 1 freq dellin (2) - 5 freq spelleen (2) - 5 freq smelling (2) - 4 freq spennin (2) - 21 freq spaellan (2) - 1 freq |
spellin (0) - 193 freq spillin (1) - 10 freq spullin (1) - 2 freq spellan (1) - 1 freq spellit (2) - 1 freq spelleen (2) - 5 freq swellin (2) - 4 freq spelling (2) - 72 freq spaellan (2) - 1 freq smellin (2) - 15 freq speilin (2) - 1 freq speelin (2) - 5 freq shellin (2) - 3 freq spellins (2) - 71 freq stellin (2) - 14 freq sellin (2) - 70 freq spellin' (2) - 1 freq speldin (2) - 1 freq spells (3) - 21 freq spilling (3) - 3 freq speleen (3) - 3 freq shullin (3) - 3 freq swallin (3) - 11 freq pallin (3) - 2 freq swillin (3) - 2 freq |
SoundEx code - S145 spellins - 71 freq spellin - 193 freq shuffling - 1 freq splender-new - 1 freq spulyien - 1 freq splinter - 4 freq shufflin - 6 freq scufflin - 1 freq splindert - 1 freq siblin - 1 freq sibilance - 1 freq spellingly - 1 freq shovelling - 1 freq spillin - 10 freq splayin - 1 freq siblins - 10 freq soupleness - 2 freq splendent - 1 freq sapling - 2 freq sploiinnnngggagggggaggag - 1 freq splang - 1 freq splendour - 10 freq sublime - 9 freq 'spellins - 1 freq spellings - 29 freq shovellin - 2 freq spylin - 7 freq splendiferous - 1 freq supplyin - 3 freq squabblin - 4 freq sublimely - 1 freq shovelin - 2 freq spilin - 2 freq spellin's - 7 freq splinters - 2 freq spullin - 2 freq subliminal - 1 freq sublimed - 1 freq supplement - 6 freq splendid - 25 freq spelling - 72 freq sablon - 1 freq speelin - 5 freq 'speelin - 1 freq spellan - 1 freq sibleen - 1 freq sibling - 1 freq spaelleen - 2 freq 'spaelleen' - 1 freq spaelleens - 1 freq spaellan - 1 freq siblings - 6 freq spellin' - 1 freq supplementary - 1 freq supplements - 1 freq sweevlin - 2 freq splenterin - 2 freq spellin-oot - 1 freq spelleen - 5 freq spellin-in-shaetlan - 1 freq spelleens - 3 freq speilin - 1 freq shiffllin - 1 freq shifflin - 1 freq shivellin - 1 freq splintery - 1 freq supplementarie - 2 freq spilling - 3 freq saplins - 2 freq spallins - 1 freq splint - 1 freq €œshuffling - 1 freq soopleness - 1 freq splintit - 1 freq spleen - 1 freq spoiling - 3 freq €˜splendour - 1 freq spielin - 1 freq seeplin - 1 freq spulyan - 1 freq speleens - 3 freq speleen - 3 freq sophiaalmaria - 1 freq soupelina - 2 freq sublimate - 1 freq siblingenvy - 1 freq sabhalmorostaig - 1 freq |
MetaPhone code - SPLN spellin - 193 freq spillin - 10 freq spylin - 7 freq spilin - 2 freq spullin - 2 freq speelin - 5 freq 'speelin - 1 freq spellan - 1 freq spaelleen - 2 freq 'spaelleen' - 1 freq spaellan - 1 freq spellin' - 1 freq zepplin - 1 freq spelleen - 5 freq speilin - 1 freq zeppelin - 2 freq spleen - 1 freq spielin - 1 freq seeplin - 1 freq speleen - 3 freq soupelina - 2 freq |
SPELLIN |
| Time to execute Levenshtein function - 0.193065 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.344308 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.028009 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.037226 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.000934 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. |