Articles

We present a corpus-based study of methods that have been proposed in the linguistics liter- ature for selecting the semantically unmarked term out of a pair of antonymous adjectives. Solutions to this problem are applicable to the more general task of selecting the positive term from the pair. Using automatically …...

Corpus-based sense disambiguation methods, like most other statistical NLP approaches, suffer from the problem of data sparseness. In this paper, we describe an approach which overcomes this problem using dictionary definitions. Using the definition- based conceptual co-occurrence data collected from the relatively small Brown corpus, our sense disambiguation system achieves …...

This paper presents an unsupervised learn- ing algorithm for sense disambiguation that, when trained on unannotated English text, rivals the performance of supervised techniques that require time-consuming hand annotations. The algorithm is based on two powerful constraints - that words tend to have one sense per discourse and one sense …...

Bernard Lang defines parsing as ~ cal- culation of the intersection of a FSA (the input) and a CFG. Viewing the input for parsing as a FSA rather than as a string combines well with some approaches in speech understanding systems, in which parsing takes a word lattice as input …...

DTG are designed to share some of the advantages of TAG while overcoming some of its limitations. DTG involve two com- position operations called subsertion and sister-adjunction. The most distinctive fea- ture of DTG is that, unlike TAG, there is complete uniformity in the way that the two DTG operations …...

We propose an O(M(n2)) time algorithm for the recognition of Tree Adjoining Lan- guages (TALs), where n is the size of the input string and M(k) is the time needed to multiply two k x k boolean matrices. Tree Adjoining Grammars (TAGs) are for- malisms suitable for natural language pro- …...

In collaborative planning activities, since the agents are autonomous and heterogeneous, it is inevitable that conflicts arise in their beliefs during the planning process. In cases where such conflicts are relevant to the t~t~k at hand, the agents should engage in collaborative ne- gotiation as an attempt to square away …...

We describe one approach to build an au- tomatically trainable anaphora resolution system. In this approach, we use Japanese newspaper articles tagged with discourse information as training examples for a ma- chine learning algorithm which employs the C4.5 decision tree algorithm by Quin- lan (Quinlan, 1993). Then, we evaluate and …...

In this paper, we present a statistical ap- proach for dialogue act processing in the di- alogue component of the speech-to-speech translation system VERBMOBIL. Statistics in dialogue processing is used to predict follow-up dialogue acts. As an application example we show how it supports repair when unexpected dialogue states occur. …...

We predict discourse segment boundaries from linguistic features of utterances, using a corpus of spoken narratives as data. We present two methods for developing seg- mentation algorithms from training data: hand tuning and machine learning. When multiple types of features are used, results approach human performance on an inde- pendent …...

Some linguistic constraints cannot be effec- tively resolved during parsing at the loca- tion in which they are most naturally intro- duced. This paper shows how constraints can be propagated in a memoizing parser (such as a chart parser) in much the same way that variable bindings are, providing a …...

We present an implemented compilation algorithm that translates HPSG into lex- icalized feature-based TAG, relating con- cepts of the two theories. While HPSG has a more elaborated principle-based theory of possible phrase structures, TAG pro- vides the means to represent lexicalized structures more explicitly. Our objectives are met by giving …...

We present a new approach to HPSG pro- cessing: compiling HPSG grammars ex- pressed as type constraints into definite clause programs. This provides a clear and computationally useful correspondence between linguistic theories and their im- plementation. The compiler performs off- line constraint inheritance and code opti- mization. As a result, …...

This paper shows how DATR, a widely used formal language for lexical knowledge re- presentation, can be used to define an I_TAG lexicon as an inheritance hierarchy with in- ternal lexical rules. A bottom-up featu- ral encoding is used for LTAG trees and this allows lexical rules to be implemen- …...

Evans and Gazdar (Evans and Gazdar, 1989a; Evans and Gazdar, 1989b) intro- duced DATR as a simple, non-monotonic language for representing natural language lexicons. Although a number of implemen- tations of DATR exist, the full language has until now lacked an explicit, declarative se- mantics. This paper rectifies the situation …...

This paper compares the consislency- based account of agreement phenomena in 'unification-based' grammars with an implication-based account based on a sim- ple feature extension to Lambek Catego- rim Grammar (LCG). We show that the LCG treatment accounts for constructions that have been recognized as problematic for 'unification-based' treatments. 1...

In a consistent text, many words and phrases are repeatedly used in more than one sentence. When an identical phrase (a set of consecutive words) is repeated in different sentences, the constituent words of those sentences tend to be associated in identical modification patterns with identi- cal parts of speech …...

In this paper we will present our ongoing work on a plan-based discourse processor developed in the context of the Enthusiast Spanish to English translation system as part of the JANUS multi-lingual speech-to- speech translation system. We will demon- strate that theories of discourse which pos- tulate a strict tree …...

This paper introduces to the calculus of regular expressions a replace operator and defines a set of replacement expressions that concisely encode alternate variations of the operation. Replace expressions de- note regular relations, defined in terms of other regular expression operators. The basic case is unconditional obligatory re- placement. We …...

This paper presents a method for learning phonological rules from sample pairs of un- derlying and surface forms, without negative evidence. The learned rules are represented as finite state transducers that accept underlying forms as input and generate surface forms as output. The algorithm for learning them is an extension …...