Articles

This paper presents a practical foreign language writing support tool which makes it much easier to utilize dictionary and example sentence resources. Like a Kana-Kanji conversion front-end processor used to input Japanese language text, this tool is also implemented as a front-end processor and can be combined with a wide …...

We describe a corpus-based investigation of propos- als in dialogue. First, we describe our DRI compliant coding scheme and report our inter-coder reliability results. Next, we test several hypotheses about what constitutes a well-formed proposal. 1...

In this paper we describe a method for per- forming word sense disambiguation (WSD). The method relies on unsupervised learning and ex- ploits functional relations among words as pro- duced by a shallow parser. By exploiting an er- ror driven rule learning algorithm (Brill 1997), the system is able to …...

The EU Copernicus project Multext-East has created a multi-lingual corpus of text and speech data, covering the six languages of the project: Bulgarian, Czech, Estonian, Hungarian, Romanian, and Slovene. In addition, wordform lexicons for each of the languages were developed. The corpus includes a parallel component consisting of Orweli's Nineteen …...

In this paper, we present a stochastic language mod- eling tool which aims at retrieving variable-length phrases (multigrams), assuming bigram dependen- cies between them. The phrase retrieval can be in- termixed with a phrase clustering procedure, so that the language data are iteratively structured at both a paradigmatic and a …...

In this paper we specifically address questions of polysemy with respect to verbs, and how regular extensions of meaning can be achieved through the adjunction of particular syntactic phrases. We see verb classes as the key to making gen- eralizations about regular extensions of mean- ing. Current approaches to English …...

Implemented methods for proper names recognition rely on large gazetteers of common proper nouns and a set of heuristic rules (e.g. Mr. as an indicator of a PERSON entity type). Though the performance of current PN recognizers is very high (over 90%), it is important to note that this problem …...

In this paper, we propose a generalization of Centering Theory (CT) (Grosz, Joshi, Weinstein (1995)) called Veins Theory (VT), which extends the applicability of centering rules from local to global discourse. A key facet of the theory involves the identification of <<veins>> over discourse structure trees such as those defined …...

The task of aligning sentences in parallel corpora of two languages has been well studied using pure sta- tistical or linguistic models. We developed a linguis- tic method based on lexical snatching with a bilin- gual dictionary and two statistical methods based on sentence length ratios and sentence offset prob- …...

Any large language processing software relies in its operation on heuristic decisions concerning the strategy of processing. These decisions are usually "hard-wired" into the software in the form of hand- crafted heuristic rules, independent of the nature of the processed texts. We propose an alternative, adaptive approach in which machine …...

This paper describes a domain independent, automat- ically trained call router which directs customer calls based on their response to an open-ended "How may ldi- rect your call?" query. Routing behavior is trained from a corpus of transcribed and handorouted calls and then carried out using vector-based information retrieval tech- …...

The previous English-Korean MT system that was the transfer-based MT system and applied to only written text enumerated a following brief list of the problems that had not seemed to be easy to solve in the near future : 1) processing of non-continuous idiomatic expressions 2) reduction of too many …...

Word sense disambiguation for unrestricted text is one of the most difficult tasks in the fields of computational linguistics. The crux of the problem is to discover a model that relates the intended sense of a word with its context. This paper describes a general framework for adaptive conceptual word …...

Recently, language barrier becomes the major problem for people to search, retrieve, and understand WWW documents in different languages. This paper deals with query translation issue in cross-language information retrieval, proper names in particular. Models for name identification, name translation and name searching are presented. The recall rates and the …...

The paper presents a language model that devel- ops syntactic structure and uses it to extract nman- ingflfl information from the word history, thus en- abling the use of long distance dependencies. The model assigns probability to every joint sequence of words-binary-parse-structure with headword an- notation and operates in a …...

In this paper we view Lexicalized Tree Adjoining Grammars as the compilation of a more abstract and modular layer of linguistic description : the metagrammar (MG). MG provides a hierarchical representation of texico- syntactic descriptions and principles that capture the well-formedness of lexicalized structures, expressed using syntactic functions. This makes …...

This study exploits statistical redundancy inherent in natural language to automatically predict scores for essays. We use a hybrid feature identification method, including syntactic structure analysis, rhetorical structure analysis, and topical analysis, to score essay responses from test-takers of the Graduate Management Admissions Test (GMAT) and the Test of Written …...

In this study, a learning device based on the PAT- tree data structures was developed. The original PAT-trees were enhanced with the deletion function to emulate human learning competence. The learning process worked as follows. The linguistic patterns from the text corpus are inserted into the PAT-tree one by one. …...

This paper describcs a new scoring algorithm that supports comparison of linguistically annotated &tta from noisy sources. The new algorithm generalizes the Message Understanding Conference (MUC) Named Entity scoring algorithm, using a compari- son based on explicit alignment of the underlying texts, followed by a scoring phase. The scoring procedure …...

This paper presents a technique to deal with multiword nominal terminology in a compu- tational Lexical Functional Grammar. This method treats multiword terms as single to- kens by modifying the preprocessing stage of the grammar (tokenization and morphological anal- ysis), which consists of a cascade of two-level finite-state automata (transducers). …...