Articles

Some Italian sentences related to linguistic phenomena largely known and recently discussed by many computational linguists are discussed in the framework of AT:~. They offer certain difficulties which seem to suggest a substantial revision of the ATN formalism. The theoretical assumptions and an experimental implementation of such a revision are …...

We describe a dialogue-handling module used as an interface between a vocal terminal and a task- oriented device (for instance : a robot manipula- ting blocks). This module has been specially desi- gned to be implanted on a single board using micro- processor, and inserted into the vocal terminal which …...

Finnish is a highly inflectional language. A verb can have over ten thousand different surface forms - nominals slightly fewer. Consequently, a morphological analyzer is an important component of a system aiming at "understanding" Finnish. This paper briefly describes our rule-based heu- ristic analyzer for Finnish nominal and verb forms. …...

A computer program for the automatic translation of any text of Italian into naturally fluent synthetic speech is pre- sented. The program, or Phonological Processor (hence FP) maps into prosodic structures the phonological rules of Italian. Structural information is provided by such hierarchical pros- odic constituents as Syllable (S), Metrical …...

We present in this article, as a part of aspectual operation system, a gene- ration system of iterative expressions using a set of operators called iterative operators. In order to execute the itera- tive operations efficiently, we have classified previously propositions denoting a single occurrence of a single event into …...

Commonly used gralm~mrs which describe i~turai lan~uages /ex. ATN, Metamorpho- sis Grammars/ can be hardly applied in describing higly inflectional languages. So I propose a grammar called the gram- mar with natural context which takes into consideration properties of higly inflectional languages /ex. Polish / as well as structural languages …...

AMBER is a model of first language acquisition that improves its performance through a process of error recovery. The model is implemented as an adaptive production system that introduces new condition-action rules on the basis of experience. AMBER starts with the ability to say only one word at a time, …...

This paper describes the results of a preliminary study of a Knowledge Engineering approach to Natural Language Understanding. A computer system is being developed to handle the acquisition, representation, and use of linguistic knowledge. The computer system is rule-based and utilizes a semantic network for knowledge storage and representation. In …...

Computer-based generation of natural language requires consideration of two different types of problems: i) determining the content and textual shape of what is to be said, and 2) transforming that message into English. A computational solution to the problems of deciding what to say and how to organize it effectively …...

This paper describes how a language-planning system can produce natural-language referring expressions that satisfy multiple goals. It describes a formal representation for reasoning about several agents' mutual knowledge us- ing possible-worlds semantics and the general organization of a system that uses the formalism to reason about plans combining physical and …...

This brief paper, which is itself an extended abstract for a forthcoming paper, describes a metric that can be easily com- puted during either bottom-up or top-down construction of a parse tree for ranking the desirability of alternative parses. In its simplest form, the metric tends to prefer trees in …...

This paper describes a natural language processing system implemented at Hewlett-Packard's Computer Research Center. The system's main components are: a Generalized Phrase Structure Grammar (GPSG); a top-down parser; a logic transducer that outputs a first-order logical representation; and a "disambiguator" that uses sortal information to convert "normal-form" first-order logical expressions …...

If a q.a. system tries to transform an Eng- lish question directly into the simplest possible formulation of the corresponding data base query, discrepancies between the English lexicon and the structure of the data base cannot be handled well. To be able to deal with such discrepancies in a systematic …...

An outline of a theory of comprehension of declarative contexts is presented. The main aspect of the theory being developed is based on Kant's distinction between concepts as rules (we have called them conceptual specialists) and concepts as an abstract representation (schemata, frames). Comprehension is viewed as a process dependent …...

A desirable long-range goal in building future speech understanding systems would be to accept the kind of language people spontaneously produce. We show that people do not speak to one another in the same way they converse in typewritten language. Spoken language is finer-grained and more indirect. The differences are …...

Ever since Woods's "What's in a Link" paper, there has been a growing concern for formalization in the study of knowledge representation. Several arguments have been made that frame representation languages and semantic-network languages are syntactic variants of the ftrst-order predicate calculus (FOPC). The typical argument proceeds by showing how …...

A scheme for syntax-directed translation that mirrors com- positional model-theoretic semantics is discussed. The scheme is the basis for an English translation system called PArR and was used to specify a semantically interesting fragment of English, including such constructs as tense, aspect, modals, and various iexically controlled verb complement structures. …...

Model-theoretic semantics provides a computationally attractive means of representing the semantics of natural language. However, the models used in this formalism are static and are usually infinite. Dynamic models are incomplete models that include only the information needed for an application and to which information can be added. Dynamic models …...

ING Danilo FUM ? Giovanni GUIDA, Carlo TASSO Istituto di Matematica, Informatica e Sistemistica, Universita' di Udine. Italy. o Laboratorio di Psicologia E.E., Universita' di Trieste, Italy. The paper is devoted to present a new approach to automatic abstracting which is supported by the development of SUSY, an experimental system …...

In this paper the problem is discussed about the text structure determination and content analysis by lexical parall~lism, or the repetition of lexical items. Intersentential relations are determined through the identical, partly identical or lexico-semantic repetition in Japanese scientific texts. Lexical parallelism ratio and lexical parallelism indicator distance are obtained …...