Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
remotely (0) - 3 freq remote' (2) - 1 freq remote (2) - 27 freq remotes (2) - 1 freq mosely (3) - 2 freq 'remote (3) - 1 freq recovery (3) - 13 freq devotedly (3) - 1 freq removal (3) - 10 freq removes (3) - 2 freq resolutely (3) - 3 freq revote (3) - 1 freq 'remote' (3) - 2 freq remedy (3) - 4 freq reely (3) - 9 freq heistely (3) - 1 freq remover (3) - 3 freq cemetery (3) - 32 freq temote (3) - 1 freq metely (3) - 1 freq removed (3) - 17 freq remove (3) - 13 freq femely (3) - 1 freq sedately (3) - 1 freq gemmely (3) - 1 freq |
remotely (0) - 3 freq remote (3) - 27 freq remotes (3) - 1 freq remote' (3) - 1 freq metely (4) - 1 freq removal (4) - 10 freq remit (5) - 11 freq recital (5) - 1 freq sedately (5) - 1 freq motley (5) - 2 freq gemmely (5) - 1 freq reestle (5) - 1 freq rummel (5) - 6 freq rettle (5) - 1 freq rammel (5) - 1 freq reptile (5) - 1 freq rustly (5) - 1 freq rumbly (5) - 1 freq remove (5) - 13 freq rental (5) - 9 freq femely (5) - 1 freq resolutely (5) - 3 freq revote (5) - 1 freq removes (5) - 2 freq rommel (5) - 1 freq |
SoundEx code - R534 rental - 9 freq roondhole - 1 freq rantletree - 3 freq roundelay - 1 freq rendall - 2 freq run-deil - 1 freq roundalays - 1 freq randall - 7 freq randolph - 1 freq remotely - 3 freq ryanheatly - 1 freq rentals - 2 freq randlestoon - 2 freq |
MetaPhone code - RMTL remotely - 3 freq |
REMOTELY |
Time to execute Levenshtein function - 0.215848 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.369991 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.027593 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.040495 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.000928 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. |