CAI with a restricted vocabulary
β Scribed by Norman F. Salt
- Book ID
- 104139676
- Publisher
- Elsevier Science
- Year
- 1977
- Weight
- 602 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0020-7373
No coin nor oath required. For personal study only.
β¦ Synopsis
Text compression techniques can be applied to computer assisted instruction (CAI) text to reduce both computer storage requirements and volume of transmission between the computer and student terminals. One of the more efficient text compression algorithms requires a large dictionary containing all the words in the text. Unfortunately, the use of a large dictionary is not feasible with many current CAI systems. This study investigates some implications of authoring CAI te~t using words from a short dictionary established prior to writing the text. A dictionary of approximately one thousand words was defined. Author subjects wrote two sets of CAI text: one in natural English and one using words from the short dictionary. The natural English text was compressible to about two-thirds of the normal computer storage requirements; the restricted English, to less than one-third. There was no significant difference in the instructional value of the different types of text.
π SIMILAR VOLUMES
Let G = (V, A) be a digraph with a root r, and suppose that each arc a of G has integers b(a) and b'(a) with b'(a)\* b(a)aO. In this paper we give necessary and sufficient conditions for the existence of k r-arborescences in G such that they cover each arc a at least b(a) and at most b'(a) times and