Sciweavers

745 search results - page 12 / 149
» The origins of combinatorics on words
Sort
View
ACL
2009
14 years 7 months ago
A Novel Word Segmentation Approach for Written Languages with Word Boundary Markers
Most NLP applications work under the assumption that a user input is error-free; thus, word segmentation (WS) for written languages that use word boundary markers (WBMs), such as ...
Han-Cheol Cho, Do-Gil Lee, Jung-Tae Lee, Pontus St...
CPM
2001
Springer
108views Combinatorics» more  CPM 2001»
15 years 2 months ago
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
Anne Bergeron
IMCSIT
2010
14 years 4 months ago
SyMGiza++: A Tool for Parallel Computation of Symmetrized Word Alignment Models
SyMGiza++ -- a tool that computes symmetric word alignment models with the capability to take advantage of multi-processor systems -- is presented. A series of fairly simple modifi...
Marcin Junczys-Dowmunt, Arkadiusz Szal
COMBINATORICS
2004
90views more  COMBINATORICS 2004»
14 years 9 months ago
Goldberg-Coxeter Construction for 3- and 4-valent Plane Graphs
We consider the Goldberg-Coxeter construction GCk,l(G0) (a generalization of a simplicial subdivision of the dodecahedron considered in [Gold37] and [Cox71]), which produces a pla...
Mathieu Dutour, Michel Deza
COMBINATORICS
2000
129views more  COMBINATORICS 2000»
14 years 9 months ago
Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
We define type-B analogues of combinatorial statistics previously studied on noncrossing partitions and show that analogous equidistribution and symmetry properties hold in the ca...
Rodica Simion