| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reidfordshire (0) - 1 freq oxfordshire (4) - 1 freq renfrewshire (5) - 6 freq redandwhite (6) - 1 freq twittershire (6) - 1 freq lordshipe (6) - 3 freq berkshire (6) - 4 freq fifeshire (6) - 1 freq refreshin (6) - 6 freq redrichie (6) - 1 freq reinforcin (6) - 2 freq readership (6) - 3 freq foreshore (6) - 3 freq selkirkshire (6) - 1 freq yorkshire (6) - 24 freq refreshing (6) - 4 freq farfarshire (6) - 1 freq devonshire (6) - 1 freq forfarshire (6) - 1 freq reinforce (6) - 6 freq englandshire (6) - 5 freq wigtownshire (6) - 1 freq birdshite (6) - 2 freq roadside (7) - 14 freq reformin (7) - 3 freq |
reidfordshire (0) - 1 freq oxfordshire (6) - 1 freq renfrewshire (7) - 6 freq readership (9) - 3 freq foreshore (9) - 3 freq farfarshire (9) - 1 freq forfarshire (9) - 1 freq refreshin (9) - 6 freq englandshire (10) - 5 freq refraishit (10) - 2 freq dreerieshire (10) - 4 freq birdshite (10) - 2 freq refresh (10) - 2 freq refreshes (10) - 1 freq refreshed (10) - 2 freq dunfrieshire (10) - 1 freq devonshire (10) - 1 freq dumfrieshire (10) - 1 freq fifeshire (10) - 1 freq redrichie (10) - 1 freq redandwhite (10) - 1 freq berkshire (10) - 4 freq lordshipe (10) - 3 freq refreshing (10) - 4 freq yorkshire (10) - 24 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 - RTFRTXR reidfordshire - 1 freq |
REIDFORDSHIRE |
| Time to execute Levenshtein function - 0.229388 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.468253 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.028432 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.037762 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.000961 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. |