| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| baobabs (0) - 15 freq baobab (1) - 5 freq boabs (2) - 1 freq bawbaws (2) - 1 freq bawbags (2) - 2 freq bawbees (3) - 23 freq baa's (3) - 1 freq albais (3) - 1 freq bawbag (3) - 13 freq boab's (3) - 3 freq boba (3) - 2 freq bawjaws (3) - 3 freq boass (3) - 3 freq bob's (3) - 4 freq blobs (3) - 4 freq babes (3) - 6 freq fatbaws (3) - 1 freq bombs (3) - 26 freq albans (3) - 1 freq gobbs (3) - 20 freq balkans (3) - 4 freq saabs (3) - 1 freq barbados (3) - 6 freq babys (3) - 1 freq boobs (3) - 7 freq |
baobabs (0) - 15 freq baobab (2) - 5 freq babbies (3) - 13 freq boabs (3) - 1 freq bobs (4) - 9 freq yabbs (4) - 1 freq boobs (4) - 7 freq bobby (4) - 45 freq barbies (4) - 3 freq babys (4) - 1 freq boembs (4) - 1 freq babe's (4) - 1 freq baby's (4) - 6 freq babby (4) - 25 freq kebabs (4) - 3 freq gobbs (4) - 20 freq babies (4) - 28 freq bobbies (4) - 33 freq bombs (4) - 26 freq bab's (4) - 1 freq barbs (4) - 1 freq bawbees (4) - 23 freq bawbags (4) - 2 freq bawbaws (4) - 1 freq boab's (4) - 3 freq |
SoundEx code - B112 baobabs - 15 freq baffiebox - 1 freq boabobski - 2 freq |
MetaPhone code - BBBS baobabs - 15 freq |
BAOBABS |
| Time to execute Levenshtein function - 0.423723 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.564384 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.029158 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.037084 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.000868 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. |