| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| petition (0) - 11 freq peteition (1) - 1 freq petitions (1) - 1 freq partition (2) - 4 freq repetition (2) - 6 freq position (2) - 95 freq peteetion (2) - 3 freq perdition (2) - 1 freq pettin (2) - 3 freq petitioned (2) - 1 freq edition (2) - 27 freq dentition (2) - 1 freq sedition (2) - 7 freq petties (3) - 1 freq fettin (3) - 1 freq operation (3) - 41 freq petite (3) - 1 freq fruition (3) - 2 freq expedition (3) - 3 freq station (3) - 139 freq peityin (3) - 1 freq pentin (3) - 23 freq prediction (3) - 6 freq settin (3) - 142 freq wettin (3) - 2 freq |
petition (0) - 11 freq peteition (1) - 1 freq pettin (2) - 3 freq petitions (2) - 1 freq peteetion (2) - 3 freq pattin (3) - 14 freq pittin (3) - 392 freq putton (3) - 1 freq pottin (3) - 1 freq petten (3) - 7 freq repetition (3) - 6 freq position (3) - 95 freq petitioned (3) - 1 freq puttin (3) - 58 freq partition (3) - 4 freq putten (4) - 31 freq peltin (4) - 6 freq parteition (4) - 3 freq repeteition (4) - 1 freq peintin (4) - 5 freq teitin (4) - 1 freq lettin (4) - 91 freq seitiation (4) - 3 freq expotition (4) - 1 freq mettin (4) - 2 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 - PTXN peteition - 1 freq petition - 11 freq peteetion - 3 freq |
PETITION |
| Time to execute Levenshtein function - 0.211271 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.347840 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.027422 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.036618 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.000836 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. |