| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lowurd (0) - 1 freq lourd (1) - 11 freq loud (2) - 172 freq wourd (2) - 1 freq wurd (2) - 185 freq lowra (2) - 1 freq gourd (2) - 5 freq howard (2) - 4 freq lou'd (2) - 1 freq loued (2) - 14 freq lord (2) - 396 freq lowert (2) - 1 freq pourd (2) - 1 freq lowsed (2) - 72 freq toward (2) - 22 freq loard (2) - 244 freq owur (2) - 1 freq glowerd (2) - 1 freq lowped (2) - 64 freq coward (2) - 12 freq bourd (2) - 1 freq lowry (2) - 2 freq lowers (2) - 6 freq lours (2) - 4 freq lowered (2) - 25 freq |
lowurd (0) - 1 freq lowered (2) - 25 freq lourd (2) - 11 freq coward (3) - 12 freq lowped (3) - 64 freq loard (3) - 244 freq lowry (3) - 2 freq glowerd (3) - 1 freq lowers (3) - 6 freq loured (3) - 4 freq lower (3) - 57 freq lowed (3) - 3 freq toward (3) - 22 freq swurd (3) - 5 freq lowra (3) - 1 freq lowsed (3) - 72 freq wurd (3) - 185 freq lord (3) - 396 freq lowert (3) - 1 freq howard (3) - 4 freq wourd (3) - 1 freq edward (4) - 33 freq laird (4) - 172 freq ward (4) - 89 freq seward (4) - 2 freq |
SoundEx code - L630 lairdie - 3 freq laird - 172 freq lord' - 3 freq 'lord - 8 freq lord - 396 freq lourdie - 2 freq laired - 8 freq lowert - 1 freq lowered - 25 freq lard - 4 freq lourd - 11 freq leered - 1 freq leart - 4 freq lyart - 7 freq lairt - 5 freq loured - 4 freq leared - 1 freq lowerit - 1 freq lrouthie - 1 freq lart - 1 freq loard - 244 freq 'loard - 10 freq loardo - 1 freq loard' - 2 freq 'loard' - 1 freq lured - 2 freq lurid - 1 freq 'lord' - 1 freq layert - 2 freq leirit - 24 freq lowurd - 1 freq layered - 3 freq loert - 2 freq laureate - 3 freq lairit - 1 freq lorde - 4 freq learit - 3 freq €˜laird - 1 freq leired - 1 freq lerrit - 2 freq €œlaird - 2 freq lawert - 1 freq €œlord - 2 freq ‘lurredÂ’ - 1 freq lurredÂ’ - 1 freq lurred - 1 freq “lord - 1 freq |
MetaPhone code - LWRT lowert - 1 freq lowered - 25 freq lowerit - 1 freq lowurd - 1 freq lawert - 1 freq |
LOWURD |
| Time to execute Levenshtein function - 0.315460 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.588286 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.032757 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.105168 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.001032 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. |