Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
petitions (0) - 1 freq petition (1) - 11 freq neitions (2) - 1 freq peteetions (2) - 1 freq petitioned (2) - 1 freq editions (2) - 4 freq peteition (2) - 1 freq positions (2) - 14 freq competitions (3) - 7 freq peteetion (3) - 3 freq devotions (3) - 4 freq operations (3) - 8 freq decisions (3) - 29 freq petties (3) - 1 freq pettin (3) - 3 freq reactions (3) - 7 freq poseitions (3) - 3 freq opeinions (3) - 3 freq seetiations (3) - 3 freq peintins (3) - 1 freq intuitions (3) - 1 freq pensions (3) - 15 freq relations (3) - 14 freq raitions (3) - 1 freq potions (3) - 11 freq |
petitions (0) - 1 freq peteetions (2) - 1 freq petition (2) - 11 freq peteition (3) - 1 freq positions (3) - 14 freq petitioned (3) - 1 freq citations (4) - 3 freq potions (4) - 11 freq seetiations (4) - 3 freq pentins (4) - 13 freq peintins (4) - 1 freq stations (4) - 10 freq poseitions (4) - 3 freq settins (4) - 10 freq portions (4) - 6 freq rotations (4) - 1 freq intuitions (4) - 1 freq petties (4) - 1 freq operations (4) - 8 freq peteetion (4) - 3 freq editions (4) - 4 freq pettin (4) - 3 freq neitions (4) - 1 freq fittins (5) - 1 freq pattin (5) - 16 freq |
SoundEx code - P335 peteition - 1 freq petitions - 1 freq petition - 11 freq pethidine - 1 freq petitioned - 1 freq peteetions - 1 freq peteetion - 3 freq pwdatuhmzq - 1 freq |
MetaPhone code - PTXNS petitions - 1 freq peteetions - 1 freq |
PETITIONS |
Time to execute Levenshtein function - 0.232739 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.384816 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.027786 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.042468 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.000961 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. |