| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gavsan (0) - 1 freq gaan (2) - 244 freq passan (2) - 7 freq ahsan (2) - 1 freq ravan (2) - 2 freq gazman (2) - 1 freq gawkan (2) - 1 freq gae'an (2) - 1 freq lapsan (2) - 1 freq gannan (2) - 1 freq raisan (2) - 3 freq dansan (2) - 10 freq wavan (2) - 9 freq cavan (2) - 1 freq javan (2) - 4 freq gaean (2) - 2 freq gaspan (2) - 1 freq gramsan (2) - 2 freq gappan (2) - 1 freq raesan (2) - 1 freq hassan (2) - 1 freq savan (2) - 1 freq gavse (2) - 1 freq garson (2) - 2 freq givan (2) - 4 freq |
gavsan (0) - 1 freq garson (3) - 2 freq givan (3) - 4 freq gavin (3) - 42 freq gavse (3) - 1 freq govan (3) - 10 freq gvaan (3) - 1 freq given (4) - 69 freq vsn (4) - 1 freq govin (4) - 9 freq gvaain (4) - 1 freq davison (4) - 1 freq gae'an (4) - 1 freq gaan (4) - 1 freq gangan (4) - 2 freq gevin (4) - 1 freq gaan (4) - 244 freq govern (4) - 3 freq gibson (4) - 21 freq greesan (4) - 1 freq girsin (4) - 1 freq guavas (4) - 1 freq goavyin (4) - 1 freq guisin (4) - 30 freq goavin (4) - 1 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 - KFSN gavsan - 1 freq |
GAVSAN |
| Time to execute Levenshtein function - 0.326852 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.585353 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.035292 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.058584 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.001182 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. |