| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| revolved (0) - 1 freq devolved (1) - 7 freq revolve (1) - 2 freq revolver (1) - 1 freq evolved (1) - 9 freq resolved (1) - 8 freq revolves (1) - 1 freq reviled (2) - 2 freq devalved (2) - 1 freq envolved (2) - 1 freq resolve (2) - 11 freq evolve (2) - 7 freq revolvin (2) - 1 freq revived (2) - 6 freq evolves (2) - 1 freq removed (2) - 17 freq involved (2) - 140 freq renoved (2) - 1 freq revolt (3) - 3 freq devolvin (3) - 2 freq trevelled (3) - 6 freq beloved (3) - 25 freq recalled (3) - 1 freq unsolved (3) - 2 freq rolled (3) - 55 freq |
revolved (0) - 1 freq revolves (2) - 1 freq resolved (2) - 8 freq evolved (2) - 9 freq devolved (2) - 7 freq revolve (2) - 2 freq revolver (2) - 1 freq revived (3) - 6 freq involved (3) - 140 freq revolvin (3) - 1 freq devalved (3) - 1 freq reviled (3) - 2 freq envolved (3) - 1 freq re-lived (4) - 1 freq relieved (4) - 38 freq develoved (4) - 1 freq revealed (4) - 13 freq renoved (4) - 1 freq evolve (4) - 7 freq evolves (4) - 1 freq removed (4) - 17 freq resolve (4) - 11 freq reverted (5) - 1 freq rileeved (5) - 1 freq revile (5) - 3 freq |
SoundEx code - R141 revolver - 1 freq revolved - 1 freq revolvin - 1 freq revolves - 1 freq revolve - 2 freq revolving - 1 freq rplhfcoew - 1 freq |
MetaPhone code - RFLFT revolved - 1 freq |
REVOLVED |
| Time to execute Levenshtein function - 0.267543 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.380402 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.030353 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.036974 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.000877 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. |