Uniform Recognition for Acyclic Context-Sensitive Grammars is NP-complete.
Erik AartsPublished in: COLING (1992)
Keyphrases
- context sensitive
- np complete
- context free
- graph grammars
- np hard
- natural language
- satisfiability problem
- computational complexity
- bounded treewidth
- conjunctive queries
- multiple task learning
- conp complete
- multiword
- spelling correction
- information retrieval
- polynomial time complexity
- character recognition
- activity recognition
- language model
- human activities
- statistical model
- translation model
- grammatical inference
- action recognition
- lower bound
- data mining