Exploring Knowledge Graphs in an Interpretable Composite Approach for Text Entailment


  • Vivian S. Silva University of Passau
  • André Freitas University of Manchester
  • Siegfried Handschuh University of Passau




Recognizing textual entailment is a key task for many semantic applications, such as Question Answering, Text Summarization, and Information Extraction, among others. Entailment scenarios can range from a simple syntactic variation to more complex semantic relationships between pieces of text, but most approaches try a one-size-fits-all solution that usually favors some scenario to the detriment of another. We propose a composite approach for recognizing text entailment which analyzes the entailment pair to decide whether it must be resolved syntactically or semantically. We also make the answer interpretable: whenever an entailment is solved semantically, we explore a knowledge base composed of structured lexical definitions to generate natural language humanlike justifications, explaining the semantic relationship holding between the pieces of text. Besides outperforming wellestablished entailment algorithms, our composite approach gives an important step towards Explainable AI, using world knowledge to make the semantic reasoning process explicit and understandable.




How to Cite

Silva, V. S., Freitas, A., & Handschuh, S. (2019). Exploring Knowledge Graphs in an Interpretable Composite Approach for Text Entailment. Proceedings of the AAAI Conference on Artificial Intelligence, 33(01), 7023-7030. https://doi.org/10.1609/aaai.v33i01.33017023



AAAI Technical Track: Natural Language Processing