A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus.
Timothy A. D. FowlerPublished in: MOL (2009)
Keyphrases
- computational complexity
- worst case
- improved algorithm
- experimental evaluation
- high accuracy
- detection algorithm
- learning algorithm
- preprocessing
- special case
- np hard
- objective function
- recognition algorithm
- matching algorithm
- expectation maximization
- similarity measure
- clustering method
- optimization algorithm
- computational cost
- search space
- markov random field
- ant colony optimization
- cost function
- natural language
- space complexity
- provably correct