The probabilistic parser keeps a probability p for every active arc and every constituent: When extending γ using c, we have: When creating c from the completed active arc γ : Although search queries are usually short, the running time is still an issue when the length of the query exceeds 7 or 8.
a couple of techniques have been used to make the naïve algorithm more efficient.