| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fobbit (0) - 1 freq sobbit (1) - 3 freq hobbit (1) - 2 freq gobbit (1) - 1 freq bobbit (1) - 2 freq fobbin (1) - 3 freq jobbit (1) - 5 freq robbit (1) - 2 freq ebbit (2) - 1 freq gabbit (2) - 3 freq forkit (2) - 4 freq founit (2) - 2 freq mobbin (2) - 1 freq fabbie (2) - 2 freq forrit (2) - 529 freq follit (2) - 11 freq dabbit (2) - 6 freq bobbie (2) - 15 freq sobbin (2) - 10 freq robit (2) - 1 freq sabbit (2) - 1 freq libbit (2) - 3 freq bobbin (2) - 22 freq forcit (2) - 2 freq dobbin (2) - 13 freq |
fobbit (0) - 1 freq fobbin (2) - 3 freq robbit (2) - 2 freq bobbit (2) - 2 freq jobbit (2) - 5 freq gobbit (2) - 1 freq hobbit (2) - 2 freq sobbit (2) - 3 freq jabbit (3) - 3 freq webbit (3) - 1 freq foubeit (3) - 7 freq babbit (3) - 2 freq nabbit (3) - 2 freq fitbit (3) - 2 freq rubbit (3) - 49 freq jibbit (3) - 1 freq wibbit (3) - 2 freq nebbit (3) - 5 freq rabbit (3) - 499 freq wabbit (3) - 79 freq libbit (3) - 3 freq sabbit (3) - 1 freq fabbie (3) - 2 freq dabbit (3) - 6 freq gabbit (3) - 3 freq |
SoundEx code - F130 fifth - 29 freq fifty - 170 freq fuftie - 4 freq fuffed - 1 freq fifety - 1 freq fift - 14 freq fob-wateh - 1 freq fiypt - 1 freq foofed - 1 freq fibta' - 1 freq fiftay - 1 freq fiftie - 12 freq fyft - 1 freq fyftie - 1 freq fufty - 6 freq fufft - 5 freq feyfty - 1 freq foubeit - 7 freq fobbit - 1 freq feefty - 1 freq fived - 1 freq €˜fifty - 1 freq fifd - 1 freq fabbydoo - 1 freq |
MetaPhone code - FBT fibta' - 1 freq foubeit - 7 freq fobbit - 1 freq vbt - 1 freq fabbydoo - 1 freq |
FOBBIT |
| Time to execute Levenshtein function - 0.186829 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.345081 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.031333 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.038294 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.000916 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. |