Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
resolve (0) - 11 freq revolve (1) - 2 freq resolved (1) - 8 freq resile (2) - 1 freq solve (2) - 9 freq disolve (2) - 1 freq revolver (2) - 1 freq reserve (2) - 8 freq remove (2) - 13 freq restive (2) - 1 freq absolve (2) - 3 freq evolve (2) - 7 freq revolved (2) - 1 freq resolvan (2) - 1 freq revolves (2) - 1 freq resolute (2) - 8 freq resolvit (2) - 2 freq resolvin (2) - 1 freq revolt (3) - 3 freq removes (3) - 2 freq reeve (3) - 1 freq resiled (3) - 2 freq revolvin (3) - 1 freq eesome (3) - 2 freq resort (3) - 8 freq |
resolve (0) - 11 freq revolve (2) - 2 freq resolved (2) - 8 freq resolute (3) - 8 freq resolvan (3) - 1 freq resolvit (3) - 2 freq resolvin (3) - 1 freq absolve (3) - 3 freq restive (3) - 1 freq solve (3) - 9 freq resile (3) - 1 freq disolve (3) - 1 freq reserve (3) - 8 freq relieve (4) - 2 freq resiles (4) - 1 freq result (4) - 116 freq relive (4) - 1 freq resiled (4) - 2 freq resslova (4) - 2 freq revolves (4) - 1 freq remove (4) - 13 freq evolve (4) - 7 freq revolver (4) - 1 freq revolved (4) - 1 freq salve (4) - 5 freq |
SoundEx code - R241 resolve - 11 freq resolved - 8 freq rockliffe - 1 freq resolvit - 2 freq recleeved - 1 freq resolvan - 1 freq resslova - 2 freq rickle-o-banes - 1 freq rage-levels - 1 freq resolvin - 1 freq rqzlavszi - 1 freq resolving - 1 freq |
MetaPhone code - RSLF resolve - 11 freq resslova - 2 freq |
RESOLVE |
Time to execute Levenshtein function - 0.393773 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.516163 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.059679 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.037402 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.000913 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. |