COLING 2000 | Sciweavers

21

click to vote

COLING
2000

78views Computational Linguistics» more COLING 2000»

Making Sense of Reference to the Unfamiliar?

14 years 3 months ago

Download acl.ldc.upenn.edu

Helen Seville, Allan Ramsay

claim paper

Read More »

44

click to vote

COLING
2000

115views Computational Linguistics» more COLING 2000»

Backward Beam Search Algorithm for Dependency Analysis of Japanese

14 years 3 months ago

Download cs.nyu.edu

Backward beam search for dependency analysis of Japanese is proposed. As dependencies normally go from left to right in Japanese, it is effective to analyze sentences backwards (f...

Satoshi Sekine, Kiyotaka Uchimoto, Hitoshi Isahara

claim paper

Read More »

39

click to vote

COLING
2000

115views Computational Linguistics» more COLING 2000»

Japanese Named Entity Extraction Evaluation - Analysis of Results

14 years 3 months ago

Download cs.nyu.edu

We will report on one of the two tasks in the IREX (Information Retrieval and Extraction Exercise) project, an evaluation-based project for Information Retrieval and Information E...

Satoshi Sekine, Yoshio Eriguchi

claim paper

Read More »

39

click to vote

COLING
2000

86views Computational Linguistics» more COLING 2000»

Japanese Dependency Analysis using a Deterministic Finite State Transducer

14 years 3 months ago

Download cs.nyu.edu

A deterministic finite state transducer is a fast device for analyzing strings. It takes O(n) time to analyze a string of length n. In this paper, an application of this technique...

Satoshi Sekine

claim paper

Read More »

27

click to vote

COLING
2000

92views Computational Linguistics» more COLING 2000»

Realizing Expressions of Doubt in Collaborative Dialogue

14 years 3 months ago

Download acl.ldc.upenn.edu

One way to 1)egin a negotiation subdialogue is to express doubt at a proposition. However, expressions of doubt occur in a variety of forms, each of which conveys information abou...

Leah Schroeder, Sandra Carberry

claim paper

Read More »

34

click to vote

COLING
2000

74views Computational Linguistics» more COLING 2000»

Parsing Schemata for Grammars with Variable Number and Order of Constituents

14 years 3 months ago

Download acl.ldc.upenn.edu

We define state transition grammars (STG) as an intermediate tbrmalism between grammars and parsing algorithms which is intended to separate the description of a parsing strategy ...

Karl-Michael Schneider

claim paper

Read More »

35

click to vote

COLING
2000

130views Computational Linguistics» more COLING 2000»

Robust German Noun Chunking With a Probabilistic Context-Free Grammar

14 years 3 months ago

Download www.aclweb.org

We present a noun chunker for German which is based on a head-lexicalised probabilistic contextfl'ee grammar. A manually developed grammar was semi-automatically extended wit...

Helmut Schmid, Sabine Schulte im Walde

claim paper

Read More »

36

click to vote

COLING
2000

88views Computational Linguistics» more COLING 2000»

Experiments in Automated Lexicon Building for Text Searching

14 years 3 months ago

Download www.lirmm.fr

This paper describes experiments in the automatic construction of lexicons that would be useful in searching large document collections for text fragments that address a specific ...

Barry Schiffman, Kathleen McKeown

claim paper

Read More »

30

click to vote

COLING
2000

75views Computational Linguistics» more COLING 2000»

Robust Semantic Construction

14 years 3 months ago

Download acl.ldc.upenn.edu

Michael Schiehlen

claim paper