| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pigtails (0) - 13 freq pigtail (1) - 3 freq wagtails (2) - 2 freq pistils (2) - 4 freq pails (3) - 14 freq piktirs (3) - 2 freq petals (3) - 22 freq pintins (3) - 6 freq portals (3) - 1 freq pistil (3) - 3 freq signals (3) - 13 freq wagtail (3) - 5 freq spitals (3) - 1 freq pitril (3) - 7 freq piltiks (3) - 1 freq piarais (3) - 2 freq vitals (3) - 1 freq pincils (3) - 2 freq tails (3) - 53 freq pingils (3) - 1 freq retails (3) - 1 freq pictirs (3) - 3 freq ragnails (3) - 1 freq pithily (3) - 1 freq piggies (3) - 5 freq |
pigtails (0) - 13 freq pigtail (2) - 3 freq pistils (3) - 4 freq wagtails (3) - 2 freq petals (4) - 22 freq pistols (4) - 18 freq portals (4) - 1 freq distils (5) - 2 freq pictirs (5) - 3 freq retails (5) - 1 freq vittals (5) - 2 freq ragnails (5) - 1 freq pieties (5) - 1 freq palatals (5) - 1 freq digitalis (5) - 1 freq vigils (5) - 1 freq pingils (5) - 1 freq details (5) - 70 freq entails (5) - 1 freq piggies (5) - 5 freq pistil (5) - 3 freq wagtail (5) - 5 freq pintins (5) - 6 freq piktirs (5) - 2 freq tails (5) - 53 freq |
SoundEx code - P234 pystle - 2 freq post-lockdoon - 1 freq pistols - 18 freq pistol - 28 freq pestilence - 6 freq pastel-coloured - 1 freq picket-lines - 1 freq pauchtily - 1 freq pigtails - 13 freq pigtail - 3 freq pistoll-shot - 1 freq pickit-lookin - 1 freq piccadilly - 2 freq pecadillos - 1 freq pastel - 2 freq pistil - 3 freq pecht-lik - 1 freq pistils - 4 freq posstal - 1 freq postalveolar - 3 freq postaladdress - 10 freq postal - 3 freq pistoll - 1 freq pechtland - 2 freq pastless - 1 freq pastilles - 1 freq pkdhl - 1 freq postalworkersday - 1 freq |
MetaPhone code - PKTLS pigtails - 13 freq pecadillos - 1 freq |
PIGTAILS |
| Time to execute Levenshtein function - 0.177374 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.383168 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.029417 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.037408 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.000810 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. |