Thus The spans counted by ℓ 1 and ℓ 2 correspond to continuous spans counted in computing the complexity of a chart parsing operation.
unlike in the diagrams in the earlier part of this paper, in our graph theoretic argument there is no requirement that T select only corresponding pairs of vertices from V 1 and V 2 .