Recognizing Textual Entailment Using Inductive Logic Programming
Palkar, Sukhada
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/47006
Description
Title
Recognizing Textual Entailment Using Inductive Logic Programming
Author(s)
Palkar, Sukhada
Contributor(s)
Roth, Dan
Issue Date
2010-05
Keyword(s)
textual entailment
text recognition
language processing
natural language processing
inductive logic programming
Machine LearningArtificial Intelligence
Abstract
Textual entailment is the problem of recognizing, given two pieces of text,
if the meaning of one piece of text can be inferred from (is entailed by)
another. Recognizing textual entailment (RTE) is an important task in
natural language processing (NLP) systems and many tools are available that
aid the process of extraction of characteristics from text. Inductive logic programming algorithms (ILP) are machine learning algorithms that use labeled
examples and an encoding of background knowledge to infer hypotheses that
entail the examples. In this project, we use inductive logic programming
algorithms to solve RTE tasks. We extract and process data characteristics
by using relations from text and evaluate these relations along with the
effectiveness of ILP in solving RTE tasks.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.