RelTextRank: An Open Source Framework for Building Relational Syntactic-Semantic Text Pair Representations

We present a highly-flexible UIMA-based pipeline for developing structural kernelbased systems for relational learning from text, i.e., for generating training and test data for ranking, classifying short text pairs or measuring similarity between pieces of text. For example, the proposed pipeline can represent an input question and answer sentence pairs as syntacticsemantic structures, enriching them with relational information, e.g., links between question class, focus and named entities, and serializes them as training and test files for the tree kernel-based reranking framework. The pipeline generates a number of dependency and shallow chunkbased representations shown to achieve competitive results in previous work. It also enables easy evaluation of the models thanks to cross-validation facilities.

Other Information

Published in: Proceedings of ACL 2017, System Demonstrations
License: http://creativecommons.org/licenses/by/4.0/
See conference contribution on publisher's website: https://dx.doi.org/10.18653/v1/p17-4014

Conference information: 55th Annual Meeting of the Association for Computational Linguistics-System Demonstrations, Vancouver, Canada, July 30 - August 4, 2017