| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| loreburn (0) - 2 freq lowrenburn (2) - 1 freq fireburn (2) - 1 freq lovebairn (3) - 1 freq hertburn (3) - 2 freq forewurd (3) - 1 freq lisburn (3) - 1 freq return (3) - 132 freq woburn (3) - 1 freq forenuin (3) - 11 freq oneborn (3) - 1 freq forewarn (3) - 1 freq raeburn (3) - 1 freq reborn (3) - 7 freq moorburn (3) - 1 freq cockburn (3) - 9 freq holburn (3) - 3 freq moredun (3) - 1 freq woodburn (3) - 3 freq coburn (3) - 3 freq louin (4) - 1 freq careworn (4) - 1 freq lowen (4) - 2 freq forearm (4) - 1 freq lorry (4) - 14 freq |
loreburn (0) - 2 freq fireburn (3) - 1 freq raeburn (4) - 1 freq moorburn (4) - 1 freq reborn (4) - 7 freq lisburn (4) - 1 freq lovebairn (4) - 1 freq lowrenburn (4) - 1 freq holburn (5) - 3 freq coburn (5) - 3 freq lorrain (5) - 1 freq lerbin (5) - 2 freq rayburn (5) - 1 freq woodburn (5) - 3 freq forewarn (5) - 1 freq hertburn (5) - 2 freq freeborn (5) - 1 freq woburn (5) - 1 freq larbert (5) - 2 freq oneborn (5) - 1 freq return (5) - 132 freq hairtburn (6) - 1 freq lorraine (6) - 6 freq lorn (6) - 1 freq owerturn (6) - 2 freq |
SoundEx code - L616 loreburn - 2 freq loor-broo - 1 freq larbert - 2 freq laurforsy - 1 freq larberthigh - 1 freq |
MetaPhone code - LRBRN loreburn - 2 freq |
LOREBURN |
| Time to execute Levenshtein function - 0.205951 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.349416 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.029392 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.037171 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.000890 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. |