| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| biggest (0) - 137 freq bigest (1) - 1 freq biggent (1) - 1 freq bigget (1) - 1 freq biggist (1) - 2 freq biggeen (2) - 6 freq digest (2) - 5 freq highest (2) - 20 freq yingest (2) - 2 freq suggest (2) - 46 freq ingest (2) - 2 freq bigger' (2) - 1 freq bigg't (2) - 1 freq biggit (2) - 244 freq triggest (2) - 1 freq biggs (2) - 4 freq biggish (2) - 2 freq bigger (2) - 229 freq binges (2) - 1 freq digeest (2) - 1 freq bigged (2) - 30 freq biggers (2) - 9 freq bigsesh (2) - 1 freq beegest (2) - 1 freq biest (2) - 1 freq |
biggest (0) - 137 freq biggist (1) - 2 freq bigest (2) - 1 freq bigget (2) - 1 freq biggent (2) - 1 freq biggish (3) - 2 freq biggs (3) - 4 freq bigg't (3) - 1 freq suggest (3) - 46 freq biggit (3) - 244 freq beegest (3) - 1 freq baagest (3) - 7 freq buggert (3) - 3 freq biest (4) - 1 freq baggit (4) - 4 freq foggiest (4) - 8 freq boggit (4) - 1 freq baggies (4) - 7 freq buggies (4) - 3 freq biggers (4) - 9 freq beggs (4) - 1 freq bigsesh (4) - 1 freq yingest (4) - 2 freq highest (4) - 20 freq digest (4) - 5 freq |
SoundEx code - B223 begowkt - 1 freq biggest - 137 freq besieged - 2 freq begeckit - 1 freq begaikit - 1 freq beseeched - 1 freq biggist - 2 freq bogwhistle - 1 freq bigest - 1 freq besocht - 2 freq bequesting - 1 freq begowkit - 3 freq busiest - 3 freq baagest - 7 freq beegest - 1 freq beswakkit - 1 freq bequestin - 1 freq beseigit - 1 freq bbcquestiontime - 6 freq bxhksdm - 1 freq bookweekscot - 9 freq bjiokqhtoo - 1 freq bookweekscotland - 4 freq bbceastscot - 7 freq |
MetaPhone code - BKST bakst - 1 freq biggest - 137 freq backside - 26 freq backseat - 4 freq bakside - 2 freq biggist - 2 freq boxed - 7 freq bexit - 1 freq boxt - 1 freq back-seat - 1 freq bukksed - 1 freq bauxyte - 1 freq back-sate - 1 freq |
BIGGEST big - 2449 freq bigger - 229 freq baager - 15 freq biggest - 137 freq |
| Time to execute Levenshtein function - 0.194961 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.364719 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.027283 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.037039 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.000896 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. |