| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| proof (0) - 48 freq proofs (1) - 3 freq prof (1) - 29 freq groof (1) - 1 freq proos (1) - 1 freq roof (1) - 104 freq prood (1) - 197 freq poof (1) - 11 freq proo (1) - 3 freq croo (2) - 7 freq prone (2) - 11 freq aloof (2) - 2 freq broot (2) - 3 freq troon (2) - 5 freq broo' (2) - 1 freq preif (2) - 1 freq proof's (2) - 1 freq 'doof (2) - 1 freq roofs (2) - 11 freq rof (2) - 3 freq peoor (2) - 1 freq prop (2) - 14 freq roofe (2) - 1 freq broom (2) - 18 freq troo (2) - 51 freq |
proof (0) - 48 freq prof (1) - 29 freq pruif (2) - 21 freq proofs (2) - 3 freq preif (2) - 1 freq poof (2) - 11 freq preef (2) - 4 freq proo (2) - 3 freq groof (2) - 1 freq proos (2) - 1 freq roof (2) - 104 freq prood (2) - 197 freq prufe (3) - 1 freq poor (3) - 424 freq prove (3) - 66 freq prod (3) - 3 freq prow (3) - 5 freq proud (3) - 153 freq pyoor (3) - 1 freq pros (3) - 4 freq proxy (3) - 4 freq prso (3) - 1 freq prior (3) - 18 freq probe (3) - 4 freq prob (3) - 8 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 |
PROOF |
| Time to execute Levenshtein function - 0.182486 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.348420 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.027723 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.037524 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.000934 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. |