10493 search results - page 96 / 2099 » Dynamic Word Problems |
127
Voted
DCC
1992
IEEE
15 years 4 months 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...
97
Voted
FLAIRS
2006
15 years 2 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...
115
Voted
ACL
2003
15 years 2 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...
100
Voted
CORR
2010
Springer
15 years 21 days 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...
67
Voted
CORR
2010
Springer
15 years 21 days 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...