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.

URL mapping methods and systems

Abstract: An input URL string is searched for a particular pattern, the pattern being defined in a manner such that the search may be satisfied while allowing variability among constituent parts of the input URL string. The input URL string is mapped to an output URL string if the pattern is found in the input URL string.

System and method for correcting a string of characters by skipping to pseudo-syllable borders in a dictionary

Abstract: A retrieving unit retrieves an entry of a dictionary which corresponds to an input character string while comparing input characters, one by one, with entries of TRIE tables stored in a dictionary storing unit. When a character of the input character string does not coincide with any of the entries in the currently-used TRIE table, a skipping unit locates a next effective pseudo-syllable border in the input character string to find candidates of those TRIE tables which correspond to the effective pseudo-syllable border. The retrieving unit retrieves a character string consisting of those characters which follow the pseudo-syllable border thus located, while using the candidates of these TRIE tables, and retrieves an entry in the dictionary which corresponds to the input character string to thereby output it as a recognized word.

Distributed model predictive control approach for cooperative car-following with guaranteed local and string stability

Abstract: In this paper, a serial distributed model predictive control (MPC) approach for connected automated vehicles (CAVS) is developed with local stability (disturbance dissipation over time) and multi-criteria string stability (disturbance attenuation through a vehicular string). Two string stability criteria are considered within the proposed MPC: (i) the l∞-norm string stability criterion for attenuation of the maximum disturbance magnitude and (ii) l2-norm string stability criterion for attenuation of disturbance energy. The l∞-norm string stability is achieved by formulating constraints within the MPC based on the future states of the leading CAV, and the l2-norm string stability is achieved by proper weight matrix tuning over a robust positive invariant set. For rigor, mathematical proofs for asymptotical local stability and multi-criteria string stability are provided. Simulation experiments verify that the distributed serial MPC proposed in this study is effective for disturbance attenuation and performs better than traditional MPC without stability guarantee.

Confidence-driven rewriting of source texts for improved translation

Abstract: A method for rewriting source text includes receiving source text including a source text string in a first natural language. The source text string is translated (S208) with a machine translation system to generate a first target text string in a second natural language. A translation confidence for the source text string is computed (S210), based on the first target text string. At least one alternative text string is generated (S216), where possible, in the first natural language by automatically rewriting the source string. Each alternative string is translated (S218) to generate a second target text string in the second natural language. A translation confidence is computed (S220) for the alternative text string based on the second target string. Based on the computed translation confidences, one of the alternative text strings may be selected as a candidate replacement for the source text string and may be proposed to a user on a graphical user interface.

Method and system for mapping strings for comparison

Abstract: A method and system for mapping a number of characters in a string, wherein the string comprises a combination of characters representing indexed expressions and a combination of characters representing non-indexed expressions. One embodiment produces a weight array that can be utilized to compare a first and second string having indexed and non-indexed expressions. In one embodiment, a method generates a set of special weights for characters that represent indexed and non-indexed expressions. The method then associates a weight value of an indexed expression with the specific group of characters representing a specific non-indexed expression, and generates a weight array by retrieving a plurality of special weights associated with the specific group of characters representing the specific non-indexed expression and the associated weight value of the indexed expression.