Sciweavers

1028 search results - page 135 / 206
» Character sets of strings
Sort
View
JALC
2007
95views more  JALC 2007»
13 years 9 months ago
Learning Regular Tree Languages from Correction and Equivalence Queries
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...
Catalin Ionut Tîrnauca, Cristina Tîrna...
FSMNLP
2009
Springer
13 years 7 months ago
Minimizing Weighted Tree Grammars Using Simulation
Weighted tree grammars (for short: WTG) are an extension of weighted context-free grammars that generate trees instead of strings. They can be used in natural language parsing to d...
Andreas Maletti
MST
2011
208views Hardware» more  MST 2011»
13 years 4 months ago
Weighted Picture Automata and Weighted Logics
The theory of two-dimensional languages, generalizing formal string languages, was motivated by problems arising from image processing and models of parallel computing. Weighted au...
Ina Fichtner
ICDAR
2007
IEEE
14 years 4 months ago
Elastic Matching of Online Handwritten Tamil and Telugu Scripts Using Local Features
This paper describes character based elastic matching using local features for recognizing online handwritten data. Dynamic Time Warping (DTW) has been used with four different fe...
L. Prasanth, V. Babu, R. Sharma, G. V. Rao, Dinesh...
ASPLOS
2009
ACM
14 years 10 months ago
Architectural support for SWAR text processing with parallel bit streams: the inductive doubling principle
Parallel bit stream algorithms exploit the SWAR (SIMD within a register) capabilities of commodity processors in high-performance text processing applications such as UTF8 to UTF-...
Robert D. Cameron, Dan Lin