| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| re-leevin (0) - 1 freq eleevin (2) - 4 freq relievin (2) - 3 freq beleevin (2) - 1 freq eleivin (3) - 1 freq re-tellin (3) - 1 freq leevin (3) - 195 freq releegion (3) - 18 freq reflekkin (3) - 1 freq refleckin (3) - 4 freq reservin (3) - 1 freq retweetin (3) - 2 freq relivin (3) - 1 freq eleeven (3) - 35 freq recleeved (3) - 1 freq jleevin (3) - 1 freq eeleeven (3) - 1 freq reflectin (3) - 22 freq relievit (3) - 1 freq ootleevin (3) - 1 freq retrievin (3) - 1 freq redeemin (3) - 1 freq believin (3) - 13 freq re-readin (3) - 2 freq eleevan (3) - 1 freq |
re-leevin (0) - 1 freq relievin (3) - 3 freq eleevin (4) - 4 freq relivin (4) - 1 freq beleevin (4) - 1 freq re-readin (5) - 2 freq relievit (5) - 1 freq eleevan (5) - 1 freq ootleevin (5) - 1 freq retrievin (5) - 1 freq receivin (5) - 7 freq resolvin (5) - 1 freq re-lived (5) - 1 freq revolvin (5) - 1 freq reevin (5) - 3 freq iverleevin (5) - 1 freq aleevin (5) - 1 freq believin (5) - 13 freq leevin (5) - 195 freq reservin (5) - 1 freq eeleeven (5) - 1 freq releegion (5) - 18 freq eleivin (5) - 1 freq eleeven (5) - 35 freq jleevin (5) - 1 freq |
SoundEx code - R415 relevant - 42 freq re-leevin - 1 freq relievin - 3 freq relevance - 5 freq relivant - 1 freq relivin - 1 freq royalfamily - 1 freq royalpeniafc - 4 freq relievin - 1 freq |
MetaPhone code - RLFN re-leevin - 1 freq relievin - 3 freq relivin - 1 freq relievin - 1 freq |
RE-LEEVIN |
| Time to execute Levenshtein function - 0.197149 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.356568 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.027603 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.037727 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.000948 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. |