| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| spinnin (0) - 55 freq skinnin (1) - 3 freq spennin (1) - 21 freq sinnin (1) - 2 freq spinning (1) - 9 freq spinnan (1) - 3 freq spinnin' (1) - 2 freq spannin (1) - 4 freq pinnin (1) - 4 freq sunnin (2) - 5 freq stinnen (2) - 1 freq pinkin (2) - 1 freq sprintin (2) - 8 freq liinnin (2) - 1 freq skinnit (2) - 1 freq stunnin (2) - 17 freq sennin (2) - 12 freq sainin (2) - 4 freq spinnle (2) - 4 freq swannin (2) - 2 freq spillin (2) - 10 freq slingin (2) - 4 freq stinkin (2) - 20 freq spinne (2) - 2 freq stannin (2) - 152 freq |
spinnin (0) - 55 freq spinnan (1) - 3 freq spennin (1) - 21 freq spannin (1) - 4 freq pinnin (2) - 4 freq spennan (2) - 1 freq spennen (2) - 1 freq sinnin (2) - 2 freq skinnin (2) - 3 freq spinnin' (2) - 2 freq spinning (2) - 9 freq pannin (3) - 2 freq stennin (3) - 1 freq speanin (3) - 1 freq spinin' (3) - 1 freq stonnin (3) - 1 freq spangin (3) - 8 freq spawnin (3) - 1 freq spinner (3) - 1 freq stannin (3) - 152 freq scannin (3) - 8 freq punnin (3) - 1 freq spinny (3) - 1 freq pennin (3) - 2 freq spendin (3) - 33 freq |
SoundEx code - S155 spinnin - 55 freq seeven-hunner - 1 freq seeven-an-a-hauf - 1 freq spennin - 21 freq spammin - 1 freq spannin - 4 freq spennen - 1 freq shipment - 1 freq subhuman - 1 freq spaemen - 3 freq spinin' - 1 freq shipman - 3 freq spinnan - 3 freq spawnin - 1 freq sofnan - 1 freq shipmen - 1 freq spae-man - 1 freq spaeman - 1 freq spennan - 1 freq €œspawnin - 1 freq spinning - 9 freq spumantis - 1 freq speanin - 1 freq spinnin' - 2 freq |
MetaPhone code - SPNN spinnin - 55 freq spennin - 21 freq spannin - 4 freq spennen - 1 freq spinin' - 1 freq spinnan - 3 freq spawnin - 1 freq spennan - 1 freq €œspawnin - 1 freq speanin - 1 freq spinnin' - 2 freq |
SPINNIN |
| Time to execute Levenshtein function - 0.211801 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.334831 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.027189 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.037047 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.000953 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. |