Thursday, July 20, 2006

 

#7 Applying COGEX to Recognize Textual Entailment (from RTE 1)

Abstract

The PASCAL RTE challenge has helped
LCC to explore the applicability of enhancements
that have been made to our
logic form representation and WordNet
lexical chains generator. Our system
transforms each T-H pair into logic form
representation with semantic relations.
The system automatically generates NLP
axioms serving as linguistic rewriting
rules and lexical chain axioms that connect
concepts in the hypothesis and text.
A light set of simple hand-coded world
knowledge axioms are also included. Our
COGEX logic prover is then used to attempt
to prove entailment. Semantic relations,
WordNet lexical chains, and NLP
axioms all helped the logic prover detect
entailment.

The Paper: www.cs.biu.ac.il/~glikmao/rte05/fowler_et_al.pdf

Comments: Post a Comment



<< Home

This page is powered by Blogger. Isn't yours?