Articles

This paper describes a heuristic algorithm capable of automatically assigning a label to each of the senses in a machine readable dictionary (MRD) for the purpose of acquiring a com- putational-semantic lexicon for treatment of lexical ambiguity. Including these labels in the MRD-based lexical database offers several positive effects. The …...

This paper discusses a case study in which lexical semantic techniques were used to implement a prototype scoring system for short-answer, free-responses to test questions. Scoring, as it is discussed in this paper, is a kind of clasgification problem. Responses are automatically scored by being assigned appropriate classifications. The ultimate …...

In this paper, we describe an item-familiarity account of the semi-productivity of morphological and lexical rules, and illustrate how it can be applied to practical issues which arise when building large scale lexical knowledge bases which utilize lexical rules. Our approach assumes that attested uses of derived words and senses …...

The analysis of nominal compound constructions has proven to be a recalcitrant problem for linguistic semantics and poses serious challenges for natural language processing systems. We argue for a compositional treatment of compound constructions which limits the need for listing of compounds in the lexicon. We argue that the development …...

This paper explores the effect of constrastive focus on the binding possibilities of the Korean anaphor caki (`self). Contrastive focus on caki has a special effect in that it improves the acceptability of an atypical binding pattern. To account for this fact, I propose (i) that caki with contrastive focus …...

The Chinese language has many special characteristics which are substantially different from western languages, causing conventional methods of language pro- cessing to fail on Chinese. For example, Chinese sentences are composed of strings of characters without word boundaries that are marked by spaces. Therefore, word segmentation and unknown word identification …...

A left-corner parsing algorithm with top- down filtering has been reported to show very efficient performance for unification- based systems. However, due to the non- termination of parsing with left-recursive grammars, top-down constraints must be weakened. In this paper, a general method of maximizing top-down constraints is pro- posed. The …...

We extend the centering model for the resolution of intia-sentential anaphora and specify how to handle complex sentences. An empirical eval- uation indicates that the functional information structure guides the search for an antecedent within the sentence. 1...

This paper describes the incremental generation of parse tables for the LR- type parsing of Tree Adjoining Languages (TALs). The algorithm presented han- dles modifications to the input grammar by updating the parser generated so far. In this paper, a lazy generation of LR- type parsers for TALs is defined …...

We use a statistical method to select the most probable structure or parse for a given sentence. It takes as input the dependency structures generated for the sentence by a dependency grammar, finds all triple of modifier, particle and modificant relations, calculates mutual information of each re- lation and chooses …...

This paper describes an on-going study which applies the concept of transitivity to news discourse for text processing tasks. The complex notion of transitivity is de- fined and the relationship between transi- tivity and information foregrounding is ex- plained. A sample corpus of news articles has been coded for transitivity. …...

I examine how terminological languages can be used to manage linguistic data dur- ing NL research and development. In par- ticular, I consider the lexical semantics task of characterizing semantic verb classes and show how the language can be extended to flag inconsistencies in verb class definitions, identify the need …...

The development of natural language processing (NLP) systems that perform machine translation (MT) and information retrieval (IR) has highlighted the need for the automatic recognition of proper names. While vari- ous name recognizers have been developed, they suffer from being too limited; some only recognize one name class, and all …...

Optimality Theory, a constraint-based phonol- ogy and morphology paradigm, has allowed linguists to make elegant analyses of many phenomena, including infixation and redupli- cation. In this work-in-progress, we build on the work of Ellison (1994) to investigate the possibility of using OT as a parsing tool that derives underlying forms …...

In this paper, we propose a textual clue ap- proach to help metaphor detection, in order to improve the semantic processing of this figure. The previous works in the domain studied the semantic regularities only, over- looking an obvious set of regularities. A corpus-based analysis shows the existence of surface …...

This paper stems from an ongoing research project ~ on verb phrase ellipsis. The project's goals are to implement a verb phrase ellipsis resolution algorithm, automatically test the algorithm on corpus data, then automatically evaluate the algorithm against human-generated answers. The paper will establish the current status of the algorithm …...

This paper describes a prototype disam- biguation module, KANKEI, which was tested on two corpora of the TRAINS project. In ambiguous verb phrases of form V ... NP PP or V ... NP adverb(s), the two corpora have very different PP and adverb attachment patterns; in the first, the cor- …...

Words unknown to the lexicon present a substantial problem to part-of-speech tag- ging. In this paper we present a technique for fully unsupervised statistical acquisi- tion of rules which guess possible parts- of-speech for unknown words. Three com- plementary sets of word-guessing rules are induced from the lexicon and a …...

Corpus-based methods for natural lan- guage processing often use supervised training, requiring expensive manual an- notation of training corpora. This paper investigates methods for reducing annota- tion cost by sample selection. In this ap- proach, during training the learning pro- gram examines many unlabeled examples and selects for labeling (annotation) …...

We present an extensive empirical com- parison of several smoothing techniques in the domain of language modeling, includ- ing those described by Jelinek and Mer- cer (1980), Katz (1987), and Church and Gale (1991). We investigate for the first time how factors such as training data size, corpus (e.g., Brown …...