Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars.
Karl BringmannPhilip WellnitzPublished in: CPM (2017)
Keyphrases
- tree adjoining
- lower bound
- context free grammars
- upper bound
- branch and bound algorithm
- np hard
- objective function
- branch and bound
- lower and upper bounds
- vc dimension
- optimal solution
- context free
- artificial intelligence
- grammatical inference
- maximum weight
- visual languages
- syntactic pattern recognition
- production rules
- fuzzy logic
- high level