Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
oonerstatement (0) - 1 freq owerstatement (2) - 1 freq understatement (3) - 5 freq understatemint (4) - 1 freq €œunderstatement (4) - 1 freq understatment (4) - 1 freq reinstatement (5) - 1 freq statement (5) - 109 freq €œstatement (5) - 1 freq containment (6) - 2 freq oontment (6) - 1 freq oonertakkin (6) - 1 freq instalment (6) - 1 freq constituent (6) - 3 freq onerstaun (6) - 1 freq newstatesman (6) - 4 freq consolement (6) - 1 freq owerstate (6) - 2 freq statements (6) - 19 freq onnerstaun (6) - 2 freq advertisement (6) - 2 freq onerstauns (6) - 1 freq entertainment (6) - 26 freq fowerteent (6) - 2 freq constitouent (6) - 1 freq |
oonerstatement (0) - 1 freq owerstatement (3) - 1 freq understatement (4) - 5 freq understatment (5) - 1 freq understatemint (5) - 1 freq €œstatement (7) - 1 freq statement (7) - 109 freq reinstatement (7) - 1 freq €œunderstatement (7) - 1 freq instalment (8) - 1 freq staetment (9) - 5 freq constitouent (9) - 1 freq installment (9) - 2 freq entertainment (9) - 26 freq instrument (9) - 27 freq onerstauns (9) - 1 freq resentment (9) - 8 freq investment (9) - 23 freq testament (9) - 43 freq overstatin' (9) - 1 freq onerstaun (9) - 1 freq oontment (9) - 1 freq newstatesman (9) - 4 freq constituent (9) - 3 freq statements (9) - 19 freq |
SoundEx code - O562 ownership - 6 freq 'oonawaars' - 1 freq owners - 19 freq owners' - 1 freq owner's - 2 freq onywheres - 1 freq onerstaun - 1 freq onerstauns - 1 freq oniewhaurs - 3 freq ownerschip - 2 freq onnerstaun - 2 freq o'mirk - 1 freq oonregairded - 1 freq oonerstatement - 1 freq onroustit - 1 freq onawaurs - 1 freq onerous - 1 freq ownerÂ’s - 1 freq owenhargie - 1 freq oiomrxgiep - 1 freq |
MetaPhone code - ONRSTTMN |
OONERSTATEMENT |
Time to execute Levenshtein function - 0.386201 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.590938 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.031029 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.047478 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.000951 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. |