| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pochled (0) - 3 freq rochled (1) - 2 freq hochled (1) - 1 freq hochlet (2) - 1 freq pauchled (2) - 12 freq shochled (2) - 1 freq mochles (2) - 7 freq hochles (2) - 1 freq bachled (2) - 1 freq poached (2) - 4 freq peched (2) - 39 freq hoched (2) - 1 freq cockled (2) - 2 freq pocked (2) - 1 freq rochles (2) - 1 freq poochle (2) - 2 freq pochlit (2) - 1 freq pochlin (2) - 1 freq peuchled (2) - 1 freq cochlea (2) - 2 freq dochle (2) - 1 freq trochled (2) - 1 freq pockle (2) - 1 freq pickled (2) - 10 freq soched (2) - 1 freq |
pochled (0) - 3 freq peuchled (2) - 1 freq rochled (2) - 2 freq pauchled (2) - 12 freq hochled (2) - 1 freq peched (3) - 39 freq pochlin (3) - 1 freq poached (3) - 4 freq pickled (3) - 10 freq poochle (3) - 2 freq pochlit (3) - 1 freq bachled (3) - 1 freq schuled (4) - 3 freq pechd (4) - 1 freq pochil (4) - 1 freq pochelt (4) - 1 freq pyochered (4) - 3 freq hauchled (4) - 1 freq bauchled (4) - 6 freq rauchled (4) - 1 freq soched (4) - 1 freq pauchler (4) - 1 freq dauchled (4) - 3 freq pauchle (4) - 20 freq fauchled (4) - 1 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 - 35 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 |
POCHLED |
| Time to execute Levenshtein function - 0.358780 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.558103 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.051526 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.038147 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.000818 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. |