Articles

: Semantic processing is one of the important tasks for natural language processing. Basic to semantic processing is descriptions of lexical items. The most frequently used form of description of lexical items is probably Frames or Objects. Therefore in what form Frames or Objects are expressed is a key issue …...

Like most linguistic theories, the theory of generalized phrase structure grammar (GPSG) has described language axiomati- cally, that is, as a set of universal and language-specific con- attaints on the well-formedncss of linguistic elements of some sort. The coverage atttl detailed analysis of English grammar in the ambitious recent volume …...

In this paper we discuss the formal relationship between the classes of languages generated by Tree Adjoining Gram- mars and Head Grammars. In particular, we show that Head Languages are included in Tree Adjoining Languages and that Tree Adjoining Grammars are equivalent to a modifi- cation of Head Grammars called …...

: We study the weak generative capacity of a class of parenthesis-free categorial grammars derived /torn those of Aries and Steedman by varying the set of reduction rules. With forward cancellation as the only rule, the grammars are weakly equivalent to context-free grammars. When a back- ward combination rule is …...

This paper describes the analysis component of the language processing system PLAIN from the viewpoint of unification grammars. The principles of Dependency Unification Grammar (DUG) are discussed. The computer language DRL (Dependency Representation Language) is introduced J.n which DUGs can be formulated. A unifi- cation-based parsing procedure is part of …...

Categorial unification grammars (CUGs) embody the essential properties of both unification and categorial grammar formalisms. Their efficient and uniform way of encoding linguistic knowledge in well-understood and widely used representations makes them attractive for computational applications and for linguistic research. In this paper, the basic concepts of CUGs and simple …...

This paper describes a morphological analyzer which, when pars- ing a word, uses two sets of rules: rnles describing the syntax of words, and rules describing facts about orthography. 1...

A central problem in speech synthesis with unre- stricted vocabulary is the automatic derivation of correct pronunciation from the graphemic form of a text. The software module GRAPHON was developed to perform this conversion for German and is currently being extended by a morphological analysis compo- nent. This analysis is …...

This paper presents a transfer framework called LFT (Lexical-functional Transfer) for a machine translation system based on LFG (Lexical-functional Grammar). The translation process consists of subprocesses of analysis, transfer and generation. We adopt the so called f- structures of LFG as the intermediate representations or interfaces between those subprocesses, thus …...

This paper describes a prototype English-Japanese machine translation (MT) system developed at the Sci- ence Institute of IBM Japan, Ltd. This MT system cur- rently aims at the translation of IBM computer manuals. It is based on a transfer approach in which the transfer phase is divided into two sub-phases: …...

Building on the well-established premise that reliable machine translation requires a significant degree of. text comprehension, this paper presents a recent advance in multi-lingual knowledge- based machine translation (KBMT). Unlike previous approaches, the current method provides for separate syntactic and semantic knowledge sources that are integrated dynamically for parsing and …...

This paper describes a method for converting a task-dependent grammar into a word predictor of a speech understanding system, Since tile word prediction is a top-down operation, left recursive rules induces an infinite looping. We have solved this problem by applying an algorithm for bottom-up parsing, 1....

A semantic-representation-to-speech system communicates orally the information given in a seman- tic representation. Such a system must Integrate a text generation module, a phonetic conversion module, a pro- sodic module and a speech synthesizer We will see how the syntactic information elaborated by the text genera- tlon module is used …...

This paper discusses a system for producing English descriptions (or "paraphrases") of tile content of formal relational calculus (RC) formulae expressing a database (DB) query. It explains the underlying design motivations and describes a conceptual model and focus selection mechanism necessary for delivering coherent paraphrases. The general paraphrasing strategy is …...

We present the semantics component of a speech understanding and dialogue system that is developed at our institute. Due to pronunciation variabilities and vagueness of the word recognition process, semantics in a speech understanding system has to resolve additional problems. Its main task is not only to build up a …...

This paper describes a system in PROLOG for the automatic transforination of a grammar, written in LFG formalism, into a DCG-based parser. It demonstrates the main principles of the transformation, the representation of f-structures and constraints, the treatment of long-distance dependencies, and left rccursion. Finally some problem areas of the …...

This paper argues that a lexical database should be implemented with a special kind of database management system (DBMS) and outlines the design of such a system. The major difference between this proposal and a general purpose DBMS is that its data definition language (DDL) allows the specification of the …...

In this paper a version of LFG will be developed, which has only one level of representation and is equivalent to the modified version of [2], presented in [3]. The structures of this mono- stratal version are f-structures, augmented by additional infor- mation about the derived symbols and their linear …...

Aspects of syntactic predictions made during the recognition of English sentences are investigated. We reinforce Kuno's origi- nal predictive analyzer[i] by introducing five types of predictions. For each type of prediction, we discuss and present its necessity, its description method, and recognition mechanism. We make use of three kinds of …...

This paper describes a model for a lexical knowledge base (LKB). An LKB is a knowledge base management system (KBMS) which stores various kinds of dictionary knowledge in a uniform framework and provides multiple viewpoints to the stored knowledge. KBMSs for natural language knowledge will be fundamental components of knowledgeable …...