| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reiverlands (0) - 1 freq nederlands (3) - 2 freq riverbanks (3) - 2 freq netherlands (3) - 7 freq reverant (4) - 3 freq riverbank (4) - 4 freq reverend (4) - 40 freq hinterlands (4) - 1 freq hielands (4) - 11 freq heivenwatds (4) - 1 freq borderlands (4) - 2 freq heelands (4) - 1 freq silversands (4) - 1 freq nederland (4) - 1 freq liberland (4) - 2 freq reverrons (4) - 1 freq reivers (4) - 17 freq reversan (4) - 1 freq heilands (4) - 1 freq wuidlands (5) - 2 freq referrals (5) - 1 freq deerhunds (5) - 1 freq rembrandt (5) - 4 freq kellerman's (5) - 2 freq heavenwards (5) - 1 freq |
reiverlands (0) - 1 freq riverbanks (5) - 2 freq nederlands (5) - 2 freq reverend (6) - 40 freq reverrons (6) - 1 freq netherlands (6) - 7 freq borderlands (6) - 2 freq ravelings (7) - 1 freq heilands (7) - 1 freq reversan (7) - 1 freq verandas (7) - 1 freq forelands (7) - 2 freq garlands (7) - 2 freq reivers (7) - 17 freq ravelins (7) - 1 freq errands (7) - 11 freq rivlins (7) - 2 freq reverant (7) - 3 freq liberland (7) - 2 freq heelands (7) - 1 freq riverbank (7) - 4 freq hinterlands (7) - 1 freq nederland (7) - 1 freq silversands (7) - 1 freq hielands (7) - 11 freq |
SoundEx code - R164 referrals - 1 freq rover'll - 1 freq reiverlands - 1 freq |
MetaPhone code - RFRLNTS reiverlands - 1 freq |
REIVERLANDS |
| Time to execute Levenshtein function - 0.233855 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.393863 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.027882 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.038204 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.001015 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. |