| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| face-paint (0) - 2 freq face-an (3) - 2 freq face--an (3) - 1 freq facepaintin (3) - 1 freq war-paint (3) - 1 freq half-pint (4) - 1 freq tae-pairty (4) - 2 freq hame-airt (4) - 1 freq faceline (4) - 2 freq certaint (4) - 6 freq five-pynt (4) - 1 freq face-masks (4) - 1 freq hauf-pint (4) - 1 freq warpaint (4) - 1 freq acettain (4) - 1 freq face-doon (4) - 2 freq face-doun (4) - 3 freq facetit (4) - 1 freq fore-maist (4) - 1 freq fee-pyin (4) - 1 freq acquaint (4) - 3 freq fake-tan (4) - 1 freq facetiming (4) - 1 freq facelift (4) - 1 freq face-first (4) - 1 freq |
face-paint (0) - 2 freq face-an (5) - 2 freq five-pynt (5) - 1 freq war-paint (5) - 1 freq face--an (5) - 1 freq facepaintin (5) - 1 freq face-doun (6) - 3 freq hauf-pint (6) - 1 freq face-doon (6) - 2 freq fee-pyin (6) - 1 freq facelift (7) - 1 freq face-first (7) - 1 freq fower-pairt (7) - 1 freq faur-kent (7) - 8 freq fur-ahint (7) - 1 freq pin-point (7) - 1 freq flippant (7) - 2 freq fee-peyin (7) - 1 freq five-penny (7) - 1 freq facetiming (7) - 1 freq uccupant (7) - 1 freq aff-pit (7) - 6 freq fake-tan (7) - 1 freq warpaint (7) - 1 freq faceline (7) - 2 freq |
SoundEx code - F215 face-paint - 2 freq fishpond - 2 freq fish-fingers - 1 freq fjkyvnvh - 1 freq foggiebummer - 1 freq fcvmr - 2 freq facepaintin - 1 freq fiwuggpyn - 1 freq |
MetaPhone code - FSPNT face-paint - 2 freq |
FACE-PAINT |
| Time to execute Levenshtein function - 0.228898 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.357180 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.028068 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.036836 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. |