| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| above (0) - 149 freq abave (1) - 1 freq move (2) - 312 freq wove (2) - 9 freq aboon (2) - 16 freq abott (2) - 2 freq abooy (2) - 1 freq hoove (2) - 1 freq abot (2) - 1 freq abe (2) - 3 freq adobe (2) - 2 freq abee (2) - 3 freq arose (2) - 15 freq abo (2) - 2 freq mlove (2) - 18 freq aboo (2) - 2 freq bode (2) - 6 freq able (2) - 436 freq above's (2) - 1 freq alive (2) - 160 freq abdie (2) - 1 freq bowe (2) - 3 freq bone (2) - 46 freq amgove (2) - 1 freq aboun (2) - 1 freq |
above (0) - 149 freq abave (1) - 1 freq beve (2) - 1 freq bov (2) - 1 freq boye (3) - 1 freq abow (3) - 1 freq boke (3) - 31 freq abdee (3) - 1 freq nove (3) - 1 freq rove (3) - 2 freq abon (3) - 1 freq about (3) - 685 freq abune (3) - 177 freq ove (3) - 1 freq abodie (3) - 2 freq ave (3) - 42 freq a've (3) - 235 freq aboat (3) - 2 freq bore (3) - 41 freq yoove (3) - 2 freq aboot (3) - 9987 freq abbie (3) - 59 freq ibone (3) - 1 freq aov (3) - 1 freq abane (3) - 28 freq |
SoundEx code - A110 above - 149 freq abave - 1 freq aaaaahhhhhhbhhbh - 1 freq aaaaahhhhhbhhbh - 1 freq abbeyview - 1 freq apeiffe - 1 freq apapa - 1 freq |
MetaPhone code - ABF above - 149 freq abave - 1 freq abbeyview - 1 freq |
ABOVE |
| Time to execute Levenshtein function - 0.198617 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.335848 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.028194 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.037322 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.003987 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. |