| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| spawnin (0) - 1 freq spannin (1) - 4 freq stawnin (1) - 5 freq sprawlin (2) - 4 freq spashin (2) - 1 freq spangin (2) - 8 freq spankin (2) - 3 freq sparkin (2) - 8 freq pawlin (2) - 1 freq sawin (2) - 11 freq pawndin (2) - 1 freq spakein (2) - 1 freq spinnin (2) - 55 freq shawin (2) - 60 freq spacin (2) - 1 freq spaein (2) - 3 freq spawned (2) - 1 freq awnin (2) - 20 freq staanin (2) - 9 freq pawin (2) - 3 freq snawin (2) - 6 freq scannin (2) - 8 freq speanin (2) - 1 freq spawn (2) - 5 freq pannin (2) - 2 freq |
spawnin (0) - 1 freq stawnin (2) - 5 freq spannin (2) - 4 freq spennin (3) - 21 freq speanin (3) - 1 freq spawny (3) - 2 freq spewin (3) - 19 freq spinnin (3) - 55 freq spawn (3) - 5 freq spawned (3) - 1 freq pawtin (4) - 1 freq spackin (4) - 5 freq spainie (4) - 1 freq sainin (4) - 4 freq spenn (4) - 3 freq spewins (4) - 2 freq stannin (4) - 152 freq dawnin (4) - 7 freq spennen (4) - 1 freq spain (4) - 55 freq spakkin (4) - 1 freq spewing (4) - 2 freq snawinan (4) - 1 freq spewin' (4) - 1 freq sp-nn (4) - 1 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 |
SPAWNIN |
| Time to execute Levenshtein function - 0.210183 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.400638 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.027467 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.038003 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.000881 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. |