| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reid-heidit (0) - 5 freq rid-heidit (1) - 2 freq reed-heidit (1) - 1 freq reid-haindit (2) - 1 freq reid-beirdit (2) - 1 freq rid-heiddit (2) - 2 freq reid-heided (2) - 3 freq pig-heidit (3) - 1 freq heich-heidit (3) - 6 freq tuim-heidit (3) - 4 freq bee-heidit (3) - 1 freq het-heidit (3) - 1 freq reidheids (3) - 1 freq hail-heidit (3) - 2 freq grey-heidit (3) - 1 freq reid-haundit (3) - 2 freq hie-heidit (3) - 1 freq preen-heidit (3) - 1 freq big-heidit (3) - 3 freq mell-heidit (3) - 1 freq reid-het (3) - 5 freq fair-heidit (3) - 2 freq reid-checkit (3) - 1 freq het-heidet (4) - 1 freq dug-heidit (4) - 2 freq |
reid-heidit (0) - 5 freq reed-heidit (1) - 1 freq rid-heidit (1) - 2 freq reid-heided (3) - 3 freq rid-heiddit (3) - 2 freq reid-haindit (3) - 1 freq reid-haundit (4) - 2 freq reid-het (4) - 5 freq reid-beirdit (4) - 1 freq airy-heidit (5) - 1 freq fair-heidit (5) - 2 freq reed-het (5) - 2 freq rid-het (5) - 2 freq big-heidit (5) - 3 freq reid-hoat (5) - 1 freq reid-hot (5) - 1 freq haurd-heidit (5) - 1 freq red-het (5) - 1 freq het-heidit (5) - 1 freq reidheids (5) - 1 freq bee-heidit (5) - 1 freq tuim-heidit (5) - 4 freq preen-heidit (5) - 1 freq hail-heidit (5) - 2 freq pig-heidit (5) - 1 freq |
SoundEx code - R333 rat-a-tat - 7 freq rid-heidit - 2 freq reid-heided - 3 freq rat-a-tat-tattin - 1 freq reed-heidit - 1 freq radiated - 1 freq rid-heiddit - 2 freq reid-heidit - 5 freq retweeted - 5 freq rootatooed - 1 freq |
MetaPhone code - RTHTT rid-heidit - 2 freq reid-heided - 3 freq reed-heidit - 1 freq rid-heiddit - 2 freq reid-heidit - 5 freq |
REID-HEIDIT |
| Time to execute Levenshtein function - 0.393001 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.587243 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.060934 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.039481 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.000897 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. |