| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| peitie-fu (0) - 1 freq dewtie-fu (2) - 1 freq peitifu (2) - 1 freq peitifou (3) - 1 freq peetifu (3) - 3 freq neive-fu (3) - 1 freq peitie (3) - 5 freq peerie-' (4) - 1 freq peacefu (4) - 12 freq platefu (4) - 4 freq ceitie (4) - 19 freq deities (4) - 2 freq petties (4) - 1 freq perties (4) - 7 freq peetiful (4) - 1 freq peerie- (4) - 1 freq pertie (4) - 6 freq neivefu (4) - 1 freq peitiless (4) - 2 freq plentifu (4) - 2 freq hert-fu (4) - 1 freq seil-fu (4) - 1 freq pridefu (4) - 6 freq peirie (4) - 5 freq pitie (4) - 1 freq |
peitie-fu (0) - 1 freq peitifu (3) - 1 freq peetifu (4) - 3 freq peitifou (4) - 1 freq dewtie-fu (4) - 1 freq pityfu (5) - 2 freq pace-fu (5) - 1 freq beauti-fu (5) - 1 freq neive-fu (5) - 1 freq peitie (5) - 5 freq peetie (6) - 24 freq pitiful (6) - 3 freq pensefu (6) - 11 freq peiters (6) - 1 freq patientfu (6) - 2 freq pitied (6) - 3 freq pit-by (6) - 1 freq pity- (6) - 1 freq pet-an (6) - 1 freq pit-on (6) - 7 freq potfu (6) - 1 freq peetied (6) - 3 freq pettie (6) - 1 freq pecefu (6) - 1 freq spitefu (6) - 1 freq |
SoundEx code - P310 peetifu - 3 freq peyed-up - 1 freq pityfu - 2 freq potfu - 1 freq peitifu - 1 freq peedv - 1 freq pot-de-feu - 1 freq pdf - 37 freq peitie-fu - 1 freq pit-by - 1 freq peitifou - 1 freq paddyb - 1 freq ptyf - 1 freq pidpu - 1 freq pdp - 1 freq pdyafw - 1 freq peedieboy - 1 freq |
MetaPhone code - PTF peetifu - 3 freq pityfu - 2 freq potfu - 1 freq peitifu - 1 freq peedv - 1 freq pdf - 37 freq peitie-fu - 1 freq peitifou - 1 freq ptyf - 1 freq |
PEITIE-FU |
| Time to execute Levenshtein function - 0.226397 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.351167 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.028181 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.039685 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.000999 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. |