Sciweavers

745 search results - page 30 / 149
» The origins of combinatorics on words
Sort
View
ANLP
2000
141views more  ANLP 2000»
14 years 11 months ago
Aggressive Morphology for Robust Lexical Coverage
This paper describes an approach to providing lexical information for natural language processing in unrestricted domains. A system of approximately 1200 morphological rules is us...
William A. Woods
CISC
2005
Springer
120views Cryptology» more  CISC 2005»
15 years 3 months ago
Towards a General RC4-Like Keystream Generator
RC4 was designed in 1987 when 8-bit and 16-bit processors were commercially available. Today, most processors use 32-bit or 64bit words but using original RC4 with 32/64 bits is in...
Guang Gong, Kishan Chand Gupta, Martin Hell, Yassi...
IPL
2007
105views more  IPL 2007»
14 years 10 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
IJCNLP
2004
Springer
15 years 3 months ago
Improving Back-Transliteration by Combining Information Sources
Transliterating words and names from one language to another is a frequent and highly productive phenomenon. Transliteration is information loosing since important distinctions ar...
Slaven Bilac, Hozumi Tanaka
NAACL
2003
14 years 11 months ago
A Context-Sensitive Homograph Disambiguation in Thai Text-to-Speech Synthesis
Homograph ambiguity is an original issue in Text-to-Speech (TTS). To disambiguate homograph, several efficient approaches have been proposed such as part-of-speech (POS) n-gram, B...
Virongrong Tesprasit, Paisarn Charoenpornsawat, Vi...