| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| giban (0) - 1 freq givan (1) - 4 freq giean (1) - 4 freq gibran (1) - 1 freq hivan (2) - 7 freq tisan (2) - 2 freq gowan (2) - 16 freq glidan (2) - 1 freq ban (2) - 48 freq 'ian (2) - 3 freq wigan (2) - 1 freq gaean (2) - 2 freq gicin (2) - 1 freq gbn (2) - 1 freq hidan (2) - 3 freq iran (2) - 2 freq gittn (2) - 1 freq hixan (2) - 1 freq gyran (2) - 1 freq gigas (2) - 1 freq gin (2) - 1987 freq gibknu (2) - 1 freq ga'an (2) - 6 freq risan (2) - 7 freq aisan (2) - 1 freq |
giban (0) - 1 freq gbn (2) - 1 freq gibran (2) - 1 freq giean (2) - 4 freq givan (2) - 4 freq givin (3) - 8 freq nibon (3) - 1 freq gvaan (3) - 1 freq goan (3) - 64 freq gran (3) - 232 freq gupan (3) - 1 freq govan (3) - 10 freq oban (3) - 3 freq gibby (3) - 6 freq gjaan (3) - 1 freq gan (3) - 768 freq gobban (3) - 1 freq gean (3) - 10 freq gitin (3) - 2 freq alban (3) - 3 freq gi'en (3) - 7 freq reiban (3) - 2 freq ebban (3) - 1 freq gainan (3) - 1 freq go-an (3) - 1 freq |
SoundEx code - G150 gowpen - 5 freq govin - 9 freq goavyin - 1 freq givin - 8 freq gowpin - 30 freq gapin - 10 freq given - 69 freq guffin - 1 freq gabbin - 19 freq gavin - 42 freq gaupin - 8 freq gawpin - 34 freq gypin - 3 freq gibbon - 10 freq gappen - 2 freq gappin - 2 freq gabbana - 1 freq 'gaban' - 1 freq govan - 10 freq geffin - 1 freq gif'n - 5 freq giban - 1 freq gvaain - 1 freq gaffin - 5 freq gappan - 1 freq goavin - 1 freq gubbin - 3 freq gupan - 1 freq giovanni - 3 freq givan - 4 freq gowfin - 2 freq gvaan - 1 freq ghobhainn - 1 freq gobban - 1 freq gevin - 1 freq gopin - 1 freq gaapin - 1 freq €˜giovanni - 2 freq guffan - 1 freq govn - 2 freq giovino - 1 freq 'given' - 1 freq 'goupin' - 1 freq goupin - 1 freq gbn - 1 freq gfm - 1 freq gcbinnie - 2 freq |
MetaPhone code - JBN jabbin - 8 freq gibbon - 10 freq jobnny - 1 freq giban - 1 freq jaw-bane - 1 freq |
GIBAN |
| Time to execute Levenshtein function - 0.235312 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.394783 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.027750 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.040723 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.000915 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. |