| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lyart (0) - 7 freq lart (1) - 1 freq leart (1) - 4 freq lyare (1) - 1 freq part (2) - 188 freq lyall (2) - 9 freq hart (2) - 28 freq smart (2) - 36 freq learn (2) - 287 freq leapt (2) - 11 freq scart (2) - 23 freq lairt (2) - 5 freq dart (2) - 16 freq gart (2) - 158 freq lears (2) - 2 freq lyand (2) - 1 freq lea't (2) - 2 freq soart (2) - 47 freq lya (2) - 1 freq lear (2) - 107 freq bleart (2) - 5 freq layert (2) - 2 freq beart (2) - 1 freq latt (2) - 3 freq lat (2) - 551 freq |
lyart (0) - 7 freq leart (1) - 4 freq lart (1) - 1 freq lairt (2) - 5 freq layert (2) - 2 freq loert (2) - 2 freq learit (2) - 3 freq lyare (2) - 1 freq feart (3) - 537 freq lara (3) - 1 freq loast (3) - 142 freq lark (3) - 23 freq laft (3) - 26 freq apart (3) - 113 freq lare (3) - 7 freq fyrt (3) - 2 freq lapt (3) - 3 freq lozart (3) - 1 freq unlyart (3) - 1 freq leant (3) - 34 freq liar (3) - 24 freq fyert (3) - 2 freq lykit (3) - 5 freq lyft (3) - 2 freq quart (3) - 3 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 - LYRT lyart - 7 freq layert - 2 freq layered - 3 freq |
LYART |
| Time to execute Levenshtein function - 0.393594 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.533127 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.065465 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.039071 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.000804 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. |