Topic
String (computer science)
About: String (computer science) is a research topic. Over the lifetime, 19430 publications have been published within this topic receiving 333247 citations. The topic is also known as: str & s.
Papers published on a yearly basis
Papers
More filters
Patent•
22 Jan 2001
TL;DR: In this paper, a character string of which a start point is each address of character string data in an input buffer is rearranged in a predetermined order, so that a rank list is generated.
Abstract: A character string of which a start point is each address of character string data in an input buffer is rearranged in the predetermined order, so that a rank list is generated. Next, the location of the matching candidate of a character string to be encoded is obtained on the basis of the rank list. Then, the character string to be encoded is compared with a matching candidate, thereby obtaining a matching length. Further, a code is generated using the location of the matching candidate and the matching length, and the code is output as compression data.
72 citations
TL;DR: The method provides a grammatical description that expands the string into a numeric concept represented by a sum of powers of a base number system, and provides a language specific Grammatical description for verbally expressing the numeric concept.
Abstract: The present invention provides a method of expanding a string of one or more digits to form a verbal equivalent using weighted finite state transducers. The method provides a grammatical description that expands the string into a numeric concept represented by a sum of powers of a base number system, compiles the grammatical description into a first weighted finite state transducer, provides a language specific grammatical description for verbally expressing the numeric concept, compiles the language specific grammatical description into a second weighted finite state transducer, composes the first and second finite state transducers to form a third weighted finite state transducer from which the verbal equivalent of the string can be synthesized, and synthesizes the verbal equivalent from the third weighted finite state transducer.
72 citations
Patent•
10 Sep 1981
TL;DR: In this paper, a stringed musical instrument is provided with an automatic self-tuning device which tightens or loosens those of the instrument's strings which may be out of tune.
Abstract: A stringed musical instrument is provided with an automatic self-tuning device which tightens or loosens those of the instrument's strings which may be out of tune. Each string is provided with an independent automatic tuning device and all of the devices are operated simultaneously on demand to instantly and automatically reset the tension of the strings as required. Each of the devices includes means for sensing the tension of its associated string and means for comparing the sensed tension with a reference tension corresponding to the desired tuning for the string. Means are provided for increasing or decreasing the string tension in response to the nature and magnitude of the compared tensions. In an alternate version, string tension is sensed and a visual indication is given of an out-of-tune condition. The instrument is tuned in this embodiment manually.
72 citations
01 Jun 2010
TL;DR: A robust context integration model for on-line handwritten Japanese text recognition based on string class probability approximation that can flexibly combine the scores of various contexts and is insensitive to the variability in path length is described.
Abstract: This paper describes a robust context integration model for on-line handwritten Japanese text recognition. Based on string class probability approximation, the proposed method evaluates the likelihood of candidate segmentation–recognition paths by combining the scores of character recognition, unary and binary geometric features, as well as linguistic context. The path evaluation criterion can flexibly combine the scores of various contexts and is insensitive to the variability in path length, and so, the optimal segmentation path with its string class can be effectively found by Viterbi search. Moreover, the model parameters are estimated by the genetic algorithm so as to optimize the holistic string recognition performance. In experiments on horizontal text lines extracted from the TUAT Kondate database, the proposed method achieves the segmentation rate of 0.9934 that corresponds to a f-measure and the character recognition rate of 92.80%.
72 citations
12 Jul 2004
TL;DR: The grammar compression is more convenient than LZ-encoding, its size differs from that of LZ's by at most logarithmic factor, and the constructive proof is based on the concept similar to balanced trees.
Abstract: We survey several complexity issues related to algorithmic problems on words given in an implicit way: by a grammar, LZ-encoding or as a minimal solution of a word equation. We discuss the relation between two implicit representations, the role of word compression in solvability of word equations and compressed language recognition problems. The grammar compression is more convenient than LZ-encoding, its size differs from that of LZ-encoding by at most logarithmic factor, the constructive proof is based on the concept similar to balanced trees.
71 citations