Articles

Th.s paper explores the extent to which phoneme sequence constralnt'~ can be used to identify word boundaries in coutinnous speech recog~fition. The input consists of phonemic transcriptions (without word boundaries indicated) of 145 utterances produced by 1 ~e speaker. The constraints are derived by matching the complete set of 3 …...

This paper presents a new, language independent model for analysis and generation of word forms based on Finite State Transducers (FSTs). It has been completely implemented on a PC and successfully tested with lexicons and rules cover- ing all of German verb morphology and the most interesting subsets of French …...

This paper describes a technique for enabling a speech understanding system to deal with sentences for which some monosyllabic words are not recognized. Such words are supposed to act as mere syntactic markers within the system linguistic domain. This result is achieved by com- bining a modified caseframe approach to …...

In this paper we propose a new method to express quantifica- tion and especially quantifier scope in French generation. Our approach is based on two points: the identification of the sen- tence components between which quantifier scope can indeed be expressed and a mechanism to reinforce the expression of quantifier …...

~he syntax component of the speech recognition system IKAROS t is described, clhe usefidness of a probabilistic Le~jcal Functional Grammar both for cow,straining bottom-up hypotheses and top-down predicting is showtL 1....

Lorne H. Bouchard D6p. de math6matiques et d'infonnatique Universit6 du Qu6bec h MontrEal C.P. 8888, Succursale "A" Montr6al, QC Canada H3C 3P8 R15320 @ UQAM. BITNET We present a morpho-syntactic analyzer for French which is capable of automatically detecting and of correcting (automatically or with user help) spelling mistakes, agreement …...

This paper presents an approach to deal with the underspecification of Aktionsarten in German sentences. In German the difference between an accomplishment and the associated progressive state is often not marked on the sentence level. This distinction is important for correctly interpreting texts and for translation into languages which provide …...

This paper describes Word Manager, a system which is currently the object of a research project at the University of Zfirich Computer Science Department. Word Manager supports the definition, access and maintenance of lexical databases. It comprises a formal language for the implemenation of morphological knowledge. This formal language is …...

We are developing stylistic grammars to provide the basis for a French and English stylistic parser. Our stylistic grammar is a branching stratificational model, built upon a foundation dealing with lexical, syntactic, and semantic stylistic realizations. Its cen- tral level uses a vocabulary of constituent stylistic elements common to both …...

We descrlbe a general parsing method for systemic gram- mars. Systemic grammars contain a paradigmatic analysis of language in addition to structural information, so a parser must assign a set of grammatical features and functions to each constituent in addition to producing a constituent struc- ture. Our method constructs a …...

A language understanding program must produce as pre- cise a meaning representation as possible from a linguistic input. CONCRETION is the process of developing a specific interpretation by combining various levels of conceptual information. This process represents an assumption-based method of language interpretation, and departs from the traditional approach of …...

The topic of BIDIltECT1ONAL1TY~ using common knowledge in language processing for both anMysis and generation, is of both practical and theoretical concern. Theoretically, it is important to determine what knowledge structures can be applied to both. Practically, it is important that a cmn- petent natural language system be ~ble to …...

Most theori~s of presupposition implicitly assume that pre- supposition,; are facts, and that all agents involved in a discourse share belief in the presuppositions that it gen- erates. These unrealistic assumptions can be eliminated if each presupposition is treated as the belief of an agent. However, it ~s not enough …...

Recent results have established that there is a family of languages that is exactly the class of languages generated by three independently developed grammar formalisms: Tree Adjoining Grammm~, Head Grammars, and Linear Indexed Grammars. In this paper we show that Combina- tory Categorial Grammars also generates the same class of …...

We introduce a first-order version of Catego- rial Grammar, based on the idea of encoding syn- tactic types as definite clauses. Thus, we drop all explicit requirements of adjacency between combinable constituents, and we capture word- order constraints simply by allowing subformu- lae of complex types to share variables ranging …...

A general device for handling nondeterminism in stack operations is described. The device, called a Graph-structured Stack, can eliminate duplication of operations throughout the nondeterministic processes. This paper then applies the graph-structured stack to various natural language parsing methods, including ATN, LR parsing, categodal grammar and principle- based parsing. The …...

This paper discusses a sequence of deductive parsers, called PAD1 - PAD5, that utilize an axiomatization of the principles and parameters of GB theory, including a restricted transformational component (Move-a). PAD2 uses an inference control strategy based on the "freeze" predicate of Prolog-II, while PAD3 - 5 utilize the Unfold-Fold …...

Data Types: A Unifying Approach Christoph BEIERLE and Udo PLETAT IBM Deutschland GmbH Science and Technology - LILOG P.O. Box 80 08 80 7000 Stuttgart 80, West Germany (electronic mail on EARN/BITNET: BEIERLE at DS#LILOG, PLETAT at DS#LILOG) Abstract: Feature graphs appearing in unification--based grammar formalisms and algebraic specifications of …...

This paper discusses the application of Unification Categorial Grammar (UCG) to the framework of Isomorphic Grammars for Machine Translation pioneered by Landsbergen. The Isomorphic Grammars approach to MT involves developing the grammars of the Source and Target languages in parallel, in order to ensure that SL and TL expressions which …...

Two-level phonology, as currently practiced, has two severe lim- itations. One is that phonological generalizations are generally expressed in terms of transition tables of finite-state automata, and these tables are cumbersome to develop and refine. The other is that lexical idiosyncrasy is encoded by introducing arbitrary diacritics into the spelling …...