Articles

AbstractThis paper outlines a new architecture for a NLP/MT development environment for the EUROTRA project, which will be fully operational in the 1993-94 time frame. The proposed architecture provides a powerful and flexible platform for extensions and enhancements to the existing EUROTRA translation philosophy and the linguistic work done so …...

Kaplan et al (1989) present an approach to machine translation based on co-description. In this paper we show that the notation is not as natural and expressive as it appears. We first show that the most natural analysis proposed in Kaplan et al (1989) cannot in fact cover the range …...

Unification is often the appropriate method for expressing relations between representations in the form of feature structures; however, there are circumstances in which a different approach is desirable. A declarative formalism is presented which permits direct mappings of one feature structure into another, and illustra- tive examples are given of …...

There have been various attempts at using the sublanguage notion for disambi- guation and the selection of target language equivalents in machine translation. In this paper a theoretical concept and its imple- mentation in a real MT application are pre- sented. Above this, means of linguistic engineering like weighting mechanisms …...

Attribute grammars are an elegant formalization of the augmented context-free grammars characteristic of most current natural language systems. This paper presents an extension of Earley's algorithm to Knuth's attribute grammars, considering the case of S-attributed grammars. For this case, we study the conditions on the underlying base grammar under which …...

The lexical transfer phase is the most crucial step in MT because most of difficult problems are caused by lexical differences between two languages. In order to treat lexical issues systemati- cally in transfer-based MT systems, we introduce the concept of bilingual-sings which are defined by pairs of equivalent monolingual …...

In this paper we discuss some problems arising in German-Russian Machine Translation with regard to tense and aspect. Since the formal category of aspect is missing in German the information required for generating Rus- sian aspect forms has to be extracted from different representation levels. A sentence based procedure for …...

In this paper the text theoretical foundation of our text analysis system KONTEXT is described. The basic premise of the KONTEXT model is that new concepts are communicated by using the mechanisms of text constitution. The text model used assumes that the information conveyed in a text and the information …...

This paper describes an algorithm for generat- ing quantifier scopings. The algorithm is designed to generate only logically non-redundant scopings and to partially order the scopings with a given :default scoping first. Removing logical redundancy is not only interesting per se, but also drastically reduces the processing time. The input …...

, This paper describes a computational pragmatic model which is geared towards providing helpful answers to modal and hypothet- ical questions. The work brings together elements from fonnal. semantic theories on modality m~d question answering, defines a wkler, pragmatically flavoured, notion of answerhood based on non-monotonic inference aod develops a …...

In the field of knowledge based systems for natural lan- guage processing, one of the most challenging aims is to use parts of an existing knowledge base for differ- ent domains and/or different tasks. We support the point that this problem can only be solved by using ad- equate metainformation …...

In this paper* I will argue for a model of grammatical processing that is based on uniform processing and knowledge sources. The main feature of this model is to view parsing and generation as two strongly interleaved tasks performed by a single parametrized deduction process. It will be shown that …...

This paper describes a system for managing: dialogue in a natural language interface. The proposed approach uses a dialogue manager as the overall control mecha- nism. The dialogue manager accesses domain independ- ent resources for interpretation, generation and back- ground system access. It also uses information from do- main dependent …...

In this paper we provide a quantitative evaluation of information automatically extracted from machine readable dictionaries. Our results show that for any one dictionary, 55-70% of the extracted information is garbled in some way. However, we show that these results can be dramatically reduced to about 6% by combining the …...

This paper discusses an implemented program that automatically classifies verbs into those that ~ describe only states of the world, such as to know, and those that describe events, such as to look. It works by exploiting the con, straint between the syntactic environ- ments in which a verb can …...

This paper describes a classical logic for attribute-value (or fea- ture description) languages which ate used in urfification gram- mar to describe a certain kind of linguistic object commonly called attribute-value structure (or feature structure). Tile al- gorithm which is used for deciding satisfiability of a feature description is based …...

: We present the formal • processing model of CLG, a logic grammar formalism based on complex constraint resolution. In particular, we show how to monotonically extend terms and their unification to constrained terms and their resolution. The simple CLG constraint rewrite scheme is presented and its consequence for CLG's …...

This paper presents an approach for achieving conciseness in generating explanations, which is clone by exploiting formal reconstructions of aspects of the Gricean principle of relevance to simulate conversational implicature. By apply- ing contextually motivated inference rules in an anticipation feed-back loop, a set of propo- sitions explicitly representing an …...

In this paper, we review Dale's [1989] algorithm for determining the content of a referring expres- sion. The algorithm, which only permits the use of one-place predicates, is revised and extended to deal with n-ary predicates. We investigate the problem of blocking 'recursion' in complex noun phrases and propose a …...

Givcn a grammar for a language, it is possible to create finite state mechanisms that approximate its recognition capacity. These simple automata consider only short context information~ drawn from local syntactic constraints which the grammar hnposes. While it is short of providing the strong generative capacity of the grammar, such …...