Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees.
Guillaume LagardeNutan LimayeSrikanth SrinivasanPublished in: Comput. Complex. (2019)
Keyphrases
- parse tree
- lower bound
- semantic analysis
- dependency parsing
- semantic representation
- relation extraction
- structured data
- semantic role labeling
- objective function
- part of speech
- conceptual graphs
- optimal solution
- noun phrases
- tree kernels
- representation language
- semantic relations
- natural language
- natural language text
- question answering
- high level
- machine learning
- data mining