Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
irrelevant (0) - 5 freq relevant (2) - 42 freq irrelevance (2) - 5 freq relivant (3) - 1 freq irreverent (3) - 1 freq irelan' (4) - 1 freq ireland (4) - 142 freq reliant (4) - 3 freq relevance (4) - 5 freq arreevals (4) - 1 freq relent (4) - 5 freq reverant (4) - 3 freq arreevin (4) - 1 freq irelan (4) - 3 freq intolerant (4) - 2 freq elegant (4) - 12 freq skreekan (5) - 1 freq relegatit (5) - 3 freq seelent (5) - 25 freq owrelang (5) - 2 freq dreean (5) - 1 freq iceland (5) - 42 freq repeat (5) - 77 freq relievin (5) - 3 freq agreement (5) - 35 freq |
irrelevant (0) - 5 freq irrelevance (3) - 5 freq relevant (3) - 42 freq relivant (4) - 1 freq irreverent (5) - 1 freq relevance (6) - 5 freq arreevin (6) - 1 freq relent (6) - 5 freq reliant (6) - 3 freq relievt (7) - 1 freq replicant (7) - 1 freq eleevent (7) - 1 freq relievin (7) - 3 freq errant (7) - 2 freq brillant (7) - 1 freq relievit (7) - 1 freq arrogant (7) - 7 freq aleevint (7) - 1 freq gallivant (7) - 1 freq virulent (7) - 1 freq prevent (7) - 14 freq relient (7) - 1 freq irelan (7) - 3 freq intolerant (7) - 2 freq reverant (7) - 3 freq |
SoundEx code - I641 irrelevant - 5 freq irrelevance - 5 freq |
MetaPhone code - IRLFNT irrelevant - 5 freq |
IRRELEVANT |
Time to execute Levenshtein function - 0.257418 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.486171 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.035443 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.044936 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.001074 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. |