Content deleted Content added
Citation bot (talk | contribs) m Removed parameters. | You can use this bot yourself. Report bugs here. | User-activated. |
Greggydude (talk | contribs) →Strengths and weaknesses: seperated section by titles |
||
Line 2:
== Strengths and weaknesses ==
===Strengths===
The Damm algorithm is similar to the [[Verhoeff algorithm]]. It too will detect ''all'' occurrences of the two most frequently appearing types of [[transcription error]]s, namely altering one single digit, and transposing two adjacent digits (including the transposition of the trailing check digit and the preceding digit).<ref name="fenwick2014" /><ref name="Salomon2005" /> But the Damm algorithm has the benefit that it makes do without the dedicatedly constructed [[permutation]]s and its position specific [[Exponentiation#In abstract algebra|powers]] being inherent in the [[Verhoeff algorithm|Verhoeff scheme]]. Furthermore, a table of [[Inverse element|inverses]] can be dispensed with provided all main diagonal entries of the operation table are zero.
Line 10 ⟶ 11:
There are totally anti-symmetric quasigroups that detect all phonetic errors associated with the English language (13 ↔ 30, 14 ↔ 40, ..., 19 ↔ 90). The table used in the illustrating example is based on an instance of such kind.
===Weaknesses===
Despite its desirable properties in typical contexts where similar algorithms are used, the Damm algorithm is largely unknown and scarcely used in practice.
| |||