| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| preif (0) - 1 freq prein (1) - 1 freq preef (1) - 4 freq reif (1) - 2 freq pruif (1) - 21 freq pruifs (2) - 5 freq proil (2) - 1 freq reifs (2) - 1 freq cheif (2) - 3 freq beif (2) - 2 freq dreef (2) - 4 freq press (2) - 219 freq peik (2) - 2 freq pelf (2) - 6 freq reik (2) - 15 freq prey (2) - 27 freq peir (2) - 3 freq graif (2) - 3 freq preist (2) - 3 freq prelim (2) - 7 freq preein (2) - 11 freq reid (2) - 406 freq treis (2) - 9 freq ruif (2) - 77 freq leif (2) - 2 freq |
preif (0) - 1 freq preef (1) - 4 freq pruif (1) - 21 freq prof (2) - 29 freq prein (2) - 1 freq proof (2) - 48 freq reif (2) - 2 freq bref (3) - 1 freq pree (3) - 30 freq prees (3) - 2 freq prev (3) - 1 freq praid (3) - 1 freq prix (3) - 3 freq prep (3) - 5 freq preas (3) - 1 freq pareis (3) - 1 freq prie (3) - 4 freq grif (3) - 1 freq pruiv (3) - 1 freq prefix (3) - 3 freq reef (3) - 59 freq pret (3) - 1 freq reaf (3) - 1 freq perfu (3) - 1 freq prufe (3) - 1 freq |
SoundEx code - P610 proof - 48 freq prove - 66 freq purpie - 23 freq pruive - 22 freq purvey - 20 freq prop - 14 freq perv - 3 freq preef - 4 freq pruif - 21 freq powerfu' - 1 freq prap - 3 freq prof - 29 freq pruve - 8 freq 'prop' - 1 freq prep - 5 freq privy - 32 freq pouerfae - 3 freq powerfu - 10 freq pooerfu - 43 freq pouerfu - 24 freq pooerfa - 1 freq perfu - 1 freq powerfa - 1 freq pruiv - 1 freq preeve - 6 freq probe - 4 freq preif - 1 freq preive - 1 freq phrp - 1 freq prufe - 1 freq prob - 8 freq provie - 2 freq €œperve - 1 freq €˜pi-rip - 3 freq poorboy - 2 freq prev - 1 freq pirvba - 1 freq “privy - 1 freq |
MetaPhone code - PRF proof - 48 freq prove - 66 freq pruive - 22 freq purvey - 20 freq perv - 3 freq preef - 4 freq pruif - 21 freq prof - 29 freq pruve - 8 freq privy - 32 freq pouerfae - 3 freq prugh - 5 freq pooerfu - 43 freq pouerfu - 24 freq pooerfa - 1 freq perfu - 1 freq pruiv - 1 freq preeve - 6 freq preif - 1 freq preive - 1 freq prufe - 1 freq provie - 2 freq €œperve - 1 freq prev - 1 freq “privy - 1 freq |
PREIF |
| Time to execute Levenshtein function - 0.228793 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.337012 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.027412 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.037641 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.004603 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. |