| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| painrife (0) - 1 freq plainwife (2) - 1 freq pawnwife (2) - 1 freq painfu (3) - 5 freq painites (3) - 1 freq ainhie (3) - 1 freq wakrife (3) - 1 freq painfil (3) - 1 freq paitrick (3) - 1 freq pinkie (3) - 18 freq paintin (3) - 45 freq pirie (3) - 5 freq dernrife (3) - 1 freq paine (3) - 5 freq rainie (3) - 8 freq maisrie (3) - 2 freq fairie (3) - 4 freq waakrife (3) - 1 freq pairis (3) - 2 freq sairrie (3) - 3 freq playntife (3) - 1 freq painting (3) - 9 freq parrie (3) - 4 freq spainie (3) - 1 freq pierie (3) - 8 freq |
painrife (0) - 1 freq winryfe (4) - 1 freq plainwife (4) - 1 freq wanryfe (4) - 1 freq painfu (4) - 5 freq pawnwife (4) - 1 freq prufe (5) - 1 freq pairtie (5) - 44 freq pairlie (5) - 1 freq waukrife (5) - 12 freq wakerife (5) - 2 freq sinrise (5) - 1 freq peirie (5) - 5 freq pairris (5) - 2 freq parrifen (5) - 1 freq pinnie (5) - 2 freq paintit (5) - 22 freq tenerife (5) - 3 freq pangfu (5) - 1 freq kinrike (5) - 1 freq pirrie (5) - 1 freq priorie (5) - 7 freq pairte (5) - 1 freq nairrie (5) - 1 freq prairie (5) - 1 freq |
SoundEx code - P561 painrife - 1 freq |
MetaPhone code - PNRF painrife - 1 freq |
PAINRIFE |
| Time to execute Levenshtein function - 0.212535 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.384860 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.027754 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.039077 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.000861 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. |