Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
peuchled (0) - 1 freq pauchled (1) - 12 freq bauchled (2) - 6 freq seuched (2) - 1 freq hauchled (2) - 1 freq pauchle (2) - 20 freq heuched (2) - 1 freq rauchled (2) - 1 freq dauchled (2) - 3 freq pauchler (2) - 1 freq fauchled (2) - 1 freq leuched (2) - 1 freq pochled (2) - 3 freq peched (2) - 39 freq yeuched (2) - 2 freq teuched (2) - 4 freq perched (2) - 20 freq sprauchled (3) - 7 freq reeched (3) - 1 freq teached (3) - 8 freq peeled (3) - 17 freq pucked (3) - 1 freq puckles (3) - 14 freq pulled (3) - 174 freq trachled (3) - 5 freq |
peuchled (0) - 1 freq pauchled (1) - 12 freq pochled (2) - 3 freq peched (3) - 39 freq pauchler (3) - 1 freq fauchled (3) - 1 freq rauchled (3) - 1 freq dauchled (3) - 3 freq bauchled (3) - 6 freq hauchled (3) - 1 freq pauchle (3) - 20 freq hochled (4) - 1 freq poochle (4) - 2 freq pickled (4) - 10 freq bachled (4) - 1 freq pauchlin (4) - 17 freq rochled (4) - 2 freq pechd (4) - 1 freq poached (4) - 4 freq yeuched (4) - 2 freq leuched (4) - 1 freq heuched (4) - 1 freq seuched (4) - 1 freq teuched (4) - 4 freq perched (4) - 20 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 |
PEUCHLED |
Time to execute Levenshtein function - 0.411122 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.624114 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.058911 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.038809 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.000907 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. |