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.

Apparatus and method for determining a likely word sequence from labels generated by an acoustic processor

Abstract: Continuous speech recognition is improved by use of a known vocabulary and context probabilities. First, the unknown utterance is analyzed as a sequence of phonemes, then each phoneme labelled to form a string of labels. The shortest label interval which is recognized as a word is assigned a storage stack where similar-sounding candidate words are stored. Multiple stack decoding, and liklihood envelope criteria for word path extension decisions, are further features of the system.

System and method for identifying and labeling fields of text associated with scanned business documents

Abstract: A system for electronically distilling information from a business document uses a network scanner to electronically scan a platen area, having a business document thereon, to create a bitmap. A network server carries out a segmentation process to segment the scan generated bitmap into a bitmap object, the bitmap object corresponding to the scanned business document; a bitmap to text conversion process to convert the bitmap object into a block of text; a semantic recognition process to generate a structured representation of semantic entities corresponding to the scanned business document; and a document generation process to convert the structured representation into a structure text file. The semantic recognition process includes the processes of generating, for each line of text having a keyword therein, a terminal symbol corresponding to the keyword therein; generating, for each line of text not having a keyword therein and absent of numeric characters, an alphabetic terminal symbol; generating, for each line of text not having a keyword therein and having a numeric character therein, an alphanumeric terminal symbol; generating a string of terminal symbols from the generated terminal symbols; determining a probable parsing of the generated string of terminal symbols; labeling each text line, according to a determined function, with non-terminal symbols; and parsing the business document information text into fields of business document information text based upon the non-terminal symbol of each text line and the determined probable parsing of the generated string of terminal symbols.

Polynomial time parsing of combinatory categorial grammars

Abstract: In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating a representation of the parse trees has two phases. Initially, a shared forest is build that encodes the set of all derivation trees for the input string. This shared forest is then pruned to remove all spurious ambiguity.

Severing of downhole tubing with associated cable

Abstract: Methods for severing a tubular string having a cable in association therewith can include lowering a cutting apparatus into the tubular string and actuating the cutting apparatus to form a cut in the tubular string and sever the cable. Severing the cable in this manner can be performed through a single actuation of a single cutting apparatus, enabling at least a portion of the tubular string to be subsequently severed and retrieved, unimpeded by the cable.