We formally demonstrate the superiority of AQL and SystemT in terms of both expressivity and efficiency (Section 4).
we show that 1) the expressivity of AQL is a strict superset of CPSL grammars not using external functions and 2) the search space explored by the SystemT optimizer includes operator graphs corresponding to efficient finite state transducer implementations.