| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bagpipes (0) - 10 freq bagpiper (1) - 2 freq bagpipe (1) - 1 freq bagpipers (1) - 1 freq bagpie (2) - 1 freq magpies (2) - 1 freq bagpype's (2) - 1 freq blawpipes (2) - 2 freq baggies (2) - 7 freq bathites (3) - 1 freq banties (3) - 1 freq nappies (3) - 9 freq bogies (3) - 3 freq buggies (3) - 3 freq i'pipes (3) - 1 freq baddies (3) - 3 freq bawties (3) - 2 freq cappies (3) - 1 freq vampires (3) - 8 freq raipes (3) - 1 freq bandies (3) - 1 freq bappie (3) - 1 freq baines (3) - 1 freq pipes (3) - 91 freq blawpipe (3) - 1 freq |
bagpipes (0) - 10 freq bagpipers (2) - 1 freq bagpipe (2) - 1 freq bagpiper (2) - 2 freq bagpype's (3) - 1 freq baggies (4) - 7 freq blawpipes (4) - 2 freq bagpie (4) - 1 freq magpies (4) - 1 freq gappus (5) - 3 freq cappies (5) - 1 freq bappie (5) - 1 freq pipes (5) - 91 freq mappies (5) - 13 freq gappas (5) - 2 freq i'pipes (5) - 1 freq glipes (5) - 8 freq bogies (5) - 3 freq nappies (5) - 9 freq buggies (5) - 3 freq bampots (6) - 8 freq gypes (6) - 17 freq byganes (6) - 2 freq popes (6) - 1 freq cuppies (6) - 1 freq |
SoundEx code - B211 bagpipers - 1 freq bagpype's - 1 freq bagpiper - 2 freq bagpipe - 1 freq bagpipes - 10 freq bjfef - 1 freq |
MetaPhone code - BKPPS bagpype's - 1 freq bagpipes - 10 freq |
BAGPIPES |
| Time to execute Levenshtein function - 0.177175 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.323641 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.027245 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.036811 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.000876 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. |