| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| five-pynt (0) - 1 freq five-fit (3) - 1 freq five-penny (3) - 1 freq pinpynt (4) - 1 freq flashpynt (4) - 1 freq five-mile (4) - 1 freq divergent (4) - 1 freq face-paint (4) - 2 freq hip-jynt (4) - 2 freq fient (4) - 6 freq five-quid (4) - 1 freq fee-pyin (4) - 1 freq fivepenny (4) - 1 freq disappynt (4) - 5 freq poker-pynt (4) - 1 freq five-minute (4) - 3 freq fit-dunt (4) - 1 freq five-ack (4) - 1 freq five-star (4) - 1 freq fivert (4) - 2 freq five-inch (4) - 1 freq divent (4) - 1 freq powerpynt (4) - 1 freq five-week (4) - 1 freq wide-kent (4) - 1 freq |
five-pynt (0) - 1 freq five-penny (4) - 1 freq five-minute (5) - 3 freq face-paint (5) - 2 freq five-fit (5) - 1 freq fivepenny (6) - 1 freq fee-pyin (6) - 1 freq fit-dunt (6) - 1 freq powerpynt (7) - 1 freq wide-kent (7) - 1 freq life-rent (7) - 1 freq five-o (7) - 1 freq five-year (7) - 1 freq flippant (7) - 2 freq faur-kent (7) - 8 freq viewpoint (7) - 6 freq pin-point (7) - 1 freq fee-peyin (7) - 1 freq hauf-pint (7) - 1 freq divent (7) - 1 freq five-week (7) - 1 freq divergent (7) - 1 freq five-mile (7) - 1 freq five-inch (7) - 1 freq hip-jynt (7) - 2 freq |
SoundEx code - F115 five-penny - 1 freq fivepenny - 1 freq five-pynt - 1 freq |
MetaPhone code - FFPNT five-pynt - 1 freq |
FIVE-PYNT |
| Time to execute Levenshtein function - 0.197284 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.408152 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.029821 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.043479 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.000950 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. |