Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
gerard (0) - 2 freq gerrard (1) - 1 freq gerald (1) - 26 freq geari (2) - 1 freq retard (2) - 2 freq regard (2) - 16 freq gears (2) - 14 freq reward (2) - 46 freq garnard (2) - 1 freq peard (2) - 1 freq grand (2) - 353 freq geared (2) - 2 freq bernard (2) - 5 freq he'ard (2) - 1 freq feard (2) - 1 freq gead (2) - 2 freq petard (2) - 1 freq gerry (2) - 13 freq gear (2) - 228 freq seward (2) - 2 freq heard (2) - 1263 freq beard (2) - 54 freq garrd (2) - 3 freq gear' (2) - 1 freq kyrard (2) - 1 freq |
gerard (0) - 2 freq garrd (2) - 3 freq gerald (2) - 26 freq gerrard (2) - 1 freq gurred (3) - 8 freq kyrard (3) - 1 freq guard (3) - 38 freq grand (3) - 353 freq gard (3) - 4 freq gerry (3) - 13 freq geared (3) - 2 freq garred (3) - 22 freq garnard (3) - 1 freq gurled (4) - 10 freq gertrude (4) - 1 freq graved (4) - 1 freq grade (4) - 19 freq gerorge (4) - 1 freq gurrs (4) - 1 freq gord (4) - 1 freq gaird (4) - 60 freq raird (4) - 1 freq garde (4) - 1 freq growd (4) - 1 freq grado (4) - 1 freq |
SoundEx code - G663 graart - 1 freq grairt - 2 freq grairt' - 1 freq 'grairt' - 1 freq gerard - 2 freq gerrard - 1 freq gerardcarruthe - 12 freq |
MetaPhone code - JRRT gerard - 2 freq gerrard - 1 freq |
GERARD |
Time to execute Levenshtein function - 0.201574 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.369796 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.036732 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.036801 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.000791 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. |