| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| piebald (0) - 1 freq pinball (2) - 1 freq piead (2) - 1 freq petal (3) - 11 freq herald (3) - 34 freq pitbull (3) - 1 freq pueblo (3) - 1 freq petard (3) - 1 freq bald (3) - 18 freq haerald (3) - 1 freq peeble (3) - 1 freq peebly (3) - 2 freq pied (3) - 4 freq nibals (3) - 1 freq field (3) - 230 freq pedals (3) - 3 freq niemand (3) - 1 freq plead (3) - 6 freq pierced (3) - 11 freq hieland (3) - 16 freq emerald (3) - 17 freq wield (3) - 2 freq bield (3) - 52 freq iqbal (3) - 49 freq peard (3) - 1 freq |
piebald (0) - 1 freq bald (4) - 18 freq peeble (4) - 1 freq peebly (4) - 2 freq plead (4) - 6 freq pueblo (4) - 1 freq bield (4) - 52 freq pinball (4) - 1 freq piead (4) - 1 freq reibald (4) - 1 freq appealed (5) - 7 freq baald (5) - 1 freq pilled (5) - 3 freq baled (5) - 2 freq pbl (5) - 1 freq piled (5) - 19 freq baldy (5) - 35 freq pablo (5) - 2 freq bld (5) - 1 freq pleyed (5) - 16 freq 'bold (5) - 1 freq plaid (5) - 23 freq upheld (5) - 6 freq puld (5) - 6 freq bieldy (5) - 6 freq |
SoundEx code - P143 piebald - 1 freq population - 85 freq populate - 3 freq populations - 9 freq populatit - 1 freq pappled - 2 freq pebbledash - 1 freq peeble-dash - 1 freq populated - 2 freq populatioun - 1 freq |
MetaPhone code - PBLT piebald - 1 freq |
PIEBALD |
| Time to execute Levenshtein function - 0.202222 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.370704 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.028499 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.038373 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.000917 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. |