Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
podcasts (0) - 8 freq podcast (1) - 26 freq podcastin (2) - 1 freq podkests (2) - 1 freq ootcasts (2) - 1 freq poasts (2) - 1 freq brodcast (3) - 1 freq roasts (3) - 1 freq forecasts (3) - 4 freq pasts (3) - 4 freq locusts (3) - 6 freq boasts (3) - 3 freq coasts (3) - 4 freq ootcast (3) - 2 freq poats (3) - 2 freq pockets (3) - 22 freq hoasts (3) - 8 freq posts (3) - 45 freq poackets (3) - 8 freq toasts (3) - 2 freq poast (3) - 5 freq casts (3) - 19 freq plaits (4) - 4 freq contacts (4) - 7 freq godness (4) - 1 freq |
podcasts (0) - 8 freq podcast (2) - 26 freq podkests (3) - 1 freq podcastin (3) - 1 freq poasts (4) - 1 freq ootcasts (4) - 1 freq pockets (5) - 22 freq poackets (5) - 8 freq casts (5) - 19 freq coasts (5) - 4 freq posts (5) - 45 freq pasts (5) - 4 freq forecasts (5) - 4 freq locusts (5) - 6 freq preists (6) - 3 freq products (6) - 21 freq 'costs (6) - 1 freq pests (6) - 2 freq pechts (6) - 77 freq redcoats (6) - 6 freq purists (6) - 5 freq persists (6) - 3 freq doocots (6) - 2 freq process (6) - 120 freq racists (6) - 6 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 - PTKSTS podcasts - 8 freq podkests - 1 freq |
PODCASTS |
Time to execute Levenshtein function - 0.209453 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.375054 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.027122 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.037403 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.000917 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. |