As the figure shows, the asymptotic runtimes for computing the complete chart and the reduced chart are about the same, whereas the time for enumerating all configurations grows much faster.
even first-order equivalence is an undecidable problem, and broadcoverage semantic representations such as those computed by the ERG usually have no welldefined model-theoretic semantics and therefore no concept of semantic equivalence.