| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| remeids- (0) - 1 freq remeid (2) - 7 freq remedies- (2) - 4 freq remeidit (2) - 1 freq hempies- (3) - 1 freq remedies (3) - 4 freq reid- (3) - 1 freq remains (3) - 61 freq reeds-e (3) - 1 freq reeds (3) - 16 freq remedes (3) - 1 freq reids (3) - 3 freq remeens (3) - 1 freq meids (3) - 3 freq remedy (3) - 4 freq remede (3) - 1 freq remead (3) - 2 freq remerks (3) - 8 freq reminds (3) - 25 freq semed (4) - 13 freq freends' (4) - 1 freq maids (4) - 14 freq beheidan (4) - 1 freq breids (4) - 2 freq reei (4) - 1 freq |
remeids- (0) - 1 freq remedies- (2) - 4 freq reeds-e (4) - 1 freq remedes (4) - 1 freq remedies (4) - 4 freq remeid (4) - 7 freq remeidit (4) - 1 freq meids (5) - 3 freq remead (5) - 2 freq remedy (5) - 4 freq remeens (5) - 1 freq remede (5) - 1 freq reminds (5) - 25 freq reids (5) - 3 freq reid- (5) - 1 freq hempies- (5) - 1 freq reeds (5) - 16 freq remains (5) - 61 freq raeds (6) - 3 freq medi- (6) - 1 freq rymes (6) - 1 freq reminis (6) - 1 freq rimers (6) - 1 freq romish (6) - 1 freq mids (6) - 70 freq |
SoundEx code - R532 ramotswe - 3 freq remedies- - 4 freq rheumatics - 4 freq rounds - 9 freq remeids- - 1 freq roonds - 8 freq rent-a-castle - 1 freq rents - 11 freq rants - 6 freq randies - 2 freq rheumatese - 1 freq roondish - 1 freq rheumatiky - 1 freq rendezvous - 3 freq remedes - 1 freq rinds - 1 freq remedies - 4 freq roondest - 2 freq 'roundest' - 1 freq rheumaticky - 2 freq reintegrated - 1 freq remedy's - 1 freq re-integrated - 1 freq remotes - 1 freq rinthegates - 1 freq runts - 1 freq €”rents - 1 freq |
MetaPhone code - RMTS remedies- - 4 freq remeids- - 1 freq remedes - 1 freq remedies - 4 freq rimbaud's - 1 freq remedy's - 1 freq remotes - 1 freq |
REMEIDS- |
| Time to execute Levenshtein function - 0.231898 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.570514 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.036280 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.047785 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.000941 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. |