Total Articles: 38870

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 36891

This paper proposes the use of uncertainty reduction in machine learning methods such as co-training and bilingual boot- strapping, which are referred to, in a gen- eral term, as ‘collaborative bootstrapping’. The paper indicates that uncertainty re- duction is an important factor for enhanc- ing the performance of collaborative bootstrapping. …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 819

This paper presents a maximum entropy based Chinese named entity recognizer (NER): Mencius. It aims to address Chinese NER problems by combining the advantages of rule-based and machine learning (ML) based NER systems. Rule-based NER systems can explicitly encode human comprehension and can be tuned conveniently, while ML-based systems are …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 820

In various Asian languages, including Chinese, there is no space between words in texts. Thus, most Chinese NLP systems must perform word-segmentation (sentence tokenization). However, successful word-segmentation depends on having a suffi- ciently large lexicon. On the average, about 3% of the words in text are not contained in a …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 821

In order to achieve fast and high quality Part-of-speech (PoS) tagging, algorithms should be high accuracy and require less manually proofreading. To evaluate a tagging system, we proposed a new criterion of reliability, which is a kind of cost-effective criterion, instead of the conventional criterion of accuracy. The most cost-effective …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 822

A meaningful noun-verb word-pair in a sentence is called a noun-verb event-frame (NVFE). Previously, we have developed an NVEF word-pair identifier to demonstrate that NVEF knowledge can be used effectively to resolve the Chinese word-sense disambiguation (WSD) problem (with 93.7% accuracy) and the Chinese syllable-to-word (STW) conversion problem (with 99.66% …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 825

Anaphora is a common phenomenon in discourses as well as an important research issue in the applications of natural language processing. In this paper, the anaphora resolution is achieved by employing WordNet ontology and heuristic rules. The proposed system identifies both intra-sentential and inter-sentential antecedents of anaphors. Information about animacy …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 827

This paper proposes a corpora-based approach in comparing the Mapping Principles for economy metaphors in English and Chinese. The Mapping Principles are validated using an upper ontology (SUMO). This research extends on the work of Ahrens, Chung and Huang (2003) by examining the ‘economy’ metaphors in Chinese and English. In …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 828

In this paper we will present a system, called LiveTrans, which can generate translation suggestions for given user queries and provide an English-Chinese cross-language search service for the retrieval of both Web pages and images. The system effectively utilizes two kinds of Web resources: anchor texts and search results. The …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 829

In this paper, we describe an algorithm that employs syntactic and statistical analysis to extract bilingual collocations from a parallel corpus. The preferred syntactic patterns are obtained from idioms and collocations in a machine-readable dictionary. Phrases matching the patterns are extract from aligned sentences in a parallel corpus. Those phrases …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 830

The named-entity phrases in free text represent a formidable challenge to text analysis. Translat- ing a named-entity is important for the task of Cross Language Information Retrieval and Ques- tion Answering. However, both tasks are not easy to handle because named-entities found in free text are often not listed in …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 43505

When machine translation (MT) knowl- edge is automatically constructed from bilingual corpora, redundant rules are acquired due to translation variety. These rules increase ambiguity or cause incorrect MT results. To overcome this problem, we constrain the sentences used for knowledge extraction to "the appropriate bilingual sentences for the MT." In …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 43506

This paper provides a method for generat- ing compact and efficient code to imple- ment the enforcement of a description in typed feature logic. It does so by view- ing information about types through the course of code generation as modes of in- stantiation — a generalization of the com- …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 43507

The Constraint Language for Lambda Structures (CLLS) is an expressive tree description language. It provides a uni- form framework for underspecified se- mantics, covering scope, ellipsis, and anaphora. Efficient algorithms exist for the sublanguage that models scope. But so far no terminating algorithm exists for sublanguages that model ellipsis. We …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 43508

In this paper, a word alignment ap- proach is presented which is based on a combination of clues. Word align- ment clues indicate associations be- tween words and phrases. They can be based on features such as frequency, part-of-speech, phrase type, and the ac- tual wordform strings. Clues can be …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 43509

We use the grammatical re- lations (GRs) described in Carroll et al. (1998) to compare a number of parsing algorithms A first ranking of the parsers is provided by comparing the extracted GRs to a gold standard GR anno- tation of 500 Susanne sentences: this required an implementation of GR …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 43510

We define a back-and-forth translation between Hole Semantics and dominance constraints, two formalisms used in un- derspecified semantics. There are funda- mental differences between the two, but we show that they disappear on practi- cally useful descriptions. Our encoding bridges a gap between two underspeci- fication formalisms, and speeds up …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 43511

We describe our investigations in gener- ating textual summaries of physiological time series data to aid medical personnel in monitoring babies in neonatal intensive care units. Our studies suggest that sum- marization is a communicative task that requires data analysis techniques for de- termining the content of the summary. We …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 43512

This paper presents an unsupervised al- gorithm which automatically discovers word senses from text. The algorithm is based on a graph model representing words and relationships between them. Sense clusters are iteratively computed by clustering the local graph of similar words around an ambiguous word. Dis- crimination against previously extracted …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 43513

This paper describes the NECA MNLG; a fully implemented Multimodal Natu- ral Language Generation module. The MNLG is deployed as part of the NECA system which generates dialogues be- tween animated agents. The genera- tion module supports the seamless inte- gration of full grammar rules, templates and canned text. The …...

nan

Publication: TIPSTER (2003)

DOI: nan

Paper ID: 43514

In this paper we present a proposal to ex- tend WordNet-like lexical databases by adding phrasets, i.e. sets of free combina- tions of words which are recurrently used to express a concept (let's call them re- current free phrases). Phrasets are a use- ful source of information for different NLP …...