Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
esartshall (0) - 1 freq earlshall (2) - 3 freq earshall (2) - 1 freq earls-hall (3) - 1 freq marshall (3) - 5 freq marshal (4) - 1 freq earlshall's (4) - 1 freq earthly (4) - 10 freq earlshaa (4) - 1 freq marshals (4) - 1 freq mairshall (4) - 11 freq espeeshally (4) - 1 freq newarthill (4) - 1 freq marshalls (4) - 1 freq martha (5) - 7 freq sartorial (5) - 2 freq sornhill (5) - 1 freq 'sangshaw' (5) - 1 freq maryhull (5) - 1 freq marischal (5) - 5 freq patch'll (5) - 1 freq stixall (5) - 1 freq marshall's (5) - 2 freq starshadw (5) - 1 freq nutshell (5) - 6 freq |
esartshall (0) - 1 freq earshall (4) - 1 freq earlshall (4) - 3 freq marshall (5) - 5 freq mairshall (6) - 11 freq earls-hall (6) - 1 freq espeeshally (6) - 1 freq hert-holl (7) - 5 freq espeeshilly (7) - 1 freq scots'll (7) - 3 freq nutshell (7) - 6 freq hertholl (7) - 2 freq sornhill (7) - 1 freq rat-holl (7) - 1 freq sort'll (7) - 1 freq newarthill (7) - 1 freq earthly (7) - 10 freq sartorially (7) - 1 freq marshal (7) - 1 freq seashell (7) - 1 freq marshals (7) - 1 freq speshally (7) - 1 freq marshalls (7) - 1 freq espeeshully (7) - 8 freq smithhill (7) - 1 freq |
SoundEx code - E263 exertin - 1 freq ecairt-wheels - 1 freq ecairrit - 1 freq escort - 3 freq esartshall - 1 freq exertion - 3 freq ecairt-cuddy - 1 freq ecairted - 1 freq exert - 1 freq ekurt - 1 freq exerted - 1 freq escortit - 2 freq ex-scorrie-ation - 1 freq esquierdo - 1 freq exertit - 2 freq ecairriet - 1 freq eco-riots - 2 freq exertions - 2 freq escorts - 1 freq escorted - 1 freq eaccreative - 2 freq |
MetaPhone code - ESRTXL esartshall - 1 freq |
ESARTSHALL |
Time to execute Levenshtein function - 0.324676 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.504010 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.028633 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.039480 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.000954 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. |