A polynomial time algorithm for the Lambek calculus with brackets of bounded order.
Max I. KanovichStepan L. KuznetsovGlyn MorrillAndre ScedrovPublished in: CoRR (2017)
Keyphrases
- computational complexity
- times faster
- computational cost
- detection algorithm
- learning algorithm
- search space
- probabilistic model
- recognition algorithm
- cost function
- dynamic programming
- worst case
- high accuracy
- optimal solution
- provably correct
- matching algorithm
- theoretical analysis
- computationally efficient
- objective function
- clustering method
- experimental evaluation
- np hard
- convergence rate
- special case
- improved algorithm
- space complexity
- approximation ratio