| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nearabuin (0) - 1 freq nearhaun (3) - 69 freq nearaboot (3) - 3 freq heartburn (3) - 1 freq yearbuik (3) - 1 freq nearin (3) - 6 freq nearan (3) - 1 freq nearlins (4) - 6 freq hearin (4) - 174 freq paradin (4) - 2 freq searin (4) - 4 freq neebin (4) - 2 freq warblin (4) - 1 freq gearin (4) - 2 freq arabi (4) - 1 freq nebbin (4) - 2 freq hertburn (4) - 2 freq lerbin (4) - 2 freq neerendin (4) - 1 freq heraldin (4) - 1 freq learin (4) - 8 freq arabic (4) - 7 freq terrain (4) - 10 freq noarbie (4) - 2 freq fearin (4) - 4 freq |
nearabuin (0) - 1 freq nearan (4) - 1 freq nearin (4) - 6 freq nearaboot (4) - 3 freq nearhaun (4) - 69 freq lerbin (5) - 2 freq nebbin (5) - 2 freq nearhan (5) - 28 freq noarbie (5) - 2 freq 'arabian (5) - 1 freq arabian (5) - 1 freq near-on (5) - 2 freq nearby (5) - 51 freq yearbuik (5) - 1 freq nabbin (5) - 2 freq neibin (5) - 3 freq neebin (5) - 2 freq neathin (6) - 1 freq narhaan (6) - 1 freq wearyin (6) - 9 freq ower-abuin (6) - 1 freq maraudin (6) - 1 freq naeraboot (6) - 4 freq parafin (6) - 1 freq robin (6) - 196 freq |
SoundEx code - N615 nirvana - 2 freq nearabuin - 1 freq |
MetaPhone code - NRBN nearabuin - 1 freq |
NEARABUIN |
| Time to execute Levenshtein function - 0.245432 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.435305 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.027857 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.038612 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.000901 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. |