For certain choices of higher-order factors, polynomial time is possible via dynamic programming (McDonald et al., 2005;Carreras, 2007;Koo and Collins, 2010).
bP will typically be asymptotically faster (for a fixed number of iterations) and faster in practice.