Understanding Natural Language Instructions: A Computational Approach to Purpose Clauses
| dc.contributor.author | Di Eugenio, Barbara | |
| dc.date | 2023-05-16T23:52:00.000 | |
| dc.date.accessioned | 2023-05-22T19:58:06Z | |
| dc.date.available | 2023-05-22T19:58:06Z | |
| dc.date.issued | 1993-12-01 | |
| dc.date.submitted | 2006-09-13T08:05:46-07:00 | |
| dc.description.abstract | Human agents are extremely flexible in dealing with Natural Language instructions. I argue that most instructions don't exactly mirror the agent's knowledge, but are understood by accommodating them in the context of the general plan the agent is considering: the accommodation process is guided by the goal(s) that the agent is trying to achieve. Therefore a NL system which interprets instructions must be able to recognize and/or hypothesize goals; it must make use of a flexible knowledge representation system, able to support the specialized inferences necessary to deal with input action descriptions that do not exactly match the stored knowledge. The data that support my claim are Purpose Clauses (PCs), infinitival constructions as in Do α to do β, and Negative Imperatives. I present a pragmatic analysis of both PCs and Negative Imperatives. Furthermore, I analyze the computational consequences of PCs, in terms of the relations between actions PCs express, and of the inferences an agent has to perform to understand PCs. I propose an action representation formalism that provides the required flexibility. It has two components. The Terminological Box (TBox) encodes linguistic knowledge about actions, and is expressed by means of the hybrid system CLASSIC [Brachman et al., 1991]. To guarantee that the primitives of the representation are linguistically motivated, I derive them from Jackendoff's work on Conceptual Structures [1983; 1990]. The Action Library encodes planning knowledge about actions. The action terms used in the plans are those defined in the TBox. Finally, I present an algorithm that implements inferences necessary to understand Do α to do β, and supported by the formalism I propose. In particular, I show how the TBox classifier is used to infer whether α can be assumed to match one of the substeps in the plan for β, and how expectations necessary for the match to hold are computed. | |
| dc.description.comments | University of Pennsylvania Institute for Research in Cognitive Science Technical Report No. IRCS-93-52. | |
| dc.identifier.uri | https://repository.upenn.edu/handle/20.500.14332/37616 | |
| dc.legacy.articleid | 1199 | |
| dc.legacy.fulltexturl | https://repository.upenn.edu/cgi/viewcontent.cgi?article=1199&context=ircs_reports&unstamped=1 | |
| dc.source.issue | 198 | |
| dc.source.journal | IRCS Technical Reports Series | |
| dc.source.status | published | |
| dc.title | Understanding Natural Language Instructions: A Computational Approach to Purpose Clauses | |
| dc.type | Dissertation/Thesis | |
| digcom.contributor.author | Di Eugenio, Barbara | |
| digcom.identifier | ircs_reports/198 | |
| digcom.identifier.contextkey | 205048 | |
| digcom.identifier.submissionpath | ircs_reports/198 | |
| digcom.type | thesis | |
| dspace.entity.type | Publication | |
| upenn.schoolDepartmentCenter | IRCS Technical Reports Series |
Files
Original bundle
1 - 1 of 1