| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| podcastin (0) - 1 freq podcast (2) - 26 freq podcasts (2) - 8 freq hoastin (3) - 18 freq toastin (3) - 2 freq castin (3) - 48 freq pastin (3) - 2 freq coastin (3) - 1 freq dlastin (3) - 1 freq poatin (3) - 1 freq postin (3) - 21 freq poastie (3) - 1 freq broadcastin (3) - 6 freq roastin (3) - 23 freq boastin (3) - 3 freq formattin (4) - 1 freq pollutin (4) - 3 freq pleasin (4) - 11 freq boastit (4) - 1 freq roastin' (4) - 1 freq dedicatin (4) - 2 freq eddicatin (4) - 1 freq cantin (4) - 4 freq sarcastic (4) - 11 freq drastic (4) - 5 freq |
podcastin (0) - 1 freq podcasts (3) - 8 freq podcast (3) - 26 freq postin (5) - 21 freq broadcastin (5) - 6 freq dlastin (5) - 1 freq coastin (5) - 1 freq pastin (5) - 2 freq castin (5) - 48 freq podkests (6) - 1 freq dustin (6) - 12 freq prodistan (6) - 2 freq protestin (6) - 2 freq educatin (6) - 4 freq costin (6) - 5 freq adjustin (6) - 6 freq deistin (6) - 3 freq plichtin (6) - 1 freq processin (6) - 4 freq precaution (6) - 3 freq pulsatin (6) - 3 freq castan (6) - 1 freq apdatin (6) - 2 freq dedicatin (6) - 2 freq roastin (6) - 23 freq |
SoundEx code - P322 patches - 22 freq pootches - 4 freq pitches - 15 freq podcastin - 1 freq peat-choked - 1 freq podcasts - 8 freq podcast - 26 freq paitches - 1 freq pedagogy - 1 freq pedagogical - 1 freq pedagogic - 1 freq podkests - 1 freq pdxuj - 1 freq |
MetaPhone code - PTKSTN podcastin - 1 freq |
PODCASTIN |
| Time to execute Levenshtein function - 0.262928 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.462284 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.029739 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.074682 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. |