Sciweavers

281 search results - page 49 / 57
» heuristics 2000
Sort
View
MST
2000
57views more  MST 2000»
13 years 9 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
ANLP
1997
106views more  ANLP 1997»
13 years 11 months ago
Incremental Finite-State Parsing
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at ...
Salah Ait-Mokhtar, Jean-Pierre Chanod
ANLP
1997
190views more  ANLP 1997»
13 years 11 months ago
Disambiguation of Proper Names in Text
Identifying the occurrences of proper names in text and the entities they refer to can be a difficult task because of the manyto-many mapping between names and their referents. We...
Nina Wacholder, Yael Ravin, Misook Choi
ANLP
1994
108views more  ANLP 1994»
13 years 11 months ago
Does Baum-Welch Re-estimation Help Taggers?
In part of speech tagging by Hidden Markov Model, a statistical model is used to assign grammatical categories to words in a text. Early work in the field relied on a corpus which...
David Elworthy
ANLP
1992
68views more  ANLP 1992»
13 years 10 months ago
Evaluating Parsing Strategies Using Standardized Parse Files
The availability of large files of manuallyreviewed parse trees from the University of Pennsylvania "tree bank", along with a program for comparing system-generated pars...
Ralph Grishman, Catherine Macleod, John Sterling