| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| evolved (0) - 9 freq envolved (1) - 1 freq revolved (1) - 1 freq devolved (1) - 7 freq evolve (1) - 7 freq evolves (1) - 1 freq involved (2) - 140 freq resolved (2) - 8 freq evolvin (2) - 1 freq revolves (2) - 1 freq revolve (2) - 2 freq devalved (2) - 1 freq solved (2) - 8 freq revolver (2) - 1 freq proved (3) - 31 freq snooved (3) - 3 freq tooled (3) - 3 freq reviled (3) - 2 freq vowed (3) - 5 freq voiced (3) - 16 freq goved (3) - 2 freq devalled (3) - 1 freq wolves (3) - 27 freq unsolved (3) - 2 freq voyied (3) - 1 freq |
evolved (0) - 9 freq evolves (2) - 1 freq evolve (2) - 7 freq devolved (2) - 7 freq envolved (2) - 1 freq revolved (2) - 1 freq solved (3) - 8 freq evolvin (3) - 1 freq devalved (3) - 1 freq involved (3) - 140 freq calved (4) - 1 freq velued (4) - 2 freq mulved (4) - 1 freq volvos (4) - 1 freq halved (4) - 2 freq valued (4) - 14 freq loved (4) - 190 freq salved (4) - 1 freq beloved (4) - 25 freq velvet (4) - 32 freq delved (4) - 2 freq gloved (4) - 4 freq volvo (4) - 2 freq valve (4) - 1 freq develoved (4) - 1 freq |
SoundEx code - E141 evolves - 1 freq epileptic - 4 freq epilepsy - 5 freq eabbi-labbi - 1 freq evolved - 9 freq evolve - 7 freq evolvin - 1 freq eeyplvxu - 1 freq |
MetaPhone code - EFLFT evolved - 9 freq |
EVOLVED |
| Time to execute Levenshtein function - 0.293930 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.561943 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.027385 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.068836 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.000955 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. |