Articles

We propose a novel statistical translation model to improve translation selection of collocation. In the statistical approach that has been popularly applied for translation selection, bilingual corpora are used to train the translation model. However, there exists a formidable bottleneck in acquiring large-scale bilingual corpora, in particular for language pairs …...

In this paper we discuss our approach toward establishing a model of the ac- quisition of English grammatical struc- tures by users of our English language tutoring system, which has been de- signed for deaf users of American Sign Language. We explore the correlation between a corpus of error-tagged texts …...

We present a set of algorithms that en- able us to translate natural language sentences by exploiting both a trans- lation memory and a statistical-based translation model. Our results show that an automatically derived transla- tion memory can be used within a sta- tistical framework to often find trans- lations …...

This paper focuses on the analysis and prediction of so-called aware sites, defined as turns where a user of a spoken dialogue system first becomes aware that the system has made a speech recognition error. We describe statistical comparisons of features of these aware sites in a train timetable spoken …...

Previous research has shown that the plausibility of an adjective-noun com- bination is correlated with its corpus co-occurrence frequency. In this paper, we estimate the co-occurrence frequen- cies of adjective-noun pairs that fail to occur in a 100 million word corpus using smoothing techniques and com- pare them to human …...

Chunk parsing has focused on the recognition of partial constituent struc- tures at the level of individual chunks. Little attention has been paid to the question of how such partial analyses can be combined into larger structures for complete utterances. Such larger structures are not only desirable for a deeper …...

This paper presents empirical studies and closely corresponding theoretical models of the performance of a chart parser exhaus- tively parsing the Penn Treebank with the Treebank’s own CFG grammar. We show how performance is dramatically affected by rule representation and tree transformations, but little by top-down vs. bottom-up strate- gies. …...

We present a rule−based shallow− parser compiler, which allows to generate a robust shallow−parser for any language, even in the absence of training data, by resorting to a very limited number of rules which aim at identifying constituent boundaries. We contrast our approach to other approaches used for shallow−parsing (i.e. …...

This paper presents an approach to automatically build a semantic perceptron net (SPN) for topic spotting. It uses context at the lower layer to select the exact meaning of key words, and employs a combination of context, co-occurrence statistics and thesaurus to group the distributed but semantically related words within …...

This paper compares two different ways of estimating statistical language mod- els. Many statistical NLP tagging and parsing models are estimated by max- imizing the (joint) likelihood of the fully-observed training data. How- ever, since these applications only re- quire the conditional probability distri- butions, these distributions can in prin- …...

Named entity (NE) recognition is a task in which proper nouns and nu- merical information in a document are detected and classified into categories such as person, organization, location, and date. NE recognition plays an es- sential role in information extraction systems and question answering sys- tems. It is well …...

It is widely recognized that the proliferation of annotation schemes runs counter to the need to re-use language resources, and that standards for linguistic annotation are becoming increasingly mandatory. To answer this need, we have developed representation framework comprised ofa an abstract model for a variety of different annotation types …...

In this paper we address the problem of extracting key pieces of information from voicemail messages, such as the identity and phone number of the caller. This task differs from the named entity task in that the information we are inter- ested in is a subset of the named entities …...

An approach to automatic detection of syllable boundaries is presented. We demonstrate the use of several manu- ally constructed grammars trained with a novel algorithm combining the advan- tages of treebank and bracketed corpora training. We investigate the effect of the training corpus size on the perfor- mance of our …...

We present conditions under which verb phrases are elided based on a cor- pus of positive and negative examples. Factor that affect verb phrase ellipsis in- clude: the distance between antecedent and ellipsis site, the syntactic relation between antecedent and ellipsis site, and the presence or absence of adjuncts. Building …...

This paper presents an open-domain textual Question-Answering system that uses several feedback loops to en- hance its performance. These feedback loops combine in a new way statistical results with syntactic, semantic or pragmatic information derived from texts and lexical databases. The paper presents the contribution of each feed- back loop …...

We describe the use of XML tokenisa- tion, tagging and mark-up tools to pre- pare a corpus for parsing. Our tech- niques are generally applicable but here we focus on parsing Medline abstracts with the ANLT wide-coverage grammar. Hand-crafted grammars inevitably lack coverage but many coverage failures are due to …...

Categorial Grammars Philippe de Groote LORIA UMR no 7503 – INRIA Campus Scientifique, B.P. 239 54506 Vandœuvre l`es Nancy Cedex – France degroote@loria.fr Abstract We introduce a new categorial formal- ism based on intuitionistic linear logic. This formalism, which derives from current type-logical grammars, is ab- stract in the sense …...

This paper describes automatic tech- niques for mapping 9611 entries in a database of English verbs to Word- Net senses. The verbs were initially grouped into 491 classes based on syntactic features. Mapping these verbs into WordNet senses provides a resource that supports disambiguation in multilingual applications such as machine …...

We offer a computational analysis of the resolution of ellipsis in certain cases of dialogue clarification. We show that this goes beyond standard techniques used in anaphora and ellipsis resolu- tion and requires operations on highly structured, linguistically heterogeneous representations. We characterize these operations and the representations on which they …...