Tractable Parsing for CCGs of Bounded Degree.
Lena Katharina SchifferMarco KuhlmannGiorgio SattaPublished in: Comput. Linguistics (2022)
Keyphrases
- bounded treewidth
- bounded degree
- np complete
- graph theoretic
- natural language
- natural language processing
- natural language parsing
- context free grammars
- computational complexity
- conjunctive queries
- information retrieval
- dependency parsing
- boolean functions
- decision problems
- state space
- dynamic programming
- computationally tractable
- special case
- reinforcement learning
- databases