Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees.
Guillaume LagardeNutan LimayeSrikanth SrinivasanPublished in: MFCS (2017)
Keyphrases
- parse tree
- lower bound
- semantic analysis
- semantic role labeling
- dependency parsing
- relation extraction
- conceptual graphs
- objective function
- part of speech
- semantic representation
- tree kernels
- structured data
- optimal solution
- artificial intelligence
- automatic extraction
- production rules
- general purpose
- natural language text
- information extraction
- representation language