Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
relented (0) - 4 freq repented (1) - 1 freq resented (1) - 1 freq sklented (2) - 1 freq 'elected (2) - 1 freq deleted (2) - 5 freq rejected (2) - 7 freq re-enter (2) - 1 freq relents (2) - 3 freq refected (2) - 1 freq elected (2) - 10 freq beleted (2) - 1 freq selected (2) - 8 freq reverted (2) - 1 freq preented (2) - 1 freq released (2) - 31 freq presented (2) - 17 freq reenged (2) - 8 freq relentit (2) - 1 freq repeated (2) - 32 freq repinted (2) - 2 freq relent (2) - 5 freq related (2) - 28 freq prevented (2) - 2 freq reflected (2) - 11 freq |
relented (0) - 4 freq repented (2) - 1 freq resented (2) - 1 freq relentit (3) - 1 freq rented (3) - 4 freq relents (3) - 3 freq relegated (3) - 6 freq repinted (3) - 2 freq talented (3) - 8 freq related (3) - 28 freq relent (3) - 5 freq glented (3) - 2 freq reeted (4) - 4 freq demented (4) - 8 freq planted (4) - 31 freq reunited (4) - 1 freq plunted (4) - 7 freq remounted (4) - 1 freq slanted (4) - 2 freq ranted (4) - 4 freq cemented (4) - 2 freq glinted (4) - 2 freq relocated (4) - 1 freq relient (4) - 1 freq talentid (4) - 1 freq |
SoundEx code - R453 relents - 3 freq relentless - 9 freq relent - 5 freq roland - 2 freq relentlessly - 6 freq relented - 4 freq role-model - 1 freq relentit - 1 freq relient - 1 freq reliant - 3 freq |
MetaPhone code - RLNTT relented - 4 freq relentit - 1 freq |
RELENTED |
Time to execute Levenshtein function - 0.201204 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.426746 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.029071 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.038659 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.000819 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. |