Showing papers on "Rule-based machine translation published in 1982"
12 Jul 1982
TL;DR: It is shown that for some classes of recursive languages, from the characteristic function of any L in ℒ an approximate decision procedure for L with no more than n+1 mistakes can be (uniformly effectively) inferred in the limit; whereas, in general, a grammar with no less than n mistakes cannot be inferred.
Abstract: We show that for some classes ℒ of recursive languages, from the characteristic function of any L in ℒ an approximate decision procedure for L with no more than n+1 mistakes can be (uniformly effectively) inferred in the limit; whereas, in general, a grammar (generation procedure) with no more than n mistakes cannot; for some classes an infinite sequence of perfectly correct decision procedures can be inferred in the limit, but single grammars with finitely many mistakes cannot; and for some classes an infinite sequence of decision procedures each with no more than n+1 mistakes can be inferred, but an infinite sequence of grammars each with no more than n mistakes cannot. This is true even though decision procedures generally contain more information than grammars. We also consider inference of grammars for r.e. languages from arbitrary texts, i.e., enumerations of the languages. We show that for any class of languages ℒ, if some, machine, from arbitrary texts for any L in ℒ, can infer in the limit an approximate grammar for L with no more than 2·n mistakes, then some machine can infer in the limit, for each language in ℒ, an infinite sequence of grammars each with no more than n mistakes. This reduction from 2·n to n is best possible. From these and other results we obtain and compare several natural, inference hierarchies. Lastly we show that if we restrict ourselves to recursive texts, there is a machine which, for any r.e. language, infers in the limit an infinite sequence of grammars each with only finitely many mistakes. We employ recursion theoretic methods including infinitary and ordinary recursion theorems.
186 citations
TL;DR: It is shown that an attribute system can be translated (in a certain way) into a recursive program scheme if and only if it is strongly noncircular, which is decidable in polynomial time.
156 citations
TL;DR: The DIAGRAM system as discussed by the authors is an augmented phrase-structure grammar with rule procedures that allow phrases to inherit attributes from their constituents and to acquire attributes from the larger phrases in which they themselves are constituents.
Abstract: An explanatory overview is given of DIAGRAM, a large and complex grammar used in an artificial intelligence system for interpreting English dialogue. DIAGRAM is an augmented phrase-structure grammar with rule procedures that allow phrases to inherit attributes from their constituents and to acquire attributes from the larger phrases in which they themselves are constituents. These attributes are used to set context-sensitive constraints on the acceptance of an analysis. Constraints can be imposed by conditions on dominance as well as by conditions on constituency. Rule procedures can also assign scores to an analysis to rate it as probable or unlikely. Less likely analyses can be ignored by the procedures that interpret the utterance. For every expression it analyzes, DIAGRAM provides an annotated description of the structure. The annotations supply important information for other parts of the system that interpret the expression in the context of a dialogue.Major design decisions are explained and illustrated. Some contrasts with transformational grammars are pointed out and problems that motivate a plan to use metarules in the future are discussed. (Metarules derive new rules from a set of base rules to achieve the kind of generality previously captured by transformational grammars but without having to perform transformations on syntactic analyses.)
100 citations
25 Jan 1982
TL;DR: This paper introduces a formal notition, the semanfic grammar, for defining programming languages, which handles both static and dynamic semantics, both compile and run-time actions.
Abstract: This paper introduces a formal notition, the semanfic grammar, for defining programming languages. Semantic grammars combine denotational semantics and attribute grammars. They describe syntax and wmantics together, without separate tists of formulas or rules that need to be put into correspondence. They handle both static and dynamic semantics, both compileand run-time actions. ‘Ihey describe languages at a high level of abstraction.
95 citations
TL;DR: Rules for semantic interpretation are given which include the determination of scoping of modifiers (with quantifier scoping as a special case) and the notions of slots and slot-filling play an important role, based on previous work by the author.
80 citations
TL;DR: A generalization of the ATN formalism is reported that allows ATN grammars to be written to parse labelled directed graphs and generate a surface string as its analysis.
Abstract: The augmented transition network (ATN) is a formalism for writing parsing grammars that has been much used in Artificial Intelligence and Computational Linguistics. A few researchers have also used ATNs for writing grammars for generating sentences. Previously, however, either generation ATNs did not have the same semantics as parsing ATNs, or they required an auxiliary mechanism to determine the syntactic structure of the sentence to be generated. This paper reports a generalization of the ATN formalism that allows ATN grammars to be written to parse labelled directed graphs. Specifically, an ATN grammar can be written to parse a semantic network and generate a surface string as its analysis. An example is given of a combined parsing-generating grammar that parses surface sentences, builds and queries a semantic network knowledge representation, and generates surface sentences in response.
78 citations
Book•
01 Jun 1982
TL;DR: The overall structure of the AG is compared with other attribute grammars and name and expression analysis is described, as well as semantic checks and error handling.
Abstract: and survey.- Procedure for the AG.- Comparison of the AG with other attribute grammars.- Experiences with attribute grammars.- Overall structure of the AG.- Declaration elaboration.- Name and expression analysis.- Semantic checks and error handling.- Attribute types.
46 citations
01 Jun 1982
TL;DR: LINGUIST-86 generates attribute evaluators efficient enough to run on a microcomputer at speeds competitive with other translators on the system, and applies an optimization called static subsumption that eliminates many copy rules from the generatedevaluators.
Abstract: LINGUIST-86 is a commercially-developed translator-writing-system based on attribute grammars [K]. From an input attribute grammar it generates a set of high-level language source modules that form an alternating-pass attribute evaluator [JW]. LINGUIST-86 generates attribute evaluators efficient enough to run on a microcomputer at speeds competitive with other translators on the system. The Attributed Program Tree is kept on secondary storage rather than in randomly-accessed memory, thus allowing non-trivial inputs to be evaluated on a microcomputer system. LINGUIST-86 also applies an optimization called static subsumption that eliminates many copy rules from the generated evaluators. LINGUIST-86 is itself written as an 1800 line attribute grammar and is self-generating.
43 citations
04 Oct 1982
TL;DR: This paper summarizes some recent results on graph languages generated by edge replacement and shows that their languages are fixed points of their productions and that they can be generated by language operations from finite graph languages.
Abstract: Edge replacement systems provide a simple mechanism to generate graph languages. They generalize context-free (string) grammars to the case of graphs. This paper summarizes some recent results on graph languages generated by edge replacement. Especially, we show that our languages are fixed points of their productions (considered as equations) and that they can be generated by language operations (substitution and iteration) from finite graph languages.
37 citations
TL;DR: The Augmented Transition Network formalism provides a convenient environment for developing syntactic waveform analysis techniques and can be extended in several ways to provide error correcting and non-left-right parsing capabilities.
29 citations
01 Jun 1982
TL;DR: Quantitative measurements of the automatically generated compilers suggest that an efficient compiler can be produced from an attribute grammar, and a carefully optimized implementation of the compiler-compiler is required.
Abstract: The adequacy of attribute grammars as a compiler writing tool is studied on the basis of the experiences on attribute grammars for Pascal and a subset of Euclid. A qualitative assessment of the grammars shows that the compiler oriented view in the design of an attribute grammar tends to make the grammar hard to understand. A design discipline is proposed to improve the comprehensibility of the grammar. Quantitative measurements of the automatically generated compilers suggest that an efficient compiler can be produced from an attribute grammar. To achieve this, a carefully optimized implementation of the compiler-compiler is required.
TL;DR: This paper discusses the failure of machine translation Systems that attempt to translate without understanding the input text, and presents examples which such Systems would be likely to fail, and argues for a representational theory, MOPs, which is currently being implemented.
Abstract: In this paper we discuss the failure of machine translation Systems that attempt to translate without understanding the input text. We present examples o n which such Systems would be likely tofail, and use these examples t o argue foran anderstanding-based translation System. Using translation examples, we argue for a representational theory, MOPs, which we present äs pari of an understanding theory for use in a translation System. We then describe a system that is currently being implemented, called MOPTRANS, which uses MOPs.
05 Jul 1982
TL;DR: A new approach to machine translation, based on Montague grammar, and an experimental translation system, Rosetta, designed according to this approach, which is a multi-lingual system which uses 'logical derivation trees' as intermediate expressions.
Abstract: The paper describes a new approach to machine translation, based on Montague grammar, and an experimental translation system, Rosetta, designed according to this approach. It is a multi-lingual system which uses 'logical derivation trees' as intermediate expressions.
TL;DR: It is concluded that the procedural logic approach provides an effective programming system that is promising for accomplishing natural language computations on mini- and microcomputers as well as on large mainframes.
Abstract: A system of symmetric clausal logic axioms is shown to transform a thirteen-sentence narrative about a v-2 rocket flight into semantic case relations. The same axioms translate the case relations into english sentences. An approach to defining schemas in clausal logic is presented and applied in the form of a mini-flight schema to two paragraphs of the text to compute a partitioning of the semantic network into the causal organization of a flight. Properties of rule symmetry and network condensibility are noted to be of importance for natural language processing. Because of the conciseness of the logic interpreter and the clausal representation for grammars and schemes, it is concluded that the procedural logic approach provides an effective programming system that is promising for accomplishing natural language computations on mini- and microcomputers as well as on large mainframes. 29 references.
01 Jun 1982
TL;DR: This work focuses on the part of a compiler between syntax analysis and code generation, and the semantic description is analogous to a syntax directed construction of a flow diagram for a program.
Abstract: We focus on the part of a compiler between syntax analysis and code generation. A language is specified by adding semantic rules in a functional notation to the syntax of the language. Starting with a small sublanguage of while statements, the semantics of the statement constructs of C is built up incrementally. Using a small ad hoc code generator, a compiler has automatically been constructed from the semantics. The semantic description is analogous to a syntax directed construction of a flow diagram for a program. In analogy with grammars and parser generators, minimal knowledge of the underlying theory is required.For the control flow aspects of languages, efficient compilers can quickly be generated.
TL;DR: The nearest-neighbor decision rule for syntactic patterns is applied to seismic pattern classification and another method using finite-state grammars inferred from the training samples and error-correcting parsers is implemented.
Abstract: The nearest-neighbor decision rule for syntactic patterns is applied to seismic pattern classification. Each pattern is represented by a string. The string-to-string distance is used as a similarity measure. Another method using finite-state grammars inferred from the training samples and error-correcting parsers is also implemented. Both methods show equal recognition accuracy; however, the nearest-neighbor rule is much faster in computation speed. The classification results of real earthquake/explosion data are presented.
IBM1
TL;DR: The goal of this paper is to illustrate something of the approach to grammatical theory and description made possible by the framework of arc pair grammar as described in Johnson and Postal, and to show how this framework makes available novel and otherwise unavailable hypotheses about grammatical structure.
Abstract: The goal of this paper1 is to illustrate something of the approach to grammatical theory and description made possible by the framework of arc pair grammar (henceforth: APG) as described in Johnson and Postal (to appear). This framework is not easy to discuss currently because its conceptions of the two basic aspects of grammatical theory, the nature of sentences and the nature of grammars, are novel. The APG conception of sentence is an outgrowth of previous ideas in relational grammar. Nonetheless, it contains many unique elements and the previous ideas have been extensively reinterpreted and embedded in a richer and more extensive framework. The APG conception of grammars is entirely novel. It would be misleading to speak about sentences without saying something about grammars, so I shall begin by saying a little about the view of grammar and grammatical rule inherent to the APG framework. Then I illustrate how this conception applies to an actual range of problems. The idea is to show how this framework makes available novel and otherwise unavailable hypotheses about grammatical structure, of a type currently unknown to grammatical discussions.
05 Jul 1982
TL;DR: An English-into-Japanese translation system named ATHENE based on a Heuristic Parsing Model (HPM) has been developed and shows some advantageous points such as simplification of transforming and generating phase, semilocalization of multiple meaning resolution, and extendability for future grammatical refinement.
Abstract: Practical machine translation must be considered from a heuristic point of view rather than from a purely rigid analytical linguistic method. An English-into-Japanese translation system named ATHENE based on a Heuristic Parsing Model (HPM) has been developed. The experiment shows some advantageous points such as simplification of transforming and generating phase, semilocalization of multiple meaning resolution, and extendability for future grammatical refinement. HPM-base parsing process, parsed tree, grammatical data representation, and translation results are also described.
04 Oct 1982
TL;DR: This paper presents a new approach to the use of graph grammars for syntactic pattern recognition with real-time implications for graph recognition.
Abstract: This paper presents a new approach to the use of graph grammars for syntactic pattern recognition.
TL;DR: It is shown that applying grammars to stories bears no analogy to applying gramMars to sentences; moreover, the alleged benefits of such application, such as a derived constituent structure, can be shown to be illusory.
05 Jul 1982
TL;DR: This report presents a framework for expressing how choices are made in systemic grammars as a combination of systemic syntatic description and explicit choice processes, called 'choice experts'.
Abstract: : Systemic grammar is one of the major varieties of syntactic theory in modern linguistics. It was originally defined by Michael A. K. Halliday around 1960 and has since been developed extensively by him and others. Unlike transformational grammar, systemic grammar is oriented to the ways that language functions for its users. Systemic grammars have been used in several well-known language-processing programs and have been found to be very advantageous for computer generation of text. This report presents a framework for expressing how choices are made in systemic grammars. Formalizing the description of choice processes enriches descriptions of the syntax and semantics of languages, and it contributes to constructive models of language use. There are applications in education and computation. The framework represents the grammar as a combination of systemic syntatic description and explicit choice processes, called 'choice experts'. Choice experts communicate across the boundary of the grammar to its environment, exploring an external intention to communicate. The environment's answers lead to choices and thereby to creation of sentences and other units, tending to satisfy the intention to communicate. The experts' communicative framework includes an extension to the systemic notion of a function, in the direction of a more explicit semantics. Choice expert processes are presented in two notations, one informal and the other formal. The informal notation yields a grammar-guided conversation in English between the grammar and its environment, while the formal notation yields complete accounts of what the grammar produces given a particular circumstance and intent. (Author)
05 Jul 1982
TL;DR: The purpose of FKR-0 is to stored information required for machine translation processing as flexibly as possible, and to make the translation system as expandable as possible.
Abstract: This paper describes a new knowledge representation called "frame knowledge representation-0" (FKR-0), and an experimental machine translation system named ATLAS/I which uses FKR-0.The purpose of FKR-0 is to stored information required for machine translation processing as flexibly as possible, and to make the translation system as expandable as possible.
05 Jul 1982
TL;DR: This paper describes an approach to Japanese-English translation through internal expressions which are similar to those used in the recent approach to English-Japanese translation, focused on construction of the internal expressions of Japanese sentences based on case structures of predicates.
Abstract: This paper describes an approach to Japanese-English translation through internal expressions which are similar to those used in our recent approach to English-Japanese translation [2]. Attention is focused on construction of the internal expressions of Japanese sentences based on case structures of predicates and also conversion of the Japanese internal expressions to the English ones for generating good English sentences in conventional use. Finally, associated with translation, extraction of specified translated information from Japanese patent claim sentences is described briefly.
01 Nov 1982
TL;DR: A language translation schema (syntax-directed translation) is employed to characterize the time-varying process of an image sequence and the formulation of string translation is extended to trees using a generalized syntax-directedtranslation schema.
Abstract: In a previous a]er [1] we proposed a syntactic method for the analysis of time-varying image problems. A language translation schema (syntax-directed translation) is employed to characterize the time-varying process of an image sequence. The formulation of string translation is extended to trees using a generalized syntax-directed translation schema. The generalized model is then compared with the conventional top-down and bottom-up tree translation models. A parsing algorithm for this generalized tree translation schema is presented. A traffic monitoring system is designed using the tree translation schema to model vehicle motion patterns.
TL;DR: It is argued that sentence grammars necessarily provide desirable models for the creation of storygrammars, but that the understanding of the function and structure of stories can be enhanced by noting how stories and sentences are different, using terms and concepts devised primarily for the description of sentences.
05 Jul 1982
TL;DR: A description of the translation process using a simple German sentence is presented, and a discussion of the current state of the linguistic component is discussed, along with comaents on what improvements are necessary in the development of the system.
Abstract: Although there has been work on machine translation since the early 1950"s, it is only in the last few years that ~ systems have become capable of p~'oductng output and-where near the quality needed for widespread use. The LinguAe-tics Research Center (LRC) at the University of Texan at Aus-tin has developed a working machine translation system. METAL, the actual translation system, produces quality E~l£sh translations for German technical manuals. Experiments conducted with up to 200 contiguous pa~es of text have been most en-court! the LRC plans to .have a production system by early 1983. METAL is a modular system in which the lexicons, grammar, and analyzer are distinct packages, each of which may be modified without affecting the other two. This paper will present an overview of METAL's ltnguAsttc component, giving a geners~ overview of the scope and format of the METAL lexicons and a somewhat more detailed description of the METAL grammar. I% will then present a description of the translation process using a simple German sentence, and conclude with a discussion of the current state of the linguistic component, along with comaents on what improvements are necessary in the ftucther development of the systemo-29
05 Jul 1982
TL;DR: This paper proposes a new model of machine translation where the lambda formula obtained from the syntactic and semantic analysis of a source language sentence is viewed as a target language generating function and the targetlanguage sentence is obtained as a result of evaluating the formula by functional application or λ-calculus.
Abstract: This paper proposes a new model of machine translation. In this model, the lambda formula obtained from the syntactic and semantic analysis of a source language sentence is viewed as a target language generating function and the target language sentence is obtained as a result of evaluating the formula by functional application or λ-calculus. This model provides a systematic and powerful way of incorporating human knowledge on the languages. A prototype is constructed on the LISP system. The performance was tested for four sample texts taken from existing technical reports and computer manuals.
TL;DR: A Semantic Syntax-Directed Translation is presented, its rules are used to segment continuous speech and, at the same time, to produce phonetic interpretations.
TL;DR: Inference of Stochastic Context-Free Programmed Grammar (STCFPG) by the maximum-likelihood estimate approach is discussed and a method for the inference of Context-free Programmed grammar is presented.
Abstract: An important property of Context-Free Programmed Grammars (CFPG) is that some context-sensitive Languages can be generated by CFPG. To infer a special class of CFPG for syntactic pattern recognition is the motivation of this paper. First an one-dimensional string is transformed into a corresponding binary tree. Then in terms of the structure of subtrees, and the semantic rules corresponding to the context-free productions, a method for the inference of Context-free Programmed Grammar is presented. Inference of Stochastic Context-Free Programmed Grammar (STCFPG) by the maximum-likelihood estimate approach is also discussed.