Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
above (0) - 144 freq abave (1) - 1 freq absie (2) - 1 freq alone (2) - 68 freq glove (2) - 10 freq ave (2) - 7 freq boye (2) - 1 freq abyde (2) - 2 freq cove (2) - 19 freq above's (2) - 1 freq boke (2) - 30 freq abide (2) - 15 freq rove (2) - 2 freq aa've (2) - 2 freq abode' (2) - 1 freq abuse (2) - 45 freq abow (2) - 1 freq abort (2) - 3 freq abe (2) - 3 freq bore (2) - 42 freq apone (2) - 3 freq 'love (2) - 3 freq ahve (2) - 10 freq oboe (2) - 1 freq abooy (2) - 1 freq |
above (0) - 144 freq abave (1) - 1 freq beve (2) - 1 freq bov (2) - 1 freq abane (3) - 28 freq aov (3) - 1 freq aboon (3) - 16 freq abodie (3) - 2 freq alyve (3) - 1 freq alive (3) - 160 freq dove (3) - 7 freq ove (3) - 1 freq abase (3) - 1 freq bode (3) - 6 freq gove (3) - 14 freq abune (3) - 177 freq bev (3) - 1 freq aboose (3) - 1 freq ave (3) - 42 freq abbie (3) - 59 freq abou (3) - 1 freq aboit (3) - 1 freq aboat (3) - 2 freq nove (3) - 1 freq bose (3) - 19 freq |
SoundEx code - A110 above - 144 freq abave - 1 freq aaaaahhhhhhbhhbh - 1 freq aaaaahhhhhbhhbh - 1 freq abbeyview - 1 freq apeiffe - 1 freq apapa - 1 freq |
MetaPhone code - ABF above - 144 freq abave - 1 freq abbeyview - 1 freq |
ABOVE |
Time to execute Levenshtein function - 0.202356 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.371856 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.027098 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.036607 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.000832 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. |