| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dirls (0) - 7 freq dirlt (1) - 4 freq dirks (1) - 4 freq dirl (1) - 45 freq dials (1) - 11 freq nirls (1) - 1 freq girls (1) - 58 freq dirs (1) - 28 freq birls (1) - 31 freq dir's (1) - 6 freq diels (1) - 2 freq pirls (1) - 4 freq tirls (1) - 4 freq dirts (1) - 1 freq dills (1) - 1 freq viris (2) - 1 freq hills (2) - 242 freq tirvs (2) - 1 freq fir's (2) - 3 freq dirt (2) - 69 freq airly (2) - 20 freq worls (2) - 5 freq lirks (2) - 3 freq wirds (2) - 868 freq pirl (2) - 7 freq |
dirls (0) - 7 freq diels (2) - 2 freq dir's (2) - 6 freq tirls (2) - 4 freq dirts (2) - 1 freq dills (2) - 1 freq birls (2) - 31 freq pirls (2) - 4 freq dirlt (2) - 4 freq dirks (2) - 4 freq dirs (2) - 28 freq dials (2) - 11 freq dirl (2) - 45 freq nirls (2) - 1 freq girls (2) - 58 freq dalls (3) - 1 freq dares (3) - 5 freq dores (3) - 1 freq daels (3) - 9 freq burls (3) - 5 freq warls (3) - 4 freq barls (3) - 1 freq pairls (3) - 4 freq tirlis (3) - 1 freq dreils (3) - 1 freq |
SoundEx code - D642 doorlike - 1 freq dour-like - 1 freq dourles - 4 freq dreels - 11 freq dirls - 7 freq drools - 1 freq drills - 14 freq dearleukin - 1 freq diarie-like - 1 freq derelict - 2 freq day-release - 1 freq dreils - 1 freq doorless - 1 freq dearly-kent - 1 freq dereliction - 1 freq derhawlish - 1 freq drillclarabelle - 1 freq darealakinfenwa - 1 freq |
MetaPhone code - TRLS trial's - 14 freq trials - 18 freq trellis - 1 freq dourles - 4 freq dreels - 11 freq trails - 13 freq dirls - 7 freq tirlis - 1 freq 'troilus - 1 freq tirls - 4 freq drools - 1 freq drills - 14 freq trolleys - 4 freq treeless - 3 freq day-release - 1 freq trawls - 2 freq dreils - 1 freq trills - 2 freq doorless - 1 freq trollies - 1 freq trolls - 6 freq tireless - 1 freq trials- - 1 freq trail's - 1 freq |
DIRLS |
| Time to execute Levenshtein function - 0.192489 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.391675 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.029482 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.038257 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.000889 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. |