10493 search results - page 96 / 2099 » Dynamic Word Problems |
DCC
1992
IEEE
14 years 17 hour ago
1992
IEEE
Text compression algorithms are normally defined in terms of a source alphabet of 8-bit ASCII codes. We consider choosing to be an alphabet whose symbols are the words of Englis...
FLAIRS
2006
13 years 9 months ago
2006
The world wide web has a wealth of information that is related to almost any text classification task. This paper presents a method for mining the web to improve text classificati...
ACL
2003
13 years 9 months ago
2003
A central problem of word sense disambiguation (WSD) is the lack of manually sense-tagged data required for supervised learning. In this paper, we evaluate an approach to automati...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logi...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
This paper introduces a simple Markov process inspired by the problem of quasicrystal growth. It acts over two-letter words by randomly performing flips, a local transformation whi...