| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| driller (0) - 5 freq drifter (2) - 2 freq drills (2) - 14 freq killer (2) - 22 freq roller (2) - 27 freq drill (2) - 51 freq filler (2) - 2 freq grille (2) - 1 freq drillit (2) - 1 freq grilled (2) - 2 freq miller (2) - 56 freq thriller (2) - 1 freq drinker (2) - 7 freq driver (2) - 89 freq dillier (2) - 1 freq traller (2) - 1 freq siller (2) - 759 freq drillin (2) - 13 freq dailer (2) - 1 freq tiller (2) - 12 freq dweller (2) - 2 freq 'siller (2) - 1 freq duller (2) - 2 freq trilled (2) - 1 freq drier (2) - 9 freq |
driller (0) - 5 freq duller (3) - 2 freq dirler (3) - 1 freq dillier (3) - 1 freq traller (3) - 1 freq drillin (3) - 13 freq drillit (3) - 1 freq dweller (3) - 2 freq drillie (3) - 1 freq roller (3) - 27 freq drill (3) - 51 freq drills (3) - 14 freq dollar (4) - 12 freq 'siller (4) - 1 freq dreillin (4) - 1 freq droll (4) - 13 freq dilled (4) - 3 freq drier (4) - 9 freq tiller (4) - 12 freq trilled (4) - 1 freq grilled (4) - 2 freq killer (4) - 22 freq filler (4) - 2 freq grille (4) - 1 freq dailer (4) - 1 freq |
SoundEx code - D646 driller - 5 freq dirler - 1 freq |
MetaPhone code - TRLR trailer - 13 freq driller - 5 freq dirler - 1 freq traller - 1 freq trawler - 3 freq traaler - 3 freq tarlair - 7 freq |
DRILLER |
| Time to execute Levenshtein function - 0.218807 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.328145 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.028047 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.037129 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.000905 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. |