| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ridbreist (0) - 1 freq reidbreist (1) - 2 freq ruidbreist (1) - 1 freq ruidbreist' (2) - 1 freq reidbriest (3) - 2 freq breist (3) - 69 freq rid-het (4) - 2 freq addresst (4) - 4 freq midmest (4) - 1 freq widest (4) - 3 freq idealist (4) - 1 freq intrist (4) - 1 freq sibbest (4) - 1 freq i'best (4) - 7 freq reservist (4) - 3 freq reformist (4) - 1 freq ridges (4) - 6 freq ridgers (4) - 3 freq rerrest (4) - 1 freq dresst (4) - 10 freq preist (4) - 3 freq hidmaist (4) - 2 freq increst (4) - 1 freq midrit (4) - 1 freq intrest (4) - 10 freq |
ridbreist (0) - 1 freq ruidbreist (1) - 1 freq reidbreist (1) - 2 freq reidbriest (3) - 2 freq ruidbreist' (3) - 1 freq breist (5) - 69 freq radgest (6) - 2 freq breest (6) - 23 freq brest (6) - 1 freq arborist (6) - 1 freq breast (6) - 12 freq diarist (6) - 1 freq arreist (6) - 3 freq redress (6) - 3 freq redirect (6) - 1 freq riders (6) - 8 freq rirst (6) - 1 freq brist (6) - 1 freq rarest (6) - 4 freq heidcrest (6) - 1 freq rerrest (6) - 1 freq ridgers (6) - 3 freq breesty (7) - 1 freq ryders (7) - 1 freq rainforest (7) - 5 freq |
SoundEx code - R316 rid-brick - 4 freq rathfrilan - 4 freq reidbriest - 2 freq reidbreist - 2 freq ruidbreist - 1 freq ruidbreist' - 1 freq ridbreist - 1 freq reidfordshire - 1 freq reid-beirdit - 1 freq radioborders - 4 freq redperoni - 1 freq redbrickz - 1 freq |
MetaPhone code - RTBRST reidbriest - 2 freq reidbreist - 2 freq ruidbreist - 1 freq ruidbreist' - 1 freq ridbreist - 1 freq |
RIDBREIST |
| Time to execute Levenshtein function - 0.447859 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.605571 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.049302 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.038207 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.000833 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. |