| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| peteition (0) - 1 freq peteetion (1) - 3 freq petition (1) - 11 freq peteetions (2) - 1 freq poseition (2) - 9 freq perdition (2) - 1 freq petitions (2) - 1 freq repeteition (2) - 1 freq edeition (2) - 13 freq detention (2) - 10 freq parteition (2) - 3 freq perfection (3) - 14 freq attrition (3) - 2 freq exertion (3) - 3 freq staition (3) - 1 freq election (3) - 87 freq selection (3) - 28 freq peterson (3) - 2 freq prevention (3) - 1 freq nutrition (3) - 4 freq detentions (3) - 1 freq edeitions (3) - 3 freq dereision (3) - 2 freq teitin (3) - 1 freq poseetion (3) - 29 freq |
peteition (0) - 1 freq petition (1) - 11 freq peteetion (1) - 3 freq parteition (3) - 3 freq pettin (3) - 3 freq petitions (3) - 1 freq repeteition (3) - 1 freq poseition (3) - 9 freq peteetions (3) - 1 freq parteetion (4) - 6 freq repetition (4) - 6 freq pittin (4) - 392 freq position (4) - 95 freq tuition (4) - 7 freq partition (4) - 4 freq poseitioun (4) - 5 freq pottin (4) - 1 freq pattin (4) - 16 freq putton (4) - 1 freq poseetion (4) - 29 freq petitioned (4) - 1 freq puttin (4) - 63 freq intuition (4) - 6 freq repeteetion (4) - 4 freq petten (4) - 7 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 |
PETEITION |
| Time to execute Levenshtein function - 0.621929 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.812708 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.091163 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.105311 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.002440 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. |