| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| legless (0) - 3 freq sealess (2) - 1 freq leafless (2) - 4 freq lawless (2) - 4 freq glegness (2) - 7 freq cenless (2) - 1 freq fekless (2) - 1 freq egress (2) - 2 freq gless (2) - 395 freq enless (2) - 12 freq kerless (2) - 1 freq regress (2) - 1 freq nebless (2) - 1 freq jagless (2) - 3 freq leegs (3) - 1 freq clueless (3) - 5 freq gess (3) - 1 freq hapless (3) - 11 freq fendless (3) - 1 freq leetlest (3) - 1 freq legged (3) - 10 freq ageless (3) - 5 freq wanless (3) - 3 freq neglek (3) - 2 freq gutless (3) - 1 freq |
legless (0) - 3 freq jagless (3) - 3 freq lawless (3) - 4 freq gless (3) - 395 freq leafless (3) - 4 freq oorgless (4) - 1 freq glaess (4) - 1 freq guiless (4) - 1 freq ageless (4) - 5 freq gloss (4) - 7 freq giless (4) - 4 freq haagless (4) - 1 freq gliss (4) - 1 freq lifeless (4) - 7 freq luveless (4) - 1 freq lairless (4) - 1 freq glass (4) - 80 freq bugloss (4) - 1 freq glessy (4) - 1 freq regress (4) - 1 freq cenless (4) - 1 freq fekless (4) - 1 freq kerless (4) - 1 freq enless (4) - 12 freq nebless (4) - 1 freq |
SoundEx code - L242 locals - 39 freq locals' - 1 freq lochalsh - 1 freq laich-liggin - 1 freq lookalike - 2 freq localised - 8 freq localism - 1 freq lookalikie - 1 freq look-alikes - 1 freq lugholes - 1 freq legless - 3 freq locails - 2 freq luckless - 2 freq lauch-lauchin - 1 freq less-weil-kent - 1 freq lassie-like - 1 freq lowe-clok - 1 freq localspace - 1 freq localisation - 4 freq luik-alike - 1 freq lokals - 1 freq lzals - 1 freq lclq - 1 freq lqlg - 1 freq leakylike - 1 freq ljeeulgf - 1 freq |
MetaPhone code - LKLS locals - 39 freq locals' - 1 freq legless - 3 freq locails - 2 freq luckless - 2 freq lokals - 1 freq |
LEGLESS |
| Time to execute Levenshtein function - 0.203649 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.381911 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.028522 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.038341 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.000869 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. |