Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
‘https (0) - 1 freq 'https (2) - 1 freq https (2) - 4789 freq ‘itÂ’s (3) - 1 freq ‘heÂ’s (3) - 1 freq http (3) - 482 freq ‘hings (3) - 1 freq ‘twas (3) - 1 freq ‘get (4) - 1 freq ‘that (4) - 1 freq ‘tell (4) - 1 freq setps (4) - 1 freq ‘here (4) - 1 freq izatt's (4) - 1 freq €˜helps (4) - 1 freq settes (4) - 1 freq hps (4) - 1 freq helps (4) - 56 freq “this (4) - 3 freq whaps (4) - 3 freq photes (4) - 1 freq ‘hey (4) - 1 freq Â’hings (4) - 1 freq photis (4) - 1 freq ‘herÂ’ (4) - 1 freq |
‘https (0) - 1 freq https (4) - 4789 freq 'https (4) - 1 freq ‘twas (6) - 1 freq ‘hings (6) - 1 freq http (6) - 482 freq ‘he’s (6) - 1 freq ‘it’s (6) - 1 freq shutts (7) - 1 freq ‘that’s (7) - 1 freq ‘pittin (7) - 3 freq haitts (7) - 1 freq phipps (8) - 1 freq thit's (8) - 25 freq chaps (8) - 24 freq staps (8) - 36 freq ‘til (8) - 3 freq hats (8) - 46 freq ‘fit (8) - 5 freq thuts (8) - 4 freq ‘what (8) - 1 freq ‘deep (8) - 1 freq quhat's (8) - 1 freq champs (8) - 2 freq thet's (8) - 3 freq |
SoundEx code - H312 https - 4789 freq haudybus - 1 freq hautboys - 1 freq 'https - 1 freq htafc - 11 freq haudbacks - 1 freq ‘https - 1 freq |
MetaPhone code - TPS dips - 11 freq tapes - 11 freq taps - 60 freq toaps - 2 freq types - 28 freq deeps - 7 freq deep-sea - 4 freq tips - 26 freq tops - 21 freq topaz - 1 freq depose - 1 freq tipsy - 3 freq https - 4789 freq types' - 1 freq deep-sey - 1 freq tups - 2 freq doupies - 1 freq deips - 1 freq dpis - 1 freq dowps - 6 freq teips - 1 freq typos - 2 freq dps - 1 freq tapis - 1 freq dpz - 1 freq tipps - 1 freq 'https - 1 freq ddaps - 1 freq ‘https - 1 freq |
‘HTTPS |
Time to execute Levenshtein function - 0.436366 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.866413 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.033912 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.091623 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.000910 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. |