| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fobbin (0) - 3 freq dobbin (1) - 13 freq mobbin (1) - 1 freq lobbin (1) - 4 freq sobbin (1) - 10 freq robbin (1) - 6 freq fobbit (1) - 1 freq bobbin (1) - 22 freq fouin (2) - 1 freq sobbing (2) - 1 freq rubbin (2) - 50 freq fabbie (2) - 2 freq stobbin (2) - 1 freq bebbin (2) - 1 freq dobbid (2) - 1 freq robbie (2) - 61 freq wobblin (2) - 3 freq babbin (2) - 4 freq fortin (2) - 1 freq gubbin (2) - 3 freq nebbin (2) - 2 freq forcin (2) - 22 freq fowkin (2) - 1 freq robbit (2) - 2 freq ebbin (2) - 3 freq |
fobbin (0) - 3 freq robbin (2) - 6 freq bobbin (2) - 22 freq sobbin (2) - 10 freq fobbit (2) - 1 freq lobbin (2) - 4 freq mobbin (2) - 1 freq dobbin (2) - 13 freq sobban (3) - 4 freq ebbin (3) - 3 freq bobban (3) - 2 freq nabbin (3) - 2 freq boabbin (3) - 1 freq lobbyin (3) - 2 freq bobin (3) - 1 freq jabbin (3) - 8 freq gabbin (3) - 19 freq dubbin (3) - 1 freq boabin (3) - 1 freq dabbin (3) - 8 freq sabbin (3) - 10 freq bebbin (3) - 1 freq ribbin (3) - 2 freq fabbie (3) - 2 freq nebbin (3) - 2 freq |
SoundEx code - F150 fuffin - 2 freq fobbin - 3 freq faffin - 1 freq foofin - 1 freq fifin' - 1 freq fabiani - 5 freq fee-pyin - 1 freq fee-peyin - 1 freq feibn - 1 freq |
MetaPhone code - FBN fobbin - 3 freq fabiani - 5 freq feibn - 1 freq |
FOBBIN |
| Time to execute Levenshtein function - 0.228157 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.375142 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.028379 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.040855 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.000884 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. |