| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| supposin (0) - 14 freq supposit (1) - 4 freq opposin (2) - 3 freq suppost (2) - 4 freq suppose (2) - 268 freq supposes (2) - 2 freq supposed (2) - 116 freq suppin (2) - 9 freq supportin (2) - 38 freq €œsupposin (2) - 1 freq supplyin (2) - 3 freq uppin (3) - 1 freq spootin (3) - 5 freq supporten (3) - 2 freq uprisin (3) - 5 freq supposidly (3) - 1 freq sippose (3) - 2 freq suppoosed (3) - 1 freq exposin (3) - 6 freq support (3) - 339 freq posin (3) - 9 freq soppin (3) - 1 freq spokin (3) - 5 freq suppositly (3) - 1 freq supportit (3) - 38 freq |
supposin (0) - 14 freq supposit (2) - 4 freq supposed (3) - 116 freq supposes (3) - 2 freq supplyin (3) - 3 freq suppin (3) - 9 freq opposin (3) - 3 freq suppose (3) - 268 freq suppost (3) - 4 freq suppan (4) - 1 freq soppin (4) - 1 freq suppone (4) - 12 freq supposition (4) - 1 freq supreisin (4) - 1 freq sippin (4) - 7 freq suppen (4) - 1 freq suppoosed (4) - 1 freq €œsupposin (4) - 1 freq sippose (4) - 2 freq supportin (4) - 38 freq sppken (5) - 1 freq supportan (5) - 1 freq suppie (5) - 24 freq supponed (5) - 1 freq sploshin (5) - 1 freq |
SoundEx code - S125 speakin - 235 freq spoken - 214 freq spoke-magine - 1 freq spikkin - 184 freq sheepskin - 12 freq sufficient - 10 freq speikin - 18 freq speik-an - 1 freq suffeecient - 1 freq spickin - 58 freq supposin - 14 freq speaking - 29 freq spacin - 1 freq sheepskins - 6 freq spaekan - 32 freq spakin - 32 freq spikken - 15 freq spikin' - 7 freq speak-an - 1 freq spoke-in - 1 freq spaikin - 2 freq spokken - 47 freq spasmodic - 1 freq spaekin - 114 freq spackin - 5 freq spaekin' - 1 freq specimen - 2 freq suffusin - 2 freq spikkan - 4 freq spakken - 2 freq shepe-skane - 1 freq spaekeen - 3 freq spocken - 3 freq 'speakin - 2 freq spakkin - 1 freq spokin - 5 freq speakan - 6 freq spokkan - 1 freq spikin - 28 freq spakein - 1 freq spækin - 1 freq spokkin - 1 freq spikkinaboot - 1 freq spasm - 1 freq speckan - 2 freq speakan-an - 1 freq spaekeens - 1 freq 'speaking - 1 freq spukken - 10 freq suffeicient - 1 freq subsumin - 1 freq €™spækin - 1 freq spiken - 3 freq spieken - 1 freq spiekin - 1 freq sufficiently - 1 freq spaekin't - 1 freq 'spikk-nae - 1 freq speecimens - 1 freq sufficiand - 1 freq €œsupposin - 1 freq speekin - 1 freq spaken - 4 freq speakin' - 2 freq €˜spaekin - 6 freq spokan - 3 freq sub-comatee - 1 freq spakna - 1 freq sphygmomanometer - 1 freq sub-continent - 1 freq spaceman - 1 freq spaekkin - 3 freq spickina - 1 freq speaksna - 1 freq subsamples - 1 freq spagnum - 2 freq spikking - 2 freq spacemannie - 1 freq spikkin' - 1 freq spiking - 9 freq spashin - 1 freq speaksense - 1 freq svxcwmw - 1 freq specking - 1 freq savchenko - 1 freq skpgm - 1 freq speyquine - 7 freq sppken - 1 freq svkknri - 1 freq sbsxunmh - 1 freq spisjn - 1 freq |
MetaPhone code - SPSN supposin - 14 freq spacin - 1 freq €œsupposin - 1 freq |
SUPPOSIN |
| Time to execute Levenshtein function - 0.190515 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.336862 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.030999 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.043572 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.000926 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. |