Generating Examples for Use in Tutorial Explanations: The Use of a Subsumption Based Classifier

Abstract

Examples form an integral and very important part of many descriptions, especially in contexts such as tutoring and documentation generation. Previous computational work on example generation has focused on the issue of generating valid examples in different domains. However, there are a large number of examples that can be generated for a given concept, and it is important that examples intended for tutoring situations illustrate specific features that need to be communicated. There is also a strong interaction between the examples and the accompanying textual description. The number of examples to be presented, the order in which they are to be presented, and the position of the examples with respect to the text are all dependent upon the examples generated for use in the presentation. It is therefore important that the example generator be able to generate a set of suitable examples in response to a tutoring goal in a given situation. In this paper, we present one framework, based on the use of a subsumption classifier, that facilitates the generation of appropriate tutorial examples. We illustrate the working of this framework by describing the generation of examples to illustrate the syntax in the programming language LISP.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1994
Accession Number
ADA286028

Entities

People

  • Cecile L. Paris
  • Vibhu O. Mittal

Organizations

  • University of Southern California

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Artificial Intelligence
  • Computer Languages
  • Computer Programming
  • Computer Science
  • Demographic Cohorts
  • Educational Psychology
  • Expert Systems
  • Generators
  • Grammars
  • Information Science
  • Language
  • Machine Learning
  • Natural Languages
  • Programming Languages
  • Sequences

Readers

  • Artificial Intelligence
  • Computational Linguistics