... exploited in parsing formalisms other than rewriting systems. The authors have developed an O(nT)-time parsing algorithm for bilexicalized tree adjoining grammars (Schabes, 1992), improving the ... by a CFG in CNF. In this paper we adopt the following conven- tions: a, b, c, d denote symbols in VT, w, x, y de- note strings in V~, and a, ~, denote strings in (VN t_J VT)*. The input to ... reads it. three models in (Collins, 1997) are susceptible to the O(n 3) method (cf. Collins's O(nh)). Our dynamic programming techniques for cheaply attaching head information to deriva-...