Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lurdan (0) - 1 freq lurgan (1) - 2 freq lurkan (1) - 2 freq lullan (2) - 1 freq lukan (2) - 5 freq surfan (2) - 1 freq landan (2) - 2 freq lustan (2) - 1 freq lukkan (2) - 49 freq curran (2) - 2 freq lucan (2) - 2 freq turban (2) - 4 freq duran (2) - 3 freq hurtan (2) - 1 freq louran (2) - 1 freq herdan (2) - 1 freq wurkan (2) - 2 freq loddan (2) - 1 freq murnan (2) - 2 freq luckan (2) - 3 freq burnan (2) - 7 freq purran (2) - 3 freq 'urban (2) - 1 freq urban (2) - 42 freq curvan (2) - 1 freq |
lurdan (0) - 1 freq lurgan (2) - 2 freq lurkan (2) - 2 freq lundon (3) - 2 freq laran (3) - 2 freq loddan (3) - 1 freq leadan (3) - 5 freq wurdin (3) - 1 freq jordan (3) - 52 freq dirdan (3) - 1 freq lundin (3) - 1 freq herdan (3) - 1 freq lurkin (3) - 13 freq burden (3) - 24 freq gordan (3) - 1 freq landan (3) - 2 freq louran (3) - 1 freq gerden (4) - 4 freq lardit (4) - 1 freq hirdin (4) - 4 freq lourin (4) - 8 freq lerbin (4) - 2 freq raedan (4) - 1 freq bardin (4) - 1 freq jardin (4) - 2 freq |
SoundEx code - L635 lurdan - 1 freq lear-time - 4 freq lordmcconnell - 2 freq lordmayors - 1 freq lordimmunitas - 2 freq |
MetaPhone code - LRTN lurdan - 1 freq |
LURDAN |
Time to execute Levenshtein function - 0.228621 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.364213 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.027399 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.037642 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.000941 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. |