| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| palf (0) - 1 freq palo (1) - 1 freq paff (1) - 1 freq pal (1) - 508 freq pelf (1) - 6 freq pale (1) - 88 freq pal' (1) - 1 freq calf (1) - 12 freq aalf (1) - 1 freq balf (1) - 1 freq pall (1) - 5 freq palm (1) - 33 freq half (1) - 539 freq pals (1) - 365 freq alf (1) - 7 freq palt (1) - 1 freq wals (2) - 1 freq raaf (2) - 1 freq val (2) - 34 freq paiy (2) - 8 freq alp (2) - 1 freq pais (2) - 3 freq awf (2) - 2 freq pans (2) - 23 freq peal (2) - 3 freq |
palf (0) - 1 freq pelf (1) - 6 freq palm (2) - 33 freq pall (2) - 5 freq half (2) - 539 freq alf (2) - 7 freq palt (2) - 1 freq balf (2) - 1 freq pals (2) - 365 freq palo (2) - 1 freq aalf (2) - 1 freq paff (2) - 1 freq pal (2) - 508 freq calf (2) - 12 freq pale (2) - 88 freq pal' (2) - 1 freq wolf (3) - 91 freq pael (3) - 2 freq pul (3) - 6 freq pvf (3) - 1 freq pale' (3) - 1 freq poof (3) - 11 freq helf (3) - 2 freq palin (3) - 4 freq lf (3) - 5 freq |
SoundEx code - P410 philp - 10 freq plav - 1 freq philip - 19 freq pluff - 4 freq pluffy - 1 freq plip - 1 freq pelf - 6 freq pleb - 4 freq pluffie - 1 freq pulp - 4 freq palava - 1 freq philippe - 1 freq palf - 1 freq philippi - 1 freq phïlip - 2 freq phillipi - 1 freq pheelip - 2 freq plowp - 3 freq playboy - 1 freq plop - 4 freq pleep - 3 freq pælfoo - 1 freq phílip - 1 freq philiphaw - 1 freq phillip - 2 freq pulpy - 1 freq philope - 2 freq philhope - 8 freq plap - 2 freq ploop - 1 freq philippaw - 8 freq play-off - 1 freq paulphi - 1 freq philippa - 2 freq plebby - 1 freq |
MetaPhone code - PLF plav - 1 freq pluff - 4 freq pluffy - 1 freq pleugh - 2 freq pelf - 6 freq pluffie - 1 freq palava - 1 freq palf - 1 freq plough - 7 freq pælfoo - 1 freq play-off - 1 freq paulphi - 1 freq |
PALF |
| Time to execute Levenshtein function - 0.360558 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.636339 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.074244 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.081977 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.001304 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. |