| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| peteetions (0) - 1 freq peteetion (1) - 3 freq edeetions (2) - 1 freq detentions (2) - 1 freq peteition (2) - 1 freq petitions (2) - 1 freq poseetions (2) - 9 freq competeetions (3) - 4 freq attentions (3) - 3 freq paveelions (3) - 1 freq parteetion (3) - 6 freq secretions (3) - 1 freq reveesions (3) - 1 freq repeteetion (3) - 4 freq intentions (3) - 17 freq deveesions (3) - 1 freq elections (3) - 47 freq exertions (3) - 2 freq detention (3) - 10 freq deceesions (3) - 10 freq relaetions (3) - 2 freq petition (3) - 11 freq releegions (3) - 3 freq poseitions (3) - 3 freq edeetion (3) - 12 freq |
peteetions (0) - 1 freq petitions (2) - 1 freq peteetion (2) - 3 freq peteition (3) - 1 freq poseetions (3) - 9 freq poseitions (4) - 3 freq petition (4) - 11 freq detentions (4) - 1 freq staetions (4) - 4 freq edeetions (4) - 1 freq pettin (5) - 3 freq stations (5) - 10 freq peintins (5) - 1 freq opteecians (5) - 1 freq pretentious (5) - 3 freq poseetion (5) - 29 freq pentins (5) - 13 freq situations (5) - 20 freq petties (5) - 1 freq petitioned (5) - 1 freq positions (5) - 14 freq operations (5) - 8 freq seetiations (5) - 3 freq settins (5) - 10 freq intuitions (5) - 1 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 |
PETEETIONS |
| Time to execute Levenshtein function - 0.632505 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.735185 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.035150 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.040127 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.000930 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. |