| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pikkilt (0) - 1 freq pikkil (1) - 2 freq pikkit (1) - 1 freq rikkil (2) - 3 freq pickit (2) - 80 freq pickelt (2) - 3 freq pikit (2) - 1 freq likkit (2) - 2 freq spikkit (2) - 1 freq pokkit (2) - 1 freq kikkit (2) - 1 freq sikkit (2) - 1 freq pickult (2) - 4 freq pikkin (2) - 1 freq rikkit (2) - 3 freq wikkit (2) - 5 freq pukkil (2) - 5 freq pikket (2) - 3 freq kekkilt (2) - 1 freq pingilt (2) - 1 freq rakkil (3) - 1 freq pikken (3) - 6 freq wickit (3) - 36 freq akkit (3) - 1 freq poukit (3) - 7 freq |
pikkilt (0) - 1 freq pikkil (2) - 2 freq pikkit (2) - 1 freq pukkil (3) - 5 freq pokkit (3) - 1 freq pikket (3) - 3 freq pickult (3) - 4 freq kekkilt (3) - 1 freq pickelt (3) - 3 freq pukkul (4) - 5 freq rikkit (4) - 3 freq wikkit (4) - 5 freq pikkin (4) - 1 freq pingilt (4) - 1 freq rikkil (4) - 3 freq pickit (4) - 80 freq pikit (4) - 1 freq likkit (4) - 2 freq kikkit (4) - 1 freq spikkit (4) - 1 freq sikkit (4) - 1 freq pikk (5) - 3 freq shakkilt (5) - 1 freq piggilty (5) - 1 freq fickelt (5) - 4 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 - PKLT puggl't - 1 freq puggelt - 2 freq pickled - 10 freq puggled - 21 freq packload - 1 freq piggledy - 1 freq pickult - 4 freq pickelt - 3 freq pickl't - 1 freq pikkilt - 1 freq pugglit - 1 freq piggilty - 1 freq pglet - 5 freq |
PIKKILT |
| Time to execute Levenshtein function - 0.204464 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.340211 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.027780 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.037110 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.000916 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. |