| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pauchled (0) - 12 freq fauchled (1) - 1 freq dauchled (1) - 3 freq pauchle (1) - 20 freq rauchled (1) - 1 freq hauchled (1) - 1 freq peuchled (1) - 1 freq bauchled (1) - 6 freq pauchler (1) - 1 freq rauchle (2) - 8 freq patched (2) - 2 freq trauchled (2) - 13 freq sprauchled (2) - 7 freq shauchled (2) - 13 freq bauchle (2) - 26 freq bauchles (2) - 4 freq pauchlers (2) - 1 freq parched (2) - 9 freq bauchlet (2) - 1 freq hauchles (2) - 1 freq bachled (2) - 1 freq pauchlin (2) - 17 freq lauched (2) - 75 freq pochled (2) - 3 freq dauchle (2) - 2 freq |
pauchled (0) - 12 freq peuchled (1) - 1 freq pauchler (2) - 1 freq pochled (2) - 3 freq hauchled (2) - 1 freq bauchled (2) - 6 freq fauchled (2) - 1 freq dauchled (2) - 3 freq pauchle (2) - 20 freq rauchled (2) - 1 freq bachled (3) - 1 freq pauchlin (3) - 17 freq hochled (4) - 1 freq wauchle (4) - 4 freq pauchilt (4) - 1 freq peched (4) - 39 freq lauched (4) - 75 freq poochle (4) - 2 freq pauchelt (4) - 2 freq rochled (4) - 2 freq poached (4) - 4 freq pickled (4) - 10 freq dauchle (4) - 2 freq pauchlers (4) - 1 freq shauchled (4) - 13 freq |
SoundEx code - P243 pousle't - 1 freq pauchled - 12 freq pochled - 3 freq puzzlt - 6 freq puggl't - 1 freq puzzlit - 1 freq puggelt - 2 freq pauchelt - 2 freq puzzled - 36 freq pickled - 10 freq puggled - 21 freq packload - 1 freq piggledy - 1 freq pochlit - 1 freq puzzelt - 11 freq peculators - 1 freq pickult - 4 freq peuchled - 1 freq pochelt - 1 freq pickelt - 3 freq pickl't - 1 freq pauchilt - 1 freq pikkilt - 1 freq pugglit - 1 freq pixelation - 1 freq pixellation - 2 freq puzzl't - 1 freq puzzlet - 3 freq p-celtic - 3 freq piggilty - 1 freq psalter - 1 freq pglet - 5 freq pksltspvqo - 1 freq |
MetaPhone code - PXLT pauchled - 12 freq pochled - 3 freq pauchelt - 2 freq pochlit - 1 freq peuchled - 1 freq pochelt - 1 freq pauchilt - 1 freq |
PAUCHLED |
| Time to execute Levenshtein function - 0.213240 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.375051 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.027407 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.037540 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.000870 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. |