169 search results - page 16 / 34 » Pattern Matching in Text Compressed by Using Antidictionarie... |
ICDAR
2009
IEEE
13 years 5 months ago
2009
IEEE
The sounds generated by a writing instrument provide a rich and under-utilized source of information for pattern recognition. We examine the feasibility of recognition of handwrit...
FUIN
2006
13 years 7 months ago
2006
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
We introduce an EDIF netlist graph algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains based on a graph ...
FUN
2010
Springer
14 years 9 days ago
2010
Springer
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
ACL
1996
13 years 8 months ago
1996
This paper discusses the problem of learning language from unprocessed text and speech signals, concentrating on the problem of learning a lexicon. In particular, it argues for a ...