Sciweavers

1028 search results - page 28 / 206
» Character sets of strings
Sort
View
ICPR
2010
IEEE
13 years 5 months ago
A Baseline Dependent Approach for Persian Handwritten Character Segmentation
-- In this paper, an efficient approach to segment Persian off-line handwritten text-line into characters is presented. The proposed algorithm first traces the baseline of the inpu...
Alireza Alaei, P. Nagabhushan, Umapada Pal
ICML
2002
IEEE
14 years 8 months ago
Syllables and other String Kernel Extensions
During the last years, the use of string kernels that compare documents has been shown to achieve good results on text classification problems. In this paper we introduce the appl...
Craig Saunders, Hauke Tschach, John Shawe-Taylor
ACL
2012
11 years 10 months ago
Machine Translation without Words through Substring Alignment
In this paper, we demonstrate that accurate machine translation is possible without the concept of “words,” treating MT as a problem of transformation between character string...
Graham Neubig, Taro Watanabe, Shinsuke Mori, Tatsu...
CPM
2005
Springer
87views Combinatorics» more  CPM 2005»
14 years 1 months ago
Two Dimensional Parameterized Matching
Two equal length strings, or two equal sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-...
Carmit Hazay, Moshe Lewenstein, Dekel Tsur
ACL
1997
13 years 9 months ago
Retrieving Collocations by Co-occurrences and Word Order Constraints
In this paper, we describe a method for automatically retrieving collocations from large text corpora. This method retrieve collocations in the following stages: 1) extracting str...
Sayori Shimohata, Toshiyuki Sugio, Junji Nagata