Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
reid-haundit (0) - 2 freq reid-haindit (1) - 1 freq reidhaundit (1) - 1 freq ker-haundit (3) - 1 freq heid-huntit (3) - 1 freq rid-haunded (3) - 1 freq reid-heidit (3) - 5 freq tuim-haundit (3) - 1 freq corrie-haundit (4) - 1 freq richthaundit (4) - 2 freq heich-haunit (4) - 1 freq rid-heiddit (4) - 2 freq teem-handit (4) - 1 freq rid-baunded (4) - 1 freq twa-haundit (4) - 3 freq open-haundit (4) - 1 freq richt-haundit (4) - 2 freq rid-heidit (4) - 2 freq evenhaundit (4) - 1 freq reid-beirdit (4) - 1 freq in-hauddit (4) - 1 freq reed-heidit (4) - 1 freq hook-haundit (4) - 17 freq up-hauddit (5) - 1 freq weill-roundit (5) - 1 freq |
reid-haundit (0) - 2 freq reid-haindit (1) - 1 freq reidhaundit (2) - 1 freq reid-heidit (4) - 5 freq rid-haunded (4) - 1 freq rid-heidit (5) - 2 freq reed-heidit (5) - 1 freq rid-heiddit (5) - 2 freq heid-huntit (5) - 1 freq tuim-haundit (5) - 1 freq ker-haundit (5) - 1 freq reid-beirdit (6) - 1 freq hook-haundit (6) - 17 freq corrie-haundit (6) - 1 freq open-haundit (6) - 1 freq twa-haundit (6) - 3 freq rid-baunded (6) - 1 freq teem-handit (6) - 1 freq reid-heided (7) - 3 freq reid-hoat (7) - 1 freq reed-bleedit (7) - 1 freq reid-het (7) - 5 freq reid-hot (7) - 1 freq twa-handit (7) - 1 freq in-hauddit (7) - 1 freq |
SoundEx code - R353 road-end - 3 freq reid-haundit - 2 freq reidhaundit - 1 freq redeemed - 5 freq rithmatick - 3 freq readmitted - 1 freq readmittance - 1 freq rodent - 4 freq rodents - 2 freq reddened - 1 freq rationed - 4 freq ready-made - 3 freq radiant - 5 freq rid-haunded - 1 freq redundant - 5 freq reedened - 4 freq reid-haindit - 1 freq redundancy - 3 freq raeddened - 1 freq redeemit - 1 freq rydand - 2 freq redoundand - 1 freq reident - 2 freq rotund - 1 freq retained - 2 freq redandwhite - 1 freq redtintedglasses - 1 freq rtomdavies - 1 freq |
MetaPhone code - RTHNTT reid-haundit - 2 freq reidhaundit - 1 freq rid-haunded - 1 freq reid-haindit - 1 freq |
REID-HAUNDIT |
Time to execute Levenshtein function - 0.301057 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.473382 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.030766 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.043255 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.000970 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. |