Partial predicate argument structure matching for entailment determination

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Computational Linguistics at Concordia laboratory system for textual entailment determination is based on shallow, partial predicate-argument structure matching combined with a WordNet-based lexical similarity measure. In this paper we describe experiments with different system settings conducted to assess the potential and limitations of partial predicate-argument structures in textual entailment determination. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Andreevskaia, A., Li, Z., & Bergler, S. (2006). Partial predicate argument structure matching for entailment determination. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3944 LNAI, pp. 332–343). https://doi.org/10.1007/11736790_19

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