| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| randit (0) - 1 freq ryndit (1) - 1 freq handit (1) - 27 freq ranit (1) - 2 freq pandit (1) - 57 freq randie (1) - 8 freq bandit (1) - 7 freq landit (1) - 52 freq rantit (1) - 1 freq raidit (1) - 2 freq rankit (1) - 1 freq brandit (1) - 5 freq mindit (2) - 163 freq hantit (2) - 3 freq addit (2) - 97 freq daudit (2) - 2 freq drankit (2) - 1 freq raxit (2) - 13 freq wanlit (2) - 4 freq braidit (2) - 3 freq daddit (2) - 5 freq rangin (2) - 2 freq bandits (2) - 5 freq raikit (2) - 12 freq rantin (2) - 9 freq |
randit (0) - 1 freq ryndit (1) - 1 freq raidit (2) - 2 freq rankit (2) - 1 freq rantit (2) - 1 freq roondit (2) - 13 freq brandit (2) - 5 freq roundit (2) - 3 freq handit (2) - 27 freq landit (2) - 52 freq pandit (2) - 57 freq ranit (2) - 2 freq bandit (2) - 7 freq randie (2) - 8 freq roadit (3) - 6 freq myndit (3) - 28 freq bondit (3) - 1 freq roddit (3) - 1 freq eyndit (3) - 2 freq sendit (3) - 1 freq runtit (3) - 3 freq tendit (3) - 19 freq mendit (3) - 9 freq pundit (3) - 3 freq rendir (3) - 1 freq |
SoundEx code - R533 rendeition - 1 freq roonded - 13 freq roondit - 13 freq rented - 5 freq ranted - 4 freq rentit - 6 freq roundit - 3 freq roondid - 1 freq rounded - 9 freq roomtytoo - 1 freq rendition - 6 freq rantit - 1 freq reunitet - 1 freq reunited - 1 freq runtit - 3 freq rendeitioun - 1 freq remittit - 1 freq rendeitions - 2 freq randit - 1 freq ryndit - 1 freq reunitit - 1 freq remeidit - 1 freq renditon - 1 freq reuinitit - 1 freq rendeetion - 1 freq roondheads - 1 freq |
MetaPhone code - RNTT roonded - 13 freq roondit - 13 freq rented - 5 freq ranted - 4 freq rentit - 6 freq roundit - 3 freq roondid - 1 freq rounded - 9 freq rantit - 1 freq reunitet - 1 freq reunited - 1 freq runtit - 3 freq randit - 1 freq ryndit - 1 freq reunitit - 1 freq reuinitit - 1 freq |
RANDIT |
| Time to execute Levenshtein function - 0.287411 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.436587 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.029615 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.042546 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.001181 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. |