| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| relevance (0) - 5 freq reliance (2) - 4 freq irrelevance (2) - 5 freq elegance (2) - 2 freq relevant (2) - 42 freq revengance (3) - 1 freq release (3) - 19 freq tolerance (3) - 7 freq remberance (3) - 1 freq relivant (3) - 1 freq elevate (3) - 2 freq freelance (3) - 6 freq relegate (3) - 2 freq greeance (3) - 18 freq reluctance (3) - 6 freq repentance (3) - 3 freq resonance (3) - 4 freq reverence (3) - 10 freq grievance (3) - 1 freq reuerence (3) - 1 freq seelance (3) - 1 freq reference (3) - 53 freq 'leanne (4) - 3 freq reench (4) - 1 freq renovate (4) - 1 freq |
relevance (0) - 5 freq reliance (3) - 4 freq relevant (3) - 42 freq irrelevance (3) - 5 freq elegance (4) - 2 freq relivant (4) - 1 freq reuerence (5) - 1 freq reverence (5) - 10 freq grievance (5) - 1 freq reluctance (5) - 6 freq relievin (5) - 3 freq reference (5) - 53 freq seelance (5) - 1 freq resonance (5) - 4 freq tolerance (5) - 7 freq freelance (5) - 6 freq relivin (5) - 1 freq relent (6) - 5 freq allegiance (6) - 7 freq relieve (6) - 2 freq ballance (6) - 1 freq residence (6) - 17 freq allooance (6) - 1 freq alliance (6) - 30 freq plesaunce (6) - 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 - RLFNS relevance - 5 freq |
RELEVANCE |
| Time to execute Levenshtein function - 0.332434 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.382785 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.027966 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.037858 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.000792 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. |