Articles

Recognizing shallow linguistic patterns, such as ba- sic syntactic relationships between words, is a com~ mon task in applied natural language and text pro- (:essing. Tile common practice for approaching this task is by tedious manual definition of possible pat- tern structures, often in the h)rm of regular expres- sions …...

We describe a trainable and scalable sum- marization system which utilizes features derived from information retrieval, inibr- mation extraction, and NLP techniques and on-line resources. The system con> bines these features using a trainable fea- ture combiner learned from summary ex- amples through a machine learning algo- rithm. We demonstrate …...

Word graphs are able to represent a large mira- ber of different utterance hypotheses in a very compact manner. However, usually they con- tain a huge amount of redundancy in terms of word hypotheses that cover almost identi- cal intervals in time. We address this problem by introducing hypergraphs for …...

Starting from descriptions of French connectives (in particular "done"--therefore), on the one hand, and aspectual properties of French tenses passd simple and imparfait on the other hand, we study in this paper how the two interact with respect to the expression of causality. It turns out that their interaction is …...

\Ve describe a method for the fully automatic learning of hierarchical Iinite state translation models. The input to lhe method is transcribed sl)eech utterances and th(>ir corre.~l)on(ling hu. man translations, and the output is a set of head transducers, i.e. statistical le×ical head- outward transducers. A word-alignment func- tion and …...

Cross-document coreference occurs when the same person, place, event, or concept is discussed in more than one text source. Computer recognition of this phenomenon is important because it helps break "the document boundary" by allowing a user to ex- amine information about a particular entity from multiple text sources at …...

We present an algorithm for bilingual word alignment that extends previous work by treating multi-word candidates on a par with single words, and combining some simple assumptions about the translation process to capture alignments for low frequency words. As most other alignment algorithms it uses co- occurrence statistics as a …...

The study presented here relies on the integrated use of different kinds of knowledge in order to improve first-guess accuracy in non-word context-sensitive correction for general unrestricted texts. State of the art spelling correction systems, e.g. ispell, apart from detecting spelling errors, also assist the user by offering a set …...

: The paper puts forward a quasi- dependency model for structural analysis of Chinese baseNPs and a MDL-based algorithm for quasi- dependency-strength acquisition. The experiments show that the proposed model is more suitable for Chinese baseNP analysis and the proposed MDL- based algorithm is superior to the traditional ML- based …...

We propose a comprehensive theory of code- mixed discourse, encompassing equivalence- point and insertional code-switching, palin- dromic constructions and lexical borrowing. The starting point is a production model of code-switching accounting for empirical observations about switch-point distribution (the equivalence constraint), wdMbrmedness of monolingual fragments, conservation of corn stituent structure and …...

Miscommunication in speech recognition sys- tems is unavoidable, but a detailed character- ization of user corrections will enable speech systems to identify when a correction is taking place and to more accurately recognize the con- tent of correction utterances. In this paper we investigate the adaptations of users when they …...

Language modeling is to associate a sequence of words with a priori probability, which is a key part of many natural language applications such as speech recognition and statisticM lna- chine translation. In this paper, we present a language modeling based on a kind of simple dependency grammar. Tile grammar …...

In this paper, we present a framework, PRE- SENTOR, for the development and customiza- tion of hypertext presentation generators. PRE- SENTOR offers intuitive and powerful declarative languages specifying the presentation at differ- ent levels: macro-planning, micro-planning, re- alization, and formatting. PRESENTOR is im- plemented and is portable cross-platform and cross-domain. …...

This paper describes the work achieved in the first half of a 4-year cooperative research project (ARCADE), financed by AUPELF-UREF. The project is devoted to the evaluation of paral- lel text alignment techniques. In its first period ARCADE ran a competition between six sys- tems on a sentence-to-sentence alignment task …...

We describe novel aspects of a new natural lan- guage generator called Nitrogen. This generator has a highly flexible input representation that allows a spectrum of input from syntactic to semantic depth, and shifts the burden of many linguistic decisions to the statistical post-processor. The generation al- gorithm is compositional, …...

'I~-eebanks, such as the Penn Treebank (PTB), offer a simple approach to obtaining a broad (:overage grammar: one can simply read the grammar off the parse trees in the treebank. While such a grammar is easy to obtain, a square-root rate of growth of the rule set with corpus size …...

This paper describes a grapheme-to-phoneme conversion method using phoneme connectivity and CCV conversion rules. The method consists of mainly four modules including morpheme normalization, phrase-break detec- tion, morpheme to phoneme conversion and phoneme connectivity check. The morpheme normalization is to replace non-Korean symt)ols into standard Korean graphemes. The phrase-break detector …...

A term-list is a list of content words that charac- terize a consistent text or a concept. This paper presents a new method for translating a term-list by using a corpus in the target language. The method first retrieves alternative translations for each input word from a bilingual dictionary. It …...

Nonconcatenative constraints, such as the shuffle re- lation, are frequently employed in grammatical anal- yses of languages that have more flexible ordering of constituents than English. We show how it is pos- sible to avoid searching the large space of permuta- tions that results from a nondeterministic applica- tion of …...

For languages whose character set is very large and whose orthography does not require spac- ing between words, such as Japanese, tokenizing and part-of-speech tagging are often the diffi- cult parts of any morphological analysis. For practical systems to tackle this problem, un- controlled heuristics are primarily used. The use …...