10493 search results - page 351 / 2099 » Dynamic Word Problems |
142
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
We show that the marked version of the Post Correspondence Problem, where the words on a list are required to di er in the rst letter, is decidable. On the other hand, PCP remains ...
114
click to vote
ACL
2006
15 years 8 months ago
2006
This paper describes an architecture to convert Sinhala Unicode text into phonemic specification of pronunciation. The study was mainly focused on disambiguating schwa-/\/ and /a/...
147
click to vote
ANLP
1994
15 years 8 months ago
1994
We discuss combining knowledge-based (or rule-based) and statistical part-of-speech taggers. We use two mature taggers, ENGCG and Xerox Tagger, to independently tag the same text ...
160
click to vote
IJNSEC
2007
15 years 6 months ago
2007
Rivest and Shamir presented two simple micropayment schemes, “PayWord” and “MicroMint,” for making small purchases over the Internet [14]. Recently, Adachi et al. have poi...
171
click to vote
INFORMATICALT
2000
15 years 6 months ago
2000
This work is an attempt of generalization of the simple statement about the requirements of commutation of words for the case of languages. In the paper, the necessary condition fo...