The predicate-argument dependencies are represented as 5-tuples: , where h f is the lexical item of the lexical category expressing the dependency relation, f is the lexical category, s is the argument slot, h a is the head word of the argument, and l encodes whether the dependency is non-local.
the results in Table 12 add considerable weight to one of our main claims in this article, namely, that highly efficient parsing is possible with CCG, and that largescale processing is possible with linguistically motivated grammars.