| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dirler (0) - 1 freq dirled (1) - 11 freq dither (2) - 2 freq durer (2) - 1 freq dailer (2) - 1 freq dialec (2) - 2 freq mirled (2) - 2 freq firmer (2) - 4 freq dirlt (2) - 4 freq hitler (2) - 10 freq dirlin (2) - 45 freq biler (2) - 8 freq direk (2) - 2 freq diner (2) - 1 freq girder (2) - 2 freq differ (2) - 135 freq dirl't (2) - 1 freq drier (2) - 9 freq filler (2) - 2 freq dairker (2) - 1 freq dire (2) - 9 freq mirker (2) - 1 freq girner (2) - 1 freq dirls (2) - 7 freq dibber (2) - 2 freq |
dirler (0) - 1 freq dirled (2) - 11 freq dazler (3) - 2 freq duller (3) - 2 freq dirlit (3) - 1 freq darker (3) - 9 freq dirls (3) - 7 freq dealer (3) - 15 freq darger (3) - 2 freq dirl (3) - 46 freq airlier (3) - 16 freq dillier (3) - 1 freq dirlan (3) - 3 freq dormer (3) - 2 freq dueler (3) - 1 freq derker (3) - 7 freq driller (3) - 5 freq dryer (3) - 5 freq dairker (3) - 1 freq parler (3) - 2 freq dirlin (3) - 45 freq dirlt (3) - 4 freq dailer (3) - 1 freq drier (3) - 9 freq durer (3) - 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 |
DIRLER |
| Time to execute Levenshtein function - 0.907526 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 - 1.421860 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.093671 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.195801 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.000852 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. |