Results of analysis of 1,377 spelling error forms including three categories of spelling errors (consonantal, vowel, and sequential) demonstrate that majority of spelling errors are highly predictable when set of predefined rules based on phonological and sequential considerations are followed algorithmically. Eleven references and equivalent…

Considers problem of optimal scheduling of Boolean expression (each Boolean variable represents binary outcome of program module) on single-processor system. Optimization discussed consists of finding operand arrangement that minimizes average execution costs representing consumption of resources (elapsed time, main memory, number of…

Following a discussion of derivative versus assignment indexing, use of roles, and concept behind Preserved Concept Indexing System, features of PERMDEX (microcomputer program to assist in creation of permuted printed index) are described including indexer input and prompts, the shunting algorithm, and sorting and printing routines. Fourteen…

Describes an indexing technique based on overlapping word fragments as reference strings that are linked in a directed graph structure which makes possible exact match-, partial match-, and masked-partial match-retrieval and indicates search strategies for each case. Eight figures, two tables, and nine references are provided. (RBF)

This paper describes an intelligent spelling error correction system for use in a word processing environment. The system employs a dictionary of 93,769 words and, provided the intended word is in the dictionary, it identifies 80 percent to 90 percent of spelling and typing errors. Nine references are cited. (Author/EJS)

Addresses problem of developing machine-based information system capable of indicating one document, out of a set of documents written in natural language, which shows maximal degree of homeosemy (relationship in meaning between two texts language-fragments ) toward natural language query. Linguistic aspects, information traces, trigrams,…