Articles

The central questions are: How useful is information about part-of-speech fre- quency for text categorisation? Is it fea- sible to limit word features to content words for text classifications? This is examined for 5 domain and 4 genre clas- sification tasks using LIMAS, the Ger- man equivalent of the Brown …...

This paper presents a decision-tree approach to the problems of part-of- speech disambiguation and unknown word guessing as they appear in Modem Greek, a highly inflectional language. The learning procedure is tag-set independent and reflects the linguistic reasoning on the specific problems. The decision trees induced are combined with a …...

Context sensitive rewrite rules have been widely used in several areas of natural language processing, including syntax, morphology, phonology and speech pro- cessing. Kaplan and Kay, Karttunen, and Mohri & Sproat have given vari- ous algorithms to compile such rewrite rules into finite-state transducers. The present paper extends this work …...

This paper presents a new approach to partial parsing of context-free structures. The approach is based on Markov Mod- els. Each layer of the resulting structure is represented by its own Markov Model, and output of a lower layer is passed as input to the next higher layer. An em- …...

In order to build robust automatic ab- stracting systems, there is a need for bet- ter training resources than are currently available. In this paper, we introduce an annotation scheme for scientific ar- ticles which can be used to build such a resource in a consistent way. The seven categories …...

This paper proposes an approach to full parsing suitable for Information Extrac- tion from texts. Sequences of cascades of rules deterministically analyze the text, building unambiguous structures. Ini- tially basic chunks are analyzed; then ar- gumental relations are recognized; finally modifier attachment is performed and the global parse tree is …...

In this paper we present an approach to automatic authorship attribution dealing with real-world (or unrestricted) text. Our method is based on the computational analysis of the input text using a text-processing tool. Besides the style markers relevant to the output of this tool we also use analysis-dependent style markers, …...

This paper proposes a method to over- come the drawbacks of WordNet when applied to information retrieval by com- plementing it with Roget's thesaurus and corpus-derived thesauri. Words and rela- tions which are not included in WordNet can be found in the corpus-derived the- sauri. Effects of polysemy can be …...

We describe several tabular algorithms for Tree Adjoining Grammar parsing, creating a continuum from simple pure bottom-up algorithms to complex pre- dictive algorithms and showing what transformations must be applied to each one in order to obtain the next one in the continuum. 1...

Ambiguous propositions are analyzed in a type system where disambiguation is effected during assembly (i.e. by coer- cion). Ambiguity is introduced through a layer of types that are underspecified relative to a pre-existing collection of de- pendent types, construed as unambigu- ous propositions. A simple system of reasoning directly with …...

The TIPSTER Text Summarization Evaluation (SUMMAC) has established definitively that automatic text summa- rization is very effective in relevance as- sessment tasks. Summaries as short as 17% of full text length sped up decision- making by almost a factor of 2 with no statistically significant degradation in F- score accuracy. …...

Interaction of lexical and derivational semantics---for example substitution and lambda conversion--- is typically a part of the on-line interpretation process. Proof-nets are to categorial grammar what phrase markers are to phrase structure grammar: unique graphical structures underlying equivalence classes of sequential syntactic derivations; but the role of proof-nets is deeper …...

In statistical natural language process- ing we always face the problem of sparse data. One way to reduce this problem is to group words into equivalence classes which is a standard method in statistical language modeling. In this paper we de- scribe a method to determine bilingual word classes suitable …...

This paper explores the determinants of adjective-noun plausibility by using cor- relation analysis to compare judgements elicited from human subjects with five corpus-based variables: co-occurrence fre- quency of the adjective-noun pair, noun fre- quency, conditional probability of the noun given the adjective, the log-likelihood ra- tio, and Resnik's (1993) selectional …...

Most existing anaphora resolution algo- rithms are designed to account only for anaphors with NP-antecedents. This paper describes an algorithm for the resolution of discourse deictic anaphors, which constitute a large percentage of anaphors in spoken di- alogues. The success of the resolution is dependent on the classification of all …...

Dialogues may be seen as comprising commonplace routines on the one hand and specialized, task-specific interactions on the other. Object-orientation is an established means of separating the generic from the specialized. The system under discussion combines this object- oriented approach with a self-organizing, mixed-initiative dialogue strategy, raising the possibility of …...

A simple formalism is proposed to repre- sent the contexts in which pronouns, def- inite/indefinite descriptions, and ordinal descriptions (e.g. 'the second book') can be used, and the way in which these ex- pressions change the context. It is shown that referring expressions can be gener- ated by a unification …...

It is often claimed that Named En- tity recognition systems need extensive gazetteers--lists of names of people, or- ganisations, locations, and other named entities. Indeed, the compilation of such gazetteers is sometimes mentioned as a bottleneck in the design of Named En- tity recognition systems. We report on a Named …...

We apply machine learning techniques to classify automatically a set of verbs into lexical semantic classes, based on distributional approximations of diathe- ses, extracted from a very large anno- tated corpus. Distributions of four gram- matical features are sufficient to reduce error rate by 50% over chance. We con- clude …...

This paper explores the automatic construction of a multilingual Lexical Knowledge Base from pre-existing lexical resources. We present a new and robust approach for linking already existing lexical/semantic hierarchies. We used a con- straint satisfaction algorithm (relaxation label- ing) to select -among all the candidate trans- lations proposed by a …...