Parsers more powerful than those for CFGs often incur high time costs.
lCFRS parsers have a time complexity that is polynomial in the sentence length, but with a degree that is determined by properties of the grammar.