| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| role-reversal (0) - 2 freq age-reversal (3) - 5 freq re-reversin (4) - 1 freq reversal (5) - 1 freq multiversal (6) - 1 freq leeteral (6) - 2 freq controversial (6) - 5 freq contraversial (6) - 1 freq post-general (6) - 1 freq oldrovers (6) - 1 freq reversan (6) - 1 freq vice-versa (6) - 1 freq role-model (6) - 1 freq seeveral (6) - 1 freq rodd-rowers (6) - 1 freq leeberal (6) - 3 freq rage-levels (6) - 1 freq e-e-evenan (7) - 2 freq poleetical (7) - 38 freq several (7) - 46 freq €”one-verse (7) - 1 freq help-yersel (7) - 1 freq servers (7) - 1 freq reeves (7) - 5 freq leftovers (7) - 3 freq |
role-reversal (0) - 2 freq age-reversal (5) - 5 freq re-reversin (6) - 1 freq reversal (8) - 1 freq contraversial (9) - 1 freq oldrovers (9) - 1 freq controversial (9) - 5 freq multiversal (9) - 1 freq near-universal (10) - 1 freq rule-govrent (10) - 1 freq perversely (10) - 1 freq bellie-ryvers (10) - 1 freq raithrovers (10) - 2 freq rodd-rowers (10) - 1 freq rage-levels (10) - 1 freq reversan (10) - 1 freq vice-versa (10) - 1 freq role-model (10) - 1 freq do-overs (11) - 1 freq recovers (11) - 1 freq levers (11) - 6 freq recuivers (11) - 1 freq murlie-reiver (11) - 1 freq retriever (11) - 2 freq deleeveries (11) - 1 freq |
SoundEx code - R461 rollerblades - 1 freq role-reversal - 2 freq |
MetaPhone code - RLRFRSL role-reversal - 2 freq |
ROLE-REVERSAL |
| Time to execute Levenshtein function - 0.251584 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.392100 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.028501 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.037611 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.000882 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. |