| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| doggerel (0) - 2 freq dogger (2) - 1 freq baggerel (2) - 1 freq doggedly (3) - 1 freq cockerel (3) - 5 freq doggie (3) - 3 freq dogged (3) - 3 freq dagger (3) - 4 freq laggered (3) - 2 freq daggers (3) - 12 freq jiggered (3) - 3 freq dodgers (3) - 2 freq mongrel (3) - 4 freq jogger (3) - 1 freq loggers (3) - 1 freq dodger (3) - 5 freq buggered (3) - 13 freq logger (3) - 1 freq doggies (3) - 1 freq beggerey (3) - 23 freq dovered (3) - 6 freq mungerel (3) - 1 freq diggers (3) - 1 freq dongerees (3) - 1 freq hotterel (3) - 1 freq |
doggerel (0) - 2 freq baggerel (3) - 1 freq dogger (3) - 1 freq daggers (4) - 12 freq diggers (4) - 1 freq digger (4) - 12 freq dagger (4) - 4 freq doggedly (4) - 1 freq mungerel (5) - 1 freq doggitly (5) - 1 freq beggerey (5) - 23 freq dongerees (5) - 1 freq joggers (5) - 1 freq loggarly (5) - 1 freq diggle (5) - 1 freq logger (5) - 1 freq doggies (5) - 1 freq jiggered (5) - 3 freq laggered (5) - 2 freq buggered (5) - 13 freq doggie (5) - 3 freq dodgers (5) - 2 freq dogged (5) - 3 freq loggers (5) - 1 freq mongrel (5) - 4 freq |
SoundEx code - D264 doggerland - 2 freq doggerel - 2 freq |
MetaPhone code - TKRL doggerel - 2 freq |
DOGGEREL |
| Time to execute Levenshtein function - 0.247603 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.438867 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.031034 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.042086 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.001104 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. |