| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| goevaazcld (0) - 1 freq poe-faced (5) - 3 freq govanhill (5) - 1 freq devaallt (5) - 2 freq gerald (5) - 26 freq devaal (5) - 5 freq devaall (5) - 1 freq goswald (5) - 1 freq recaall (6) - 1 freq oval (6) - 7 freq graced (6) - 4 freq greenfield (6) - 2 freq trevals (6) - 1 freq enhanced (6) - 2 freq conveenced (6) - 2 freq gobsmacked (6) - 4 freq galvanised (6) - 4 freq bombazed (6) - 2 freq oecd (6) - 1 freq lobmquzdld (6) - 1 freq kaald (6) - 4 freq yae-aal (6) - 1 freq graand (6) - 4 freq rewaard (6) - 2 freq seevral (6) - 1 freq |
goevaazcld (0) - 1 freq goswald (8) - 1 freq govt-led (8) - 1 freq gerald (8) - 26 freq graizled (8) - 1 freq govanhill (8) - 1 freq gollached (9) - 2 freq goved (9) - 2 freq grazed (9) - 5 freq devalued (9) - 2 freq jeelcauld (9) - 1 freq gaecd (9) - 1 freq goaved (9) - 7 freq glanced (9) - 27 freq goold (9) - 3 freq devauled (9) - 13 freq devalled (9) - 1 freq caald (9) - 28 freq glenced (9) - 4 freq age-auld (9) - 2 freq governed (9) - 4 freq gold (9) - 115 freq groozled (9) - 2 freq guzzled (9) - 2 freq grizzled (9) - 1 freq |
SoundEx code - G124 gippsland - 1 freq gsfwswljwd - 1 freq goevaazcld - 1 freq gbqlw - 1 freq gwfqioihlb - 1 freq |
MetaPhone code - KFSKLT goevaazcld - 1 freq |
GOEVAAZCLD |
| Time to execute Levenshtein function - 0.242746 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.404217 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.036091 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.037127 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.000931 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. |