745 search results - page 25 / 149 » The origins of combinatorics on words |
CPM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
LREC
2008
14 years 11 months ago
2008
In this paper, we discuss lemma identification in Japanese morphological analysis, which is crucial for a proper formulation of morphological analysis that benefits not only NLP r...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
ITA
2007
14 years 10 months ago
2007
Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing dupl...
ASSISTIVE
1998
Springer
15 years 2 months ago
1998
Springer
In this paper, wepresent a prototype MTsystem named SYUWANwhich can translate Japanese into Japanesesign language. Oneof the most important problemsin this translation is that the...