Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
gabrielscally (0) - 1 freq gabriella (5) - 1 freq gabriell (5) - 1 freq gabrielneil (5) - 1 freq gabrielsnapper (5) - 1 freq lairge-scale (6) - 1 freq metrically (6) - 1 freq magnetically (6) - 1 freq artistically (6) - 1 freq intrinsically (6) - 1 freq critically (6) - 1 freq 'critically (6) - 1 freq gabriel (6) - 8 freq periodically (6) - 3 freq tactically (6) - 3 freq garishly (6) - 1 freq kilsally (6) - 2 freq large-scale (6) - 1 freq barbarically (6) - 2 freq genetically (6) - 1 freq basically (6) - 35 freq hermetically (6) - 1 freq earlshall (6) - 3 freq blissfally (6) - 1 freq rascally (6) - 1 freq |
gabrielscally (0) - 1 freq gabriell (8) - 1 freq gabrielneil (8) - 1 freq gabriella (8) - 1 freq intrinsically (9) - 1 freq publically (9) - 1 freq rascally (9) - 1 freq barbarically (9) - 2 freq basically (9) - 35 freq gabrielsnapper (9) - 1 freq earlshall (9) - 3 freq hermetically (10) - 1 freq genetically (10) - 1 freq gramatically (10) - 2 freq realistically (10) - 4 freq geographically (10) - 7 freq bairnies'll (10) - 1 freq blissfally (10) - 1 freq critically (10) - 1 freq artistically (10) - 1 freq 'critically (10) - 1 freq gabriel (10) - 8 freq metrically (10) - 1 freq kilsally (10) - 2 freq garishly (10) - 1 freq |
SoundEx code - G164 gabriel - 8 freq gaberlunzie - 5 freq 'gaberlunzie' - 1 freq gaberlunzies - 2 freq gabriella - 1 freq gaberlunzieman - 1 freq gibraltar - 5 freq gabriell - 1 freq gavrilo - 1 freq gabrielneil - 1 freq gabrielscally - 1 freq gabrielsnapper - 1 freq |
MetaPhone code - KBRLSKL gabrielscally - 1 freq |
GABRIELSCALLY |
Time to execute Levenshtein function - 0.266736 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.396828 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.027894 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.037551 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.000892 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. |