Lower Bounds and PIT for Non-Commutative Arithmetic circuits with Restricted Parse Trees.
Guillaume LagardeNutan LimayeSrikanth SrinivasanPublished in: Electron. Colloquium Comput. Complex. (2017)
Keyphrases
- parse tree
- lower bound
- semantic analysis
- relation extraction
- semantic role labeling
- dependency parsing
- semantic representation
- structured data
- tree kernels
- natural language text
- optimal solution
- objective function
- noun phrases
- information extraction
- part of speech
- named entities
- conceptual graphs
- representation language
- production rules
- knowledge discovery
- natural language
- high level
- artificial intelligence