In both cases, the algorithms fail to match any boundary precisely; both receive scores of 0 for precision and recall.
algorithm a-0 is close to correct in almost all cases, whereas algorithm a-1 is entirely off, adding extraneous boundaries and missing important boundaries entirely.