| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gibson (0) - 21 freq gibbon (1) - 10 freq gideon (2) - 2 freq wilson (2) - 48 freq kitson (2) - 1 freq ribbon (2) - 21 freq garson (2) - 2 freq bison (2) - 2 freq nibon (2) - 1 freq dobson (2) - 4 freq simson (2) - 1 freq guidson (2) - 4 freq girsin (2) - 1 freq gibran (2) - 1 freq gillon (2) - 1 freq ibsen (2) - 2 freq gibbons (2) - 2 freq robson (2) - 14 freq giban (2) - 1 freq ritson (2) - 1 freq mwilson (3) - 1 freq gsoh (3) - 2 freq alson (3) - 1 freq liaison (3) - 3 freq rizzon (3) - 8 freq |
gibson (0) - 21 freq gibbon (2) - 10 freq gibran (3) - 1 freq ibsen (3) - 2 freq guidson (3) - 4 freq giban (3) - 1 freq dobson (3) - 4 freq robson (3) - 14 freq girsin (3) - 1 freq bison (3) - 2 freq garson (3) - 2 freq robeson (4) - 1 freq gabs (4) - 3 freq gubern (4) - 1 freq gavsan (4) - 1 freq gubbin (4) - 3 freq gabsie (4) - 1 freq guysin (4) - 7 freq boson (4) - 1 freq gobban (4) - 1 freq gebs (4) - 2 freq guisin (4) - 30 freq gbn (4) - 1 freq gabbin (4) - 19 freq goblin (4) - 9 freq |
SoundEx code - G125 gibson - 21 freq gobsmacked - 4 freq gavsan - 1 freq gibknu - 1 freq gpbxmeom - 1 freq gbxanthems - 1 freq gyposwon - 1 freq giuyvcmrfe - 1 freq gbxmqxwbyd - 1 freq |
MetaPhone code - JBSN gibson - 21 freq |
GIBSON |
| Time to execute Levenshtein function - 0.188442 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.333630 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.027280 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.037443 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.000948 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. |