Articles

Existing algorithms for generating referen- tial descriptions to sets of objects have serious deficits: while incremental appro- aches may produce ambiguous and redundant expressions, exhaustive searches are computationally expensive. Mediating between these extreme control regimes, we propose a best-first searching algorithm for uniquely identifying sets of objects. We incorporate linguistically …...

The paper discusses the corpora manage- ment system (CMS) design that uses Java and Oracle9i DBMS to support strategic corpora analysis. We present the pilot web- based CMS to support linguists in their daily work. The system offers facilities to assist linguists and internet users as they search for relevant …...

This paper describes a system of termino- logical extraction capable of handling multi-word expressions, using a powerful syntactic parser. The system includes a concordancing tool enabling the user to display the context of the collocation, i.e. the sentence or the whole document where the collocation occurs. Since the corpora are …...

Within the framework of translation knowledge acquisition from WWW news sites, this paper studies issues on the effect of cross-language retrieval of relevant texts in bilingual lexicon ac- quisition from comparable corpora. We experimentally show that it is quite ef- fective to reduce the candidate bilingual term pairs against which …...

This paper presents a multilingual system designed to recognize named entities in a wide variety of languages (currently more than 12 languages are concerned). The system includes original strategies to deal with a wide variety of encoding character sets, analysis strategies and algorithms to process these languages. 1...

As the amount of on-line scientific litera- ture in the biomedical domain increases, automatic processing has become a prom- ising approach for accelerating research. We are applying syntactic parsing trained on the general domain to identify protein- protein interactions. One of the main dif- ficulties obstructing the use of language …...

The main goal of this paper is to pro- pose automatic schemes for the trans- lation paired comparison method. This method was proposed to precisely eval- uate a speech translation system's capa- bility. Furthermore, the method gives an objective evaluation result, i.e., a score of the Test of English for …...

In this paper we discuss algorithms for clustering words into classes from un- labelled text using unsupervised algo- rithms, based on distributional and mor- phological information. We show how the use of morphological information can improve the performance on rare words, and that this is robust across a wide range …...

This research note reports on the work in progress which regards automatic transformation of phrase-structure syn- tactic trees of Arabic into dependency- -driven analytical ones. Guidelines for these descriptions have been developed at the Linguistic Data Consortium, Uni- versity of Pennsylvania, and at the Fac- ulty of Mathematics and Physics …...

We present a practical co-training method for bootstrapping statistical parsers using a small amount of manu- ally parsed training material and a much larger pool of raw sentences. Experi- mental results show that unlabelled sen- tences can be used to improve the per- formance of statistical parsers. In addi- tion, …...

When translating from languages with hardly any inflectional morphology like English into morphologically rich lan- guages, the English word forms often do not contain enough information for producing the correct fullform in the target language. We investigate meth- ods for improving the quality of such translations by making use of …...

We describe the adaptation to French of a machine-learned sentence realization system called Amalgam that was originally developed to be as language independent as possible and was first implemented for German. We discuss the development of the French implementation with particular attention to the degree to which the original system …...

Two apparently opposing DOP models exist in the literature: one which computes the parse tree involving the most frequent subtrees from a treebank and one which computes the parse tree involving the fewest subtrees from a treebank. This paper proposes an integration of the two models which outperforms each of …...

We present some preliminary results of a Czech-English translation system based on dependency trees. The fully auto- mated process includes: morphological tagging, analytical and tectogrammat- ical parsing of Czech, tectogrammati- cal transfer based on lexical substitu- tion using word-to-word translation dic- tionaries enhanced by the information from the English-Czech parallel …...

Automated essay scoring is now an established capability used from elementary school through graduate school for purposes of instruction and assessment. Newer applications provide automated diagnostic feedback about student writing. Feedback includes errors in grammar, usage, and mechanics, comments about writing style, and evaluation of discourse structure. This paper reports …...

We present a neural-network-based sta- tistical parser, trained and tested on the Penn Treebank. The neural net- work is used to estimate the parame- ters of a generative model of left-corner parsing, and these parameters are used to search for the most probable parse. The parser's performance (88.8% F- measure) …...

The paper presents a maximum entropy Chinese character-based parser trained on the Chinese Treebank (“CTB” hence- forth). Word-based parse trees CTB are first converted into character-in based trees, where word-level part-of- speech (POS) tags become constituent labels and character-level tags are de- rived from word-level POS tags. maximum entropy parser …...

Anaphora resolution is one of the most important research topics in Natural Lan- guage Processing. In English, overt pro- nouns such as she and definite noun phrases such as the company are anaphors that refer to preceding entities (an- tecedents). In Japanese, anaphors are of- ten omitted, and these omissions …...

We present a machine learning frame- work for resolving other-anaphora. Be- sides morpho-syntactic, recency, and se- mantic features based on existing lexi- cal knowledge resources, our algorithm obtains additional semantic knowledge from the Web. We search the Web via lexico-syntactic patterns that are specific to other-anaphors. Incorporating this in- novative …...

We present a new framework for classify- ing common nouns that extends named- entity classification. We used a fixed set of 26 semantic labels, which we called su- persenses. These are the labels used by lexicographers developing WordNet. This framework has a number of practical ad- vantages. We show how …...