Sciweavers

9997 search results - page 1973 / 2000
» The case for crowd computing
Sort
View
COLING
2002
14 years 11 months ago
Word Sense Disambiguation using Static and Dynamic Sense Vectors
It is popular in WSD to use contextual information in training sense tagged data. Co-occurring words within a limited window-sized context support one sense among the semantically...
Jong-Hoon Oh, Key-Sun Choi
COLING
2002
14 years 11 months ago
Creating a Finite-State Parser with Application Semantics
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexi...
COLING
2002
14 years 11 months ago
Applying an NVEF Word-Pair Identifier to the Chinese Syllable-to-Word Conversion Problem
Syllable-to-word (STW) conversion is important in Chinese phonetic input methods and speech recognition. There are two major problems in the STW conversion: (1) resolving the ambi...
Jia-Lin Tsai, Wen-Lian Hsu
CORR
2002
Springer
96views Education» more  CORR 2002»
14 years 11 months ago
The Sketch of a Polymorphic Symphony
In previous work, we have introduced functional strategies, that is, first-class generic functions that can traverse into terms of any type while mixing uniform and type-specific ...
Ralf Lämmel
CORR
2007
Springer
217views Education» more  CORR 2007»
14 years 11 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
« Prev « First page 1973 / 2000 Last » Next »