Giovanni de Felice (University of Oxford) |
Konstantinos Meichanetzidis (University of Oxford, Cambridge Quantum Computing Ltd.) |
Alexis Toumi (University of Oxford) |
Distributional compositional (DisCo) models are functors that compute the meaning of a sentence from the meaning of its words. We show that DisCo models in the category of sets and relations correspond precisely to relational databases. As a consequence, we get complexity-theoretic reductions from semantics and entailment of a fragment of natural language to evaluation and containment of conjunctive queries, respectively. Finally, we define question answering as an NP-complete problem. |
ArXived at: https://dx.doi.org/10.4204/EPTCS.323.6 | bibtex | |
Comments and questions to: eptcs@eptcs.org |
For website issues: webmaster@eptcs.org |