Bounding the rank by a constant might be too strong a limitation in natural language parsing applications, however.
in the general case the running time of our algorithm contains a factor that is an exponential function of the rank of the input grammar.