Since a node is inserted when no proposition in the domain matches a statement in the argument, we use an insertion penalty equal to ¢ ¡ -the probabilitylike score of the worst acceptable word-match between a statement and a proposition (Section 4.1).
the message length for node in-sertions is Node deletions = number of deleted nodes plus their designations.