| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| legends (0) - 36 freq leigends (1) - 1 freq legend (1) - 92 freq lends (2) - 9 freq leigend (2) - 1 freq depends (2) - 38 freq leven's (2) - 2 freq defends (2) - 1 freq leeds (2) - 9 freq legs (3) - 379 freq meens (3) - 3 freq leen (3) - 18 freq leggid (3) - 1 freq gengs (3) - 15 freq attends (3) - 1 freq geens (3) - 1 freq tiends (3) - 1 freq ingens (3) - 1 freq fiends (3) - 2 freq beens (3) - 35 freq defend (3) - 23 freq reeds (3) - 16 freq leans (3) - 17 freq peden's (3) - 1 freq helen's (3) - 3 freq |
legends (0) - 36 freq leigends (1) - 1 freq legend (2) - 92 freq leigend (3) - 1 freq lends (3) - 9 freq legendary (4) - 15 freq lands (4) - 59 freq legions (4) - 9 freq launds (4) - 19 freq logans (4) - 1 freq legendiry (4) - 1 freq leeds (4) - 9 freq depends (4) - 38 freq leven's (4) - 2 freq defends (4) - 1 freq laands (4) - 2 freq agendas (4) - 1 freq lemons (5) - 2 freq lager's (5) - 1 freq begunks (5) - 2 freq leads (5) - 45 freq leegs (5) - 1 freq agenda (5) - 23 freq offends (5) - 1 freq fag-ends (5) - 1 freq |
SoundEx code - L253 locomotive - 4 freq legend - 92 freq likent - 2 freq loaksmiths - 1 freq legends - 36 freq lucendo - 1 freq loosened - 3 freq legendary - 15 freq leisn't - 1 freq lisent - 1 freq lowsint - 1 freq leigend - 1 freq leigends - 1 freq legendiry - 1 freq lessened - 1 freq lichened - 2 freq likened - 1 freq lowsened - 2 freq legend'ry - 1 freq lassie-in-waitin - 4 freq lossiemouth - 3 freq lissened - 1 freq locomotive' - 1 freq lokomotywa' - 1 freq lozent - 1 freq lowsent - 2 freq locumtenand - 3 freq lossiemooth - 1 freq lossiemouth-museum - 1 freq likeamadgiraffe - 1 freq legianet - 1 freq lucyhunterb - 5 freq lesmit - 1 freq lyceumtheatre - 1 freq legends-need - 1 freq |
MetaPhone code - LJNTS legends - 36 freq leigends - 1 freq |
LEGENDS |
| Time to execute Levenshtein function - 0.201674 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.359039 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.027858 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.037618 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.000954 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. |