Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hobbitoncentral (0) - 3 freq south-central (6) - 1 freq hibscentral (6) - 1 freq environmental (7) - 15 freq west-central (7) - 1 freq labiodental (7) - 2 freq continental (7) - 10 freq horizontal (7) - 6 freq joabcentre (8) - 2 freq confidential (8) - 1 freq horizontals (8) - 1 freq consonantal (8) - 1 freq tangental (8) - 1 freq oriental (8) - 1 freq ancestral (8) - 14 freq central (8) - 130 freq healthcentre (8) - 1 freq post-general (8) - 1 freq a'continental (8) - 1 freq horticultural (8) - 3 freq conceptual (8) - 3 freq bibliocentrism (8) - 1 freq concentrate (8) - 33 freq labiodentals (8) - 1 freq solicitor-general (8) - 1 freq |
hobbitoncentral (0) - 3 freq hibscentral (9) - 1 freq west-central (11) - 1 freq south-central (11) - 1 freq continental (12) - 10 freq healthcentre (12) - 1 freq horticultural (12) - 3 freq central (13) - 130 freq ancestral (13) - 14 freq bibliocentrism (13) - 1 freq tangental (13) - 1 freq a'continental (13) - 1 freq concentrate (13) - 33 freq horizontal (13) - 6 freq environmental (13) - 15 freq labiodental (13) - 2 freq joabcentre (13) - 2 freq houbinsaeter (14) - 1 freq sabbatical (14) - 1 freq mindcontrol (14) - 1 freq substantial (14) - 10 freq ancestrial (14) - 1 freq architectural (14) - 2 freq instinctual (14) - 2 freq hooletontour (14) - 2 freq |
SoundEx code - H135 hauf-hidden - 3 freq haufdwam - 1 freq hauf-tuimt - 1 freq hauf-tuim - 1 freq heftin - 41 freq haufdementit - 1 freq hauf-etten - 2 freq heftins - 1 freq hauf-tume - 1 freq hfetime - 1 freq hauf-time - 1 freq hvehdn - 1 freq hobbitoncentral - 3 freq |
MetaPhone code - HBTNSNTR |
HOBBITONCENTRAL |
Time to execute Levenshtein function - 0.213851 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.411825 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.034419 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.037886 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.000892 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. |