In generating sentences by means of a transformational grammar, it is necessary to analyze trees, testing for the presence or absence of various structures. This analysis occurs at two stages in the generation process--during insertion of lexical items (more precisely, in testing contextual features), and during the transformation process, when…

This report describes the initial evaluation of a text compression algorithm against computer assisted instruction (CAI) material. A review of some concepts related to statistical text compression is followed by a detailed description of a practical text compression algorithm. A simulation of the algorithm was programed and used to obtain…

Answers and examples are given to sixteen questions related to traditional ways of performing the operations of arithmetic. (MP)

An algorithm for item analysis in which item discrimination indices have been defined for the distractors as well as the correct answer is presented. Also, the concept of convergent and discriminant validity is applied to items instead of tests, and is discussed as an aid to item analysis. (Author/JKS)

This introductory article defines and delimits expert systems. The discussion covers the concepts of artificial intelligence, the components of an expert system, and the significance of expert systems when compared to more traditional decision making tools. (CLB)

Describes the use of PROLOG to program knowledge-based information retrieval systems, in which the knowledge contained in a document is translated into machine processable logic. Several examples of the resulting search process, and the program rules supporting the process, are given. (10 references) (CLB)

The production of high quality Arabic-English text poses technical problems that are caused mainly by the high degree of syntactical flexibility which characterizes the Arabic language. This article describes a system which offers some solutions to the problems encountered in processing bilingual Arabic-English text. (Author/EM)

Latent trait test models for responses to dichotomously scored items are considered from the point of view of parameter estimation using a Bayesian statistical approach and the EM estimation algorithm. An example using the Rasch model is presented. (Author/JKS)

The mathematics associated with division is discussed, working from a theorem for the real division algorithm. Real-world, geometric, and algebraic approaches are discussed, as are related topics. (MNS)

Presented an empathy algorithm, a procedure for deciding whether to use an interchangeable or an additive empathy response and instructions for the construction of each response, to a randomly chosen group of novice counselors (N=23). The experimental group performed significantly better in counseling a role-played client than did controls.…

An algorithm for estimation of means and standard deviations or raw scores underlying table values of standard test scores is presented. An application of a computer program, operationalizing the suggested algorithm, is discussed within the framework of a comparison of estimated and known table values for sample Minnesota Multiphasic Personality…

Previous findings from the study within which this research is located had uncovered students' approaches to learning in the context of a second year chemical engineering course. Using an analysis of students' reflections on their experience, the study has shown the existence of three approaches to learning in this context: an 'information-based'…

One set of approaches to the problem of clustering with dichotomous data in cluster analysis (CA) was studied. The techniques developed for clustering with binary data involve calculating distances between observations based on the variables and then applying one of the standard CA algorithms to these distances. One of the groups of distances that…

A mathematical programming approach is presented for computer adaptive testing (CAT) with many constraints on the item and test attributes. Because mathematical programming problems have to be solved while the examinee waits for the next item, a fast implementation of the Branch-and-Bound algorithm is needed for this approach. Eight modifications…