| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kipstergull (0) - 2 freq skipper'll (5) - 2 freq tipster (5) - 1 freq peter-uill (5) - 1 freq hipster (5) - 3 freq diasterous (5) - 1 freq seagull (5) - 9 freq masterful (5) - 1 freq kist-cauld (5) - 1 freq hipsters (5) - 1 freq maister'll (5) - 1 freq peter'll (5) - 1 freq misterfu (5) - 1 freq sisterly (5) - 1 freq sisterhuid (5) - 1 freq killerguile (5) - 1 freq powerfull (5) - 1 freq diaster (6) - 1 freq kirstenin (6) - 1 freq water'll (6) - 1 freq spiteful (6) - 2 freq bowsterous (6) - 2 freq cistern (6) - 6 freq miseryguts (6) - 5 freq pistoll (6) - 1 freq |
kipstergull (0) - 2 freq peter'll (8) - 1 freq maister'll (8) - 1 freq pipistrelle (8) - 1 freq peter-uill (8) - 1 freq pistoll (9) - 1 freq petergillan (9) - 3 freq scargill (9) - 3 freq stroll (9) - 21 freq foresterhill (9) - 1 freq pasteurella (9) - 1 freq yesargyll (9) - 1 freq kestrel (9) - 2 freq powerfull (9) - 1 freq visitor'll (9) - 1 freq kirsteenmullay (9) - 10 freq kist-cauld (9) - 1 freq seagull (9) - 9 freq masterful (9) - 1 freq killerguile (9) - 1 freq sisterly (9) - 1 freq tipster (9) - 1 freq hipster (9) - 3 freq hipsters (9) - 1 freq skipper'll (9) - 2 freq |
SoundEx code - K123 kipstergull - 2 freq kfqdl - 1 freq kpzdyinj - 1 freq kfosterauthor - 1 freq |
MetaPhone code - KPSTRKL kipstergull - 2 freq |
KIPSTERGULL |
| Time to execute Levenshtein function - 0.314601 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.589024 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.039285 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.053916 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.001091 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. |