| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| queelrods (0) - 3 freq queelrod (1) - 6 freq squeers (4) - 1 freq queereye (4) - 1 freq queestions (4) - 4 freq queelin (4) - 1 freq culross (4) - 2 freq jeelous (4) - 5 freq quells (4) - 1 freq queets (4) - 6 freq feelds (4) - 1 freq quebecois (4) - 1 freq queerer (4) - 2 freq heelands (4) - 1 freq queen's (4) - 55 freq queer (4) - 146 freq numerous (4) - 8 freq queen'd (4) - 1 freq queerest (4) - 6 freq queeried (4) - 3 freq eebroos (4) - 20 freq squeeled (4) - 1 freq queerie (4) - 8 freq sheelds (4) - 1 freq queens (4) - 40 freq |
queelrods (0) - 3 freq queelrod (2) - 6 freq railroads (6) - 1 freq querious (6) - 2 freq heelands (6) - 1 freq feelds (6) - 1 freq queeried (6) - 3 freq queries (6) - 1 freq melrois (6) - 1 freq quells (6) - 1 freq eelids (6) - 2 freq culross (6) - 2 freq weelads (6) - 1 freq quail's (7) - 2 freq eairds (7) - 2 freq melrose (7) - 6 freq beards (7) - 12 freq cerds (7) - 1 freq steroids (7) - 6 freq rewards (7) - 6 freq yields (7) - 3 freq rulers (7) - 8 freq periods (7) - 17 freq uplands (7) - 2 freq bleeds (7) - 6 freq |
SoundEx code - Q463 queelrod - 6 freq queelrods - 3 freq |
MetaPhone code - KLRTS clarts - 2 freq queelrods - 3 freq clairts - 1 freq |
QUEELRODS |
| Time to execute Levenshtein function - 0.206536 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.372132 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.027905 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.038359 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.000944 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. |