RESEARCH IN SYNTACTIC ANALYSIS OF RUSSIAN, WHICH WAS DEVELOPED IN A PROGRAM FOR COMPUTER-AIDED RUSSIAN-ENGLISH TRANSLATION, IS DESCRIBED. THE CORPUS CONSISTED OF 15 RUSSIAN MATHEMATICAL ARTICLES. THE THEORY USED IS THE "FULCRUM" APPROACH OF BUNKER-RAMO, BUT THE COMPUTER IMPLEMENTATION HAS DEVELOPED ALONG DISTINCT LINES. THREE TYPES OF…

This fourth annual report summarizes the investigation of (1) a "sentence dictionary" and (2) a "word government dictionary" for use in automatic abstracting and extracting systems. The theory behind the sentence dictionary and its compilation is that a separation of significant from nonsignificant sentences can be accomplished on the basis of…

The strategy for PASP proposed here is characterized by the: (1) ad hoc nature of some of its parts; (2) use of a linear string grammar, (3) definition of probability rules, (4) translation of those rules into a priori rules for the string grammar, (5) context sensitivity, and (6) flexibility of the system. (Author/KM)

This paper reports a portion of a research effort to develop a program which will simulate the language learning behavior of humans. Here presented is a heuristic parsing procedure which accepts natural language sentences and produces for each a form of analysis called a "labeled dependency tree." The formal grammar on which the…

A comprehensive system for transformational grammar has been designed and is being implemented on the IBM 360/67 computer. The system deals with the transformational model of syntax, along the lines of Chomsky's "Aspects of the Theory of Syntax." The major innovations include a full and formal description of the syntax of a transformational…

A CLASS OF TRANSFORMATION GRAMMARS IS DEFINED AND A COMPUTER PROGRAM FOR SENTENCE ANALYSIS IS DESCRIBED AND DOCUMENTED WITH RESPECT TO THIS CLASS. THE PROGRAM EXISTS IN PURE LISP FORM AND IN MIXED LISP AND IBM 7090 ASSEMBLY LANGUAGE FORM. THE PAPER CONTAINS INFORMATION TO PERMIT THE USER TO WRITE HIS OWN TRANSFORMATIONAL GRAMMAR. COMPUTER PROGRAM…

A COMPUTER PROCEDURE IS DESCRIBED FOR PARSING RUSSIAN SENTENCES WITH A CONTEXT-FREE RECOGNITION GRAMMAR. THIS IS THE FIRST PROJECT UNDER A PROGRAM FOR THE INVESTIGATION OF SEVERAL ASPECTS OF NATURAL LANGUAGE DATA PROCESSING BY FORMALIZED METHODS TO DETERMINE THE USEFULNESS OF FORMALIZED LINGUISTIC TECHNIQUES IN PRACTICAL LANGUAGE DATA PROCESSING…

The EYEBALL information system is designed for students of literature, with special applications to literary style, criticism, and the history of ideas. (Authors)

This paper describes PAL--a new computer language. It is used as a pedagogical vehicle in an undergraduate subject called "Programming Linguistics." This subject is designed primarily for sophomores who anticipate a major professional interest in computer science and has two objectives. The first is to study linguistic constructs for the…

For the two years prior to this report the Computational Linguistics Project in the Computer Science Department at Stanford University was engaged in research leading to computer programs for accepting and manipulating transformational grammars corresponding to a version of the theory based on Chomsky's "Aspects of the Theory of Syntax." These…

The papers in this volume describe computer runs with six different transformational grammars, in each case using the computer system for transformational grammar described in AL 002 220. They are collected as examples which, it is hoped, will encourage other linguistics to use the system. The motivation for the first three projects described was…

Research supported in part by a grant from the National Science Foundation. (DD)

In contrast to conventional information storage and retrieval systems in which a body of knowledge is thought of as an indexed codex of documents to which access is obtained by an appropriately indexed query, this interdisciplinary study aims at an understanding of what is "knowledge" as distinct from a "data file," how this knowledge is acquired,…

A computer program for measuring the complexity of syntactic structures in different levels of graded reading materials and in children's oral and written language is presented. (RW)

When a grammar is expressed in augmented transition network (ATN) form, the problem of detecting syntactic ambuguity reduces to finding all possible paths through the ATNs. Each successfully terminating path through the ATN generates an acceptable parsing of the input string. Two ATN forms, minimal-node and pseudo-tree, are described along with…