Articles

A formal treatment of typed feature structures (TFSs) is developed to augment TFSs, so that neg- ative descriptions of them can be treated. Negative descriptions of TFSs can make linguistic descriptions compact and thus easy to understand. Negative de- scriptions can be classified into three primitive nega- tive descriptions: (1) …...

A general framework for parallel parsing is pre- sented, which allows for a unitied, systematic approach to parallel parsing. The l'rimordial Soup Algorithm creates trees by alh)wing par- tial parse trees to combine arbitrarily. By adding constraints to the general algorithm, a large, class of parallel parsing strategies can be …...

An arbitrary definite clause grammar can be transforaled into a so-called Generalized Greibach Normal Form (GGNF), a generalization of the classical Greibach Nor- mat Form (GNF) for context-free grammars. The normalized definite clause grammar is declara- tively equivalent to the original definite clause grammar, that is, it assigns the same …...

The resolution of lexical ambiguity is important for most natural language process- ing tasks, and a range of computational techniques have been proposed for its solu- tion. None of these has yet proven effective on a large scale. In this paper, we describe a method for lexical disambiguation of text …...

In this paper, a discrimination and robusmess oriented adaptive learning procedure is proposed to deal with the task of syntactic ambiguity resolution. Owing to the problem of insufficient training data and approximation error introduced by the language model, traditional statistical approaches, which re- solve ambiguities by indirectly and implicitly using …...

It is well known that even extremely limited center- embedding causes people to have difficulty ill comprehen- sion, but that left- and right-branching constractions pro- duce no such effect. If the difficulty in comprehension is taken to be a result of processing load, as is widely as- sumed, then measuring …...

A proposal to deal with tenses in the framework of Discourse Representation Theory is presented, ms it has been implemented for a fragment at the IMS for the project LILOG. It is based on the theory of tenses of H. Kamp and Ch. Rohrer. The system uses tile tense and …...

Anaphoric reference is an important linguistic phe- nomenon to understand the discourse structure and content. In Chinese natural language processing, there are both the problems of choosing and resolv- ing anaphora. In Mandarin Chinese, several linguists have attempted to propose criteria to ezplain the phe- nomenon of anaphora but with …...

~ Tile primary purpose of this paper is to present a set of conditions that constrain accent placement in focused nominally ptemodified NPs. Selkirk (1984) argues that if the premodifier is an argument of the head, then the head can be deaccented. I agree with Selkirk's proposal and argue that …...

Using constraints in robust parsing seems to have what we call "robust parsing paradox". Preference Sem,'ultics and Coimecfionisln both offered a promis- ing approach to fins problem. However, Prefelence Semantics has not addressed the problem of how to make flfll use of syntactic constraints, and Connec- tiouism has some inherent …...

Communication among agents collaborating on a task often involves complex utterances about multiple ac- tions. In this paper, we analyze two particular multi- action constructions, utterances with means clauses and utterances with rationale clauses. We present the distinctive features of these constructions, de- scribe their logical form, and define interpretation …...

In Combinatory Categnrial Grammar (CCG) [Ste90, Ste91], semantic function-argument structures are com- positionally produced through the course of a deriva- tion. These structures identify, inter alia, which enti- ties play the same roles in different events for expres- sions involving a wide range of coordinate constructs. This sameness of role …...

In this paper we describe TI~, a fast and robust natural language parser which can analyze written text and generate regularized parse structures for sentences and phrases at the speed of approximately 0.5 sec/sentence, or 44 word per second. The parser is based on a wide coverage grammar for English, …...

We simplify previous work in the development of algorithms for the generation of referring expre~ sions while at the same time taking account of psy- cholinguistic findings and transcript data. The result is a straightforward algorithm that is computation- ally tractable, sensitive to the preferences of human users, and reasonably …...

This paper describes an empirical study on the op- timal granularity of the phrase structure rules and the optimal strategy for interleaving CFG parsing with unification in order to implement an eltlcient unification-based parsing system. We claim that us- ing "medium-grained" CFG phrase structure rules, which balance tile computational cost …...

This paper presents a direct implementation of Government-Binding theory in a parser for German, which faithfully models the modular structure of the theory. The modular design yields a flexible environment, in which it is possible to define and test various versions of principles and parameters. The several modules of linguistic …...

A language-independent framework for syntac- tic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in this for- realism. As a substantial example, fragments from a nontrivial finite-state grammar of Eng- lish are discussed. The linguistic framework of the present …...

This paper exanfines certain aspects of phono- logical structure from the viewpoint of ahstract data types, Our imnlediate goal is to find a for- mat for l)honological representation which will be reasonably f,'fithful to the concerns of theoreti: cal phonology while I)eing rigorous enough to a(I- rail a computational interl)retation. …...

This paper I describes a method for chart parsing Lam- bek grammars. The method is of particular interest in two regards. Firstly, it allows efficient processing of grammars which use necessity operators, mr extension proposed for handling locality phenomena. Secondly, the method is easily adapted to allow incremental pro- ceasing …...

Parsing a long sentence is very difficult, since long sentences often have conjunctions which result in am- biguities. If the conjunctive structures existing in a long sentence can be analyzed correctly, ambiguities can be reduced greatly and a sentence can be parsed in a high successful rate. Since the prior …...