Consistent identification in the limit of some of Penn and Buszkowski's classes is NP-hard.
Christophe Costa FlorêncioPublished in: CLIN (1999)
Keyphrases
- np hard
- special case
- worst case
- dependency parsing
- neural network
- approximation algorithms
- integer programming
- optimal solution
- computational complexity
- lower bound
- scheduling problem
- np complete
- data sets
- closely related
- language model
- linear programming
- constraint satisfaction problems
- bayesian networks
- genetic algorithm
- database
- automatic identification
- tree bank
- remains np hard