COSATA: A Constraint Satisfaction Solver and Interpreted Language for Semi-Structured Tables of Sentences

1Citations
Citations of this article
59Readers
Mendeley users who have this article in their library.

Abstract

This work presents COSATA, an intuitive constraint satisfaction solver and interpreted language for knowledge bases of semi-structured tables expressed as text. The stand-alone COSATA solver allows easily expressing complex compositional “inference patterns” for how knowledge from different tables tends to connect to support inference and explanation construction in question answering and other downstream tasks, while including advanced declarative features and the ability to operate over multiple representations of text (words, lemmas, or part-of-speech tags). COSATA also includes a hybrid imperative/declarative interpreted language for expressing simple models through minimally-specified simulations grounded in constraint patterns, helping bridge the gap between question answering, question explanation, and model simulation. The solver and interpreter are released as open source.

Cite

CITATION STYLE

APA

Jansen, P. A. (2020). COSATA: A Constraint Satisfaction Solver and Interpreted Language for Semi-Structured Tables of Sentences. In EMNLP 2020 - Conference on Empirical Methods in Natural Language Processing, Proceedings of Systems Demonstrations (pp. 70–76). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2020.emnlp-demos.10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free