Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
legend (0) - 92 freq legends (1) - 36 freq leigend (1) - 1 freq leed (2) - 25 freq legged (2) - 10 freq lemen (2) - 1 freq mylegend (2) - 1 freq lee'd (2) - 1 freq aeged (2) - 1 freq peend (2) - 4 freq resend (2) - 1 freq leen (2) - 18 freq leggid (2) - 1 freq regent (2) - 6 freq leigends (2) - 1 freq learnd (2) - 1 freq defend (2) - 23 freq leent (2) - 26 freq denend (2) - 1 freq leven (2) - 17 freq leeed (2) - 1 freq depend (2) - 16 freq begen (2) - 11 freq lend (2) - 22 freq repent (3) - 17 freq |
legend (0) - 92 freq leigend (1) - 1 freq legends (2) - 36 freq leggid (3) - 1 freq mylegend (3) - 1 freq leigends (3) - 1 freq legged (3) - 10 freq lend (3) - 22 freq learnd (3) - 1 freq legendary (4) - 15 freq logan (4) - 12 freq eland (4) - 1 freq lined (4) - 51 freq melgund (4) - 1 freq legions (4) - 9 freq laernd (4) - 1 freq gnd (4) - 1 freq aligned (4) - 2 freq logans (4) - 1 freq learned (4) - 79 freq login (4) - 2 freq ligged (4) - 1 freq zgnd (4) - 1 freq lomond (4) - 17 freq legoing (4) - 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 - LJNT legend - 92 freq leigend - 1 freq legianet - 1 freq |
LEGEND |
Time to execute Levenshtein function - 0.193813 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.367823 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.031198 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.037543 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.000924 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. |