| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reidbreist (0) - 2 freq ridbreist (1) - 1 freq ruidbreist (1) - 1 freq ruidbreist' (2) - 1 freq reidbriest (2) - 2 freq heidcrest (3) - 1 freq reident (4) - 2 freq reid-heidit (4) - 5 freq heiddress (4) - 1 freq deid-kist (4) - 3 freq reidheids (4) - 1 freq reidness (4) - 1 freq reformist (4) - 1 freq deidliest (4) - 1 freq zeitgeist (4) - 1 freq heidmaist (4) - 40 freq reid-het (4) - 5 freq rerrest (4) - 1 freq redress (4) - 3 freq redirect (4) - 1 freq leid-kist (4) - 2 freq breist (4) - 69 freq deidkist (4) - 2 freq reservist (4) - 3 freq eldest (5) - 18 freq |
reidbreist (0) - 2 freq ruidbreist (1) - 1 freq ridbreist (1) - 1 freq reidbriest (2) - 2 freq ruidbreist' (3) - 1 freq heidcrest (5) - 1 freq breist (6) - 69 freq redress (6) - 3 freq redirect (6) - 1 freq rerrest (6) - 1 freq brist (7) - 1 freq arreist (7) - 3 freq rarest (7) - 4 freq rirst (7) - 1 freq heidfirst (7) - 2 freq reederse (7) - 3 freq radgest (7) - 2 freq diarist (7) - 1 freq ridgers (7) - 3 freq readers' (7) - 2 freq redars (7) - 1 freq redgrass (7) - 1 freq breast (7) - 12 freq readers (7) - 88 freq riders (7) - 8 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 |
REIDBREIST |
| Time to execute Levenshtein function - 0.241118 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.415021 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.027859 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.037154 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.000850 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. |