| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lordlins (0) - 1 freq lordlie (2) - 1 freq codlins (2) - 4 freq lordis (2) - 3 freq norlins (2) - 1 freq yorlins (2) - 3 freq yirdlins (2) - 1 freq gorblins (2) - 1 freq lodgins (2) - 1 freq darlins (3) - 4 freq lowdin (3) - 1 freq lollies (3) - 2 freq portling (3) - 1 freq perlins (3) - 3 freq loudens (3) - 1 freq yerlins (3) - 1 freq lord's (3) - 26 freq mornins (3) - 35 freq origins (3) - 20 freq hiddlins (3) - 1 freq loweins (3) - 1 freq landins (3) - 3 freq ootlins (3) - 3 freq howdlin (3) - 1 freq hurdlin (3) - 1 freq |
lordlins (0) - 1 freq yirdlins (3) - 1 freq gorblins (4) - 1 freq yorlins (4) - 3 freq lodgins (4) - 1 freq lordlie (4) - 1 freq norlins (4) - 1 freq codlins (4) - 4 freq lordis (4) - 3 freq barelins (5) - 1 freq wordless (5) - 3 freq forderins (5) - 3 freq yirlins (5) - 1 freq ludgins (5) - 8 freq fardins (5) - 1 freq herdins (5) - 3 freq landline (5) - 1 freq hidlins (5) - 10 freq lendins (5) - 1 freq derklins (5) - 2 freq birlins (5) - 1 freq middlins (5) - 2 freq roadins (5) - 3 freq norlans (5) - 1 freq littlins (5) - 25 freq |
SoundEx code - L634 lairdie-like - 1 freq loard'll - 2 freq lairdly - 2 freq lordlie - 1 freq lairdlie - 1 freq lordlins - 1 freq lourdlie - 1 freq lauraewaddell - 1 freq |
MetaPhone code - LRTLNS lordlins - 1 freq |
LORDLINS |
| Time to execute Levenshtein function - 0.525108 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.684784 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.027484 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.070119 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.000898 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. |