Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
poetical (0) - 3 freq polemical (2) - 1 freq poetic (2) - 34 freq political (2) - 206 freq polietical (2) - 2 freq retical (2) - 1 freq poleetical (2) - 38 freq poleitical (2) - 10 freq cemical (3) - 1 freq notican (3) - 1 freq comical (3) - 4 freq pontiac (3) - 1 freq petal (3) - 10 freq poleitieal (3) - 1 freq lexical (3) - 25 freq hostipal (3) - 2 freq polÃtical (3) - 1 freq politiecal (3) - 5 freq ceenical (3) - 3 freq retiral (3) - 5 freq teepical (3) - 7 freq politcal (3) - 1 freq practical (3) - 48 freq retinal (3) - 1 freq postal (3) - 3 freq |
poetical (0) - 3 freq retical (3) - 1 freq poleitical (3) - 10 freq polietical (3) - 2 freq poleetical (3) - 38 freq political (3) - 206 freq poetic (3) - 34 freq peetiful (4) - 1 freq politcal (4) - 1 freq peecial (4) - 1 freq apolitical (4) - 2 freq politiecal (4) - 5 freq optimal (4) - 1 freq piratical (4) - 1 freq polemical (4) - 1 freq petal (4) - 10 freq notican (5) - 1 freq partial (5) - 7 freq poleiticall (5) - 1 freq cemical (5) - 1 freq articoal (5) - 1 freq particle (5) - 1 freq creitical (5) - 5 freq lexical (5) - 25 freq foetal (5) - 3 freq |
SoundEx code - P324 poetical - 3 freq piteously - 1 freq pitsliga - 35 freq pitsligas - 2 freq pitsliga's - 1 freq patsley - 1 freq patch'll - 1 freq pitgeldie - 1 freq pitsligo - 1 freq poet-collector - 1 freq paddok-loks - 1 freq €œpet-gilante - 1 freq |
MetaPhone code - PTKL poetical - 3 freq |
POETICAL |
Time to execute Levenshtein function - 0.248046 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.383208 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.027315 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.042003 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.000977 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. |