| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| layered (0) - 3 freq ayered (1) - 1 freq watered (2) - 6 freq papered (2) - 1 freq havered (2) - 7 freq labored (2) - 1 freq laired (2) - 8 freq levered (2) - 3 freq faered (2) - 20 freq tasered (2) - 1 freq layert (2) - 2 freq blazered (2) - 1 freq laabered (2) - 1 freq capered (2) - 4 freq layerin (2) - 1 freq laernd (2) - 1 freq tapered (2) - 2 freq lowered (2) - 25 freq davered (2) - 1 freq layers (2) - 21 freq launered (2) - 1 freq slavered (2) - 3 freq layer (2) - 15 freq laggered (2) - 2 freq leered (2) - 1 freq |
layered (0) - 3 freq leered (2) - 1 freq laired (2) - 8 freq ayered (2) - 1 freq layer (3) - 15 freq layers (3) - 21 freq lowered (3) - 25 freq laerned (3) - 9 freq launered (3) - 1 freq leared (3) - 1 freq loured (3) - 4 freq lured (3) - 2 freq lard (3) - 4 freq laird (3) - 173 freq leired (3) - 1 freq layed (3) - 16 freq faered (3) - 20 freq levered (3) - 3 freq laernd (3) - 1 freq layert (3) - 2 freq labored (3) - 1 freq laabered (3) - 1 freq layerin (3) - 1 freq leeved (4) - 55 freq alerted (4) - 2 freq |
SoundEx code - L630 lairdie - 3 freq laird - 173 freq lord' - 3 freq 'lord - 8 freq lord - 404 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 lairit - 2 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 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 |
LAYERED |
| Time to execute Levenshtein function - 0.182970 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.386337 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.028184 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.038083 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.000963 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. |