... graphs¹

As mentioned before, a dramatic reduction has been obtained by a heuristic search algorithm.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... path²

This result is (just) statistically significant. We performed a paired T-test on the number of wrong semantic units per graph. This results in a t^* score of 2.0 (with 999 degrees of freedom).

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.