| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| draabore (0) - 1 freq draaars (3) - 1 freq draar (3) - 6 freq draabaak (3) - 1 freq draabak (3) - 1 freq draaback (3) - 2 freq cranmore (3) - 1 freq dromore (3) - 1 freq draaer (3) - 2 freq twalbore (3) - 1 freq draars (3) - 37 freq draaers (3) - 3 freq aaber (4) - 22 freq drainer (4) - 2 freq crabbie (4) - 2 freq laebor (4) - 1 freq macabre (4) - 1 freq drawrs (4) - 1 freq atore (4) - 2 freq arable (4) - 8 freq crawfor (4) - 1 freq draigons (4) - 5 freq abort (4) - 3 freq dratsie (4) - 1 freq chambord (4) - 2 freq |
draabore (0) - 1 freq draaer (4) - 2 freq draabak (4) - 1 freq dromore (4) - 1 freq draar (4) - 6 freq draabaak (4) - 1 freq draper (5) - 2 freq drahr (5) - 1 freq dreary (5) - 13 freq dramer (5) - 2 freq drear (5) - 10 freq drearie (5) - 1 freq traber (5) - 1 freq draver (5) - 2 freq drawer (5) - 132 freq druiblie (5) - 1 freq dreamer (5) - 2 freq drar (5) - 1 freq draaers (5) - 3 freq draars (5) - 37 freq dabber (5) - 3 freq drainer (5) - 2 freq draaars (5) - 1 freq draaback (5) - 2 freq dreeble (5) - 1 freq |
SoundEx code - D616 drawbrig - 1 freq drapers - 1 freq driver - 92 freq drap-ripe - 4 freq drivers - 24 freq drappr - 1 freq drover - 1 freq driver's - 9 freq d'urbervilles - 1 freq dreeprt - 1 freq dryborough - 1 freq drapper - 1 freq dryvar - 1 freq drivers' - 1 freq draver's - 1 freq draver - 2 freq dhriver - 1 freq draper - 2 freq dryvers - 1 freq draw-brig - 1 freq drovers - 2 freq dreiver - 1 freq €œdriver - 1 freq darfur - 1 freq draabore - 1 freq driverminnie - 3 freq drbrooski - 1 freq dorriefraser - 2 freq |
MetaPhone code - TRBR traber - 1 freq draabore - 1 freq |
DRAABORE |
| Time to execute Levenshtein function - 0.235339 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.473387 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.032427 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.044582 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.001178 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. |