| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ladrons (0) - 1 freq hadrons (1) - 1 freq lagoons (2) - 1 freq larns (2) - 1 freq bawdrons (2) - 3 freq sudrons (2) - 3 freq barons (2) - 3 freq laerns (2) - 4 freq baudrons (2) - 38 freq lavroos (2) - 1 freq aaprons (2) - 1 freq patrons (2) - 4 freq aprons (2) - 1 freq lairns (2) - 7 freq laroch (3) - 1 freq tarns (3) - 1 freq yarns (3) - 28 freq lodgins (3) - 1 freq marone (3) - 1 freq lairne (3) - 2 freq herons (3) - 3 freq learns (3) - 10 freq parins (3) - 3 freq laern (3) - 13 freq laveroks (3) - 1 freq |
ladrons (0) - 1 freq hadrons (2) - 1 freq laerns (3) - 4 freq sudrons (3) - 3 freq lairns (3) - 7 freq baudrons (3) - 38 freq larns (3) - 1 freq drones (4) - 14 freq ludgins (4) - 8 freq lydians (4) - 1 freq baudrans (4) - 1 freq droons (4) - 4 freq drouns (4) - 1 freq cauldrons (4) - 2 freq modrens (4) - 5 freq adorns (4) - 2 freq darns (4) - 1 freq learns (4) - 10 freq aprons (4) - 1 freq patrons (4) - 4 freq lodgins (4) - 1 freq aaprons (4) - 1 freq lavroos (4) - 1 freq barons (4) - 3 freq lagoons (4) - 1 freq |
SoundEx code - L365 lettern - 1 freq leatherin - 6 freq leathern - 3 freq lowderin - 1 freq laithern - 1 freq lothiorien - 1 freq letterman - 1 freq letterin - 6 freq ludderin - 1 freq ladrons - 1 freq litterin - 1 freq lewderin - 1 freq lutheran - 1 freq loiterin - 3 freq lettering - 2 freq latharna - 6 freq latrines - 3 freq lettermore - 1 freq lotternine - 1 freq littering - 1 freq latraynor - 1 freq leatherman - 1 freq |
MetaPhone code - LTRNS ladrons - 1 freq latrines - 3 freq |
LADRONS |
| Time to execute Levenshtein function - 0.300274 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.605236 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.028231 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.038932 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.000846 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. |