Recovering Implicit Information
This paper describes the SDC PUNDIT (Prolog UNDerstands Integrated Text), system for processing natural language messages. PUNDIT, written in Prolog, is a highly modular system consisting of distinct syntactic, semantic and pragmatics components. Each component draws on one or more sets of data, including a lexicon, a broad-coverage grammar of English, semantic verb decompositions, rules mapping between syntactic and semantic constituents, and a domain model.
This paper discusses the communication between the syntactic, semantic and pragmatic modules that is necessary for making implicit linguistic information explicit. The key is letting syntax and semantics recognize missing linguistic entities as implicit entities, so that they can be labeled as such, and reference resolution can be directed to find specific referents for the entities. In this way the task of making implicit linguistic information explicit becomes a subset of the tasks performed by reference resolution. The success of this approach is dependent on marking missing syntactic constituents as elided and missing semantic roles as ESSENTIAL so that reference resolution can know when to look for referents.
KeywordsNoun Phrase Disk Drive Mapping Rule Semantic Role Spindle Motor
Unable to display preview. Download preview PDF.
- Dahl, D.A., Focusing and Reference Resolution in PUNDIT, Presented at AAAI, Philadelphia, 1986.Google Scholar
- Dowding, J. and L. Hirschman, Dynamic Translation for Rule Pruning in Restriction Grammar, submitted to AAAI-86, Philadelphia, 1986.Google Scholar
- Fillmore, C.J., “The Case for Case”, in E. Bach and R.T. Harms (eds.), Universals in Linguistic Theory, Holt, Rinehart, and Winston, New York, 1968.Google Scholar
- Gundel, J.K., “Zero-NP Anaphora in Russian”, Chicago Linguistic Society Parasession on Pronouns and Anaphora, 1980.Google Scholar
- L. Hirschman and K. Puder, “Restriction Grammar in Prolog”, in M. Van Caneghem (ed.), Proc. of the First International Logic Programming Conference, Association pour la Diffusion et le Developpement de Prolog, Marseilles, 1982, 85–90.Google Scholar
- Hirschman, L. and K. Puder, “Restriction Grammar: A Prolog Implementation”, in D.H.D. Warren and M. VanCaneghem (eds.), Logic Programming and its Applications, 1985.Google Scholar
- Hirschman, L., “Conjunction in Meta-Restriction Grammar”, Journal of Logic Programming, 1986.Google Scholar
- Kameyama, M., “Zero Anaphora: The Case of Japanese”, Ph.D. thesis, Stanford University, 1985.Google Scholar
- Palmer, M. “Inference Driven Semantic Analysis”, Proceedings of the National Conference on Artificial Intelligence (AAA1–83), Washington, D.C., 1983.Google Scholar
- Palmer, M.S., A Case for Rule Driven Semantic Processing. Proceedings of the 19th ACL Conference, June, 1981Google Scholar
- Palmer, M.S., “Driving Semantics for a Limited Domain”, Ph.D. thesis, University of Edinburgh, 1985.Google Scholar
- Sager, N., Natural Language Information Processing: A Computer Grammar of English and Its Applications, Addison-Wesley, Reading, MA. 1981.Google Scholar
- Sidner, C.L., “Towards a Computational Theory of Definite Anaphora Comprehension in English Discourse”, MIT-AI TR-537, Cambridge, MA, 1979.Google Scholar