Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees.
Nathanaël FijalkowGuillaume LagardePierre OhlmannPublished in: Electron. Colloquium Comput. Complex. (2018)
Keyphrases
- tight bounds
- parse tree
- upper bound
- semantic role labeling
- semantic analysis
- relation extraction
- dependency parsing
- semantic representation
- tree kernels
- conceptual graphs
- machine learning
- part of speech
- automatic extraction
- natural language text
- structured data
- semi supervised
- probabilistic model
- artificial intelligence