| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| secoypp (0) - 1 freq decoy (3) - 1 freq secon' (3) - 4 freq scope (3) - 12 freq scoops (3) - 1 freq second (3) - 390 freq recoop (3) - 1 freq secong (3) - 1 freq seconds (3) - 94 freq scoys (3) - 1 freq secon (3) - 1 freq secondo (3) - 1 freq scoop (3) - 16 freq scowp (3) - 6 freq copp (3) - 1 freq sopp (3) - 1 freq slopp (3) - 1 freq recoup (3) - 3 freq secont (3) - 16 freq scout (4) - 13 freq sects (4) - 2 freq selcouth (4) - 1 freq accompt (4) - 2 freq selly (4) - 1 freq scoisr (4) - 1 freq |
secoypp (0) - 1 freq scoop (4) - 16 freq scowp (4) - 6 freq copp (4) - 1 freq sopp (4) - 1 freq slopp (4) - 1 freq scope (4) - 12 freq scoops (4) - 1 freq accepp (5) - 3 freq scalp (5) - 6 freq schop (5) - 1 freq shoppe (5) - 2 freq scraep (5) - 1 freq scoped (5) - 1 freq sloppy (5) - 1 freq scheip (5) - 1 freq fycpp (5) - 1 freq sceups (5) - 1 freq scrapy (5) - 1 freq scap (5) - 2 freq scape (5) - 1 freq shapp (5) - 1 freq scampi (5) - 1 freq scapa (5) - 10 freq scoopit (5) - 3 freq |
SoundEx code - S210 seasub - 1 freq seascape - 1 freq sea-cubbie - 1 freq secoypp - 1 freq sekf - 1 freq sacvp - 1 freq |
MetaPhone code - SKP scoop - 16 freq skip - 25 freq skep - 2 freq scaup - 5 freq scope - 12 freq scap - 2 freq scapa - 10 freq skype - 5 freq scowp - 6 freq skippy - 2 freq skepp - 2 freq xqp - 1 freq secoypp - 1 freq cikup - 1 freq scape - 1 freq |
SECOYPP |
| Time to execute Levenshtein function - 0.209494 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.378628 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.031079 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.042053 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.000901 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. |