Sciweavers

745 search results - page 14 / 149
» The origins of combinatorics on words
Sort
View
ANLP
1994
89views more  ANLP 1994»
15 years 2 months ago
Multifunction Thesaurus For Russian Word Processing
A new type of thesaurus for word processing is proposed. It comprises 7 semantic and 8 syntagmatic types of links between Russian words and collocations. The original version now ...
Igor A. Bolshakov
120
Voted
ACL
2012
13 years 4 months ago
Using Rejuvenation to Improve Particle Filtering for Bayesian Word Segmentation
We present a novel extension to a recently proposed incremental learning algorithm for the word segmentation problem originally introduced in Goldwater (2006). By adding rejuvenat...
Benjamin Börschinger, Mark Johnson
IANDC
2008
141views more  IANDC 2008»
15 years 1 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
COCOON
2001
Springer
15 years 6 months ago
Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws
abstract appeared in: Proc. of 7th Ann. Int. Computing and Combinatorics Conference, COCOON 2001 (ed. J. Wang), Lecture Notes in Computer Science Vol. 2108, Springer-Verlag, Berlin...
Iain A. Stewart
CPM
2004
Springer
87views Combinatorics» more  CPM 2004»
15 years 7 months ago
A Trie-Based Approach for Compacting Automata
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
Maxime Crochemore, Chiara Epifanio, Roberto Grossi...