{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/49448"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/49448","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Lexical entailment","abstract":"Lexical entailment is a requirement for success in the domains of Recognizing Textual Entailment (RTE) as well as related tasks like Question-Answering and Information Extraction. Previous approaches tend to fall into two camps - those that make use of distributional models and those that make use of knowledge bases such as WordNet. Interestingly, these methods make very different kinds of mistakes and so in this thesis, we construct a new entailment measure by combining these two paradigms in such a way that exploits their differences. We also experiment with including local context and modify an existing approach to achieve the best unsupervised performance so far on the Lexical Substitution task. Overall, we achieve a significant gain in performance on three different evaluations and our approach is also faster than the other distributional approaches we compare to as we are able to avoid fruitless comparisons. Furthermore, we introduce a new approach to evaluate lexical entailment that avoids some of the issues of wordlists - the current conventional way of evaluating lexical entailment, and that can be additionally used to evaluate lexical entailment in context - a novel task introduced in this paper. We also include experiments that show our new lexical entailment model improves performance on the RTE task, the main goal of this work.","abstract_html":"Lexical entailment is a requirement for success in the domains of Recognizing Textual Entailment (RTE) as well as related tasks like Question-Answering and Information Extraction. Previous approaches tend to fall into two camps - those that make use of distributional models and those that make use of knowledge bases such as WordNet. Interestingly, these methods make very different kinds of mistakes and so in this thesis, we construct a new entailment measure by combining these two paradigms in such a way that exploits their differences. We also experiment with including local context and modify an existing approach to achieve the best unsupervised performance so far on the Lexical Substitution task. Overall, we achieve a significant gain in performance on three different evaluations and our approach is also faster than the other distributional approaches we compare to as we are able to avoid fruitless comparisons. Furthermore, we introduce a new approach to evaluate lexical entailment that avoids some of the issues of wordlists - the current conventional way of evaluating lexical entailment, and that can be additionally used to evaluate lexical entailment in context - a novel task introduced in this paper. We also include experiments that show our new lexical entailment model improves performance on the RTE task, the main goal of this work.","abstract_has_math":false,"creators":["Wieting, John"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Roth, Dan"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-05-30T16:44:32Z","date_published":"2014-05-30T16:44:32Z","updated_at":"2026-07-22T22:25:38Z","subjects":["Lexical Entailment","Recognizing Textual Entailment","Word Similarity","Word Representations","Natural Language Processing"],"languages":["en"],"rights":["Copyright 2014 John Wieting"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/49448","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Roth, Dan"]},{"key":"dc:creator","label":"Author","values":["Wieting, John"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-05-30T16:44:32Z","2014-05"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Lexical Entailment","Recognizing Textual Entailment","Word Similarity","Word Representations","Natural Language Processing"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2014 John Wieting"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/49448"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Lexical entailment is a requirement for success in the domains of Recognizing Textual Entailment (RTE) as well as related tasks like Question-Answering and Information Extraction. Previous approaches tend to fall into two camps - those that make use of distributional models and those that make use of knowledge bases such as WordNet. Interestingly, these methods make very different kinds of mistakes and so in this thesis, we construct a new entailment measure by combining these two paradigms in such a way that exploits their differences. We also experiment with including local context and modify an existing approach to achieve the best unsupervised performance so far on the Lexical Substitution task. Overall, we achieve a significant gain in performance on three different evaluations and our approach is also faster than the other distributional approaches we compare to as we are able to avoid fruitless comparisons. Furthermore, we introduce a new approach to evaluate lexical entailment that avoids some of the issues of wordlists - the current conventional way of evaluating lexical entailment, and that can be additionally used to evaluate lexical entailment in context - a novel task introduced in this paper. We also include experiments that show our new lexical entailment model improves performance on the RTE task, the main goal of this work.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2014-05-01T17:14:46Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Wieting_John.pdf: 259601 bytes, checksum: 82f6599b5753912ef78ceb109c282311 (MD5)","Made available in DSpace on 2014-05-30T16:44:32Z (GMT). No. of bitstreams: 2 John_Wieting.pdf: 259593 bytes, checksum: ccb8c9a9b199a89e832ad7e5f8b7a46f (MD5) license.txt: 4062 bytes, checksum: 31c7b30823116f6a26359bfb512fe050 (MD5)"]},{"key":"dc:title","label":"Title","values":["Lexical entailment"]}]}],"canonical_facts":{"dc:contributor":["Roth, Dan"],"dc:creator":["Wieting, John"],"dc:date":["2014-05-30T16:44:32Z","2014-05"],"dc:description":["Lexical entailment is a requirement for success in the domains of Recognizing Textual Entailment (RTE) as well as related tasks like Question-Answering and Information Extraction. Previous approaches tend to fall into two camps - those that make use of distributional models and those that make use of knowledge bases such as WordNet. Interestingly, these methods make very different kinds of mistakes and so in this thesis, we construct a new entailment measure by combining these two paradigms in such a way that exploits their differences. We also experiment with including local context and modify an existing approach to achieve the best unsupervised performance so far on the Lexical Substitution task. Overall, we achieve a significant gain in performance on three different evaluations and our approach is also faster than the other distributional approaches we compare to as we are able to avoid fruitless comparisons. Furthermore, we introduce a new approach to evaluate lexical entailment that avoids some of the issues of wordlists - the current conventional way of evaluating lexical entailment, and that can be additionally used to evaluate lexical entailment in context - a novel task introduced in this paper. We also include experiments that show our new lexical entailment model improves performance on the RTE task, the main goal of this work.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2014-05-01T17:14:46Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Wieting_John.pdf: 259601 bytes, checksum: 82f6599b5753912ef78ceb109c282311 (MD5)","Made available in DSpace on 2014-05-30T16:44:32Z (GMT). No. of bitstreams: 2 John_Wieting.pdf: 259593 bytes, checksum: ccb8c9a9b199a89e832ad7e5f8b7a46f (MD5) license.txt: 4062 bytes, checksum: 31c7b30823116f6a26359bfb512fe050 (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/49448"],"dc:language":["en"],"dc:rights":["Copyright 2014 John Wieting"],"dc:subject":["Lexical Entailment","Recognizing Textual Entailment","Word Similarity","Word Representations","Natural Language Processing"],"dc:title":["Lexical entailment"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:38Z"}