Abstract: A non-transitory computer-readable recording medium stores an index generating program that causes a computer to execute a process including: generating presence information of a plurality of pieces of text data, the presence information including whether each of a plurality of elements, included at least one of the plurality of pieces of text data, is present for each of the plurality of pieces of text data, the presence information including a first axe for the plurality of elements and a second axe for the plurality of pieces of text data; detecting collision data for hashed index information when generating the hashed index information, the collision data corresponding to data elements that are independent in the presence information; and setting additional values to each of a plurality of specific collision data, respectively, for one of the plurality of hashed axes.

Abstract: An encoding device generates static-encoded data from input text data, utilizing a static dictionary that associates a character strings and static codes, respectively the static-encoded data including a plurality of static codes corresponding to a plurality of character strings that are registered in the static dictionary, generates dynamic-encoded data from the static-encoded data by encoding a character string or the static code that occurs more than once in the static-encodes data into a dynamic code, creates a dynamic dictionary associating character strings or static codes with corresponding dynamic codes, respectively and creates a Huffman tree and data of a leaf in the Huffman tree based on an occurrence frequency of the dynamic codes and the static codes in the input text data.

Abstract: A character recognition apparatus includes a storage and a processor that executes a method including generating input stroke data from input coordinate data corresponding to an input operation, generating stroke combination candidates and evaluation data corresponding to the stroke combination candidates from the input stroke data, the stroke candidates including target verification strokes combined to constitute target verification characters, identifying a first stroke combination from the stroke combination candidates based on appearance probability of the target verification strokes, appearance probability data of each stroke stored in the storage, and the evaluation data, and outputting a character corresponding to the input operation based on the first stroke combination. The appearance probability indicates a probability in which the target verification strokes appear in each of the target verification characters.

Abstract: A system includes circuitry configured to: read a plurality of character information and a plurality of identifiers that are included in a text file; determine whether a character information among the plurality of character information is included between the at least one pair of identifiers among the plurality of identifiers in the text file; and associate the character information with the at least one pair of identifiers when it is determined that the character information is included between the at least one pair of identifiers.

Abstract: A method includes: setting a first and a second storage regions; first creating a first compression code of a compression target data in a file using a identifier indicating the data in the first storage region when a predetermined first consistency between the compression target data and the data in the first storage region is detected; comparing the compression target data with data in the second storage region when the predetermined first consistency between the compression target data and the data in the first storage region is not detected, the compression target data being moved to the second storage region after the comparing; and storing the compression target data into the first storage region associated with a identifier indicating the data in the first storage region when a predetermined second consistency between the compression target data and the data in the second storage region is detected.

Abstract: A method includes: first setting a first and a second storage regions; first comparing a compression target data in a file with data in the first storage region; first creating a first compression code of the compression target data based on the data in the first storage region when a predetermined first consistency between the compression target data and the data in the first storage region is detected; second comparing the compression target data with data in the second storage region when the predetermined first consistency between the compression target data and the data in the first storage region is not detected, the compression target data being moved to the second storage region after the second comparing; and first storing the compression target data into the first storage region when a predetermined second consistency between the compression target data and the data in the second storage region is detected.

Abstract: A searching device converts a searching data into an encoded searching data in a first encoding format according to a first encoding rule; and searches the encoded searching data in a target encoded data that has been encoded into the first encoding format by the first encoding rule, or that has been encoded in a second encoding format wherein when a specific encoded data encoded in the second encoding format is detected in the searching, the searching compares the encoded searching data and a converted encoded data, the converted encoded data being the specific encoded data converted into the first encoding format based on a predetermined conversion rule.

Abstract: The encoding apparatus registers, in a dynamic dictionary, strings in input text data that are not contained in a static dictionary. The encoding apparatus adds, to first hashed data obtained by individually N-dimensionally hashing words contained as registered items in the static dictionary, hashed data obtained by individually hashing strings registered in the dynamic dictionary. The encoding apparatus 100 determines, by using the first hashed data, whether each input string has been registered in the static dictionary 124 and whether the string has been registered in the dynamic dictionary 122. In accordance with the result of the determination, the encoding apparatus 100 performs encoding based on a content registered in the static dictionary or the dynamic dictionary.

Abstract: A code converting unit encodes input text data based on an code assignment table stored in a storage device that defines a conversion rule for encoding text data, wherein; the code assignment table being generated by assigning a part of character strings assigned to a 1-byte region of a first code assignment table to a 2-byte region of the code assignment table, and by assigning one or more codes each having two or more bytes to at least a part of character strings assigned to the 2-byte region of the code assignment table.

Abstract: A non-transitory computer-readable recording medium stores an encoding program that causes a computer to execute a process. The process includes first encoding a first character string in input data to a first code, when the first character string being registered in a first dictionary, the first code being associated with the first character string in the first dictionary; second encoding a second character string in input data to a second code and registering the second character string to a dynamic dictionary, when the second character string being not registered in the first dictionary, the second code being associated with the second character string and preliminary information in the dynamic dictionary; and generating encoded data including the encoded input data and the dynamic dictionary.

Abstract: A computer-readable recording medium stores a program causing a computer to determine the size of an applied 2N-branch non-contact Huffman tree depending on where in a range the total number of types (X) of character information groups exists. The size of the 2N-branch non-contact Huffman tree has the maximum number of branches, 2N. The radicand N is an upper limit of the length of a compression code. Thus, when the size of the 2N-branch non-contact Huffman tree is determined, the radicand (N) may be determined depending on the total number of types (X) of character information groups. Specifically, when the total number of types (X) of character information groups is 2x?2<X?2x?1, if the maximum number of branches (2N) is at least 2x?1, a Huffman tree can be established. To minimize the size, N=x?1 may be adopted. Further, when the total number of types (X) of character information groups is 2x?1<X?2x, if the maximum number of branches (2N) is at least 2x, a Huffman tree can be established.

Abstract: A method that includes correcting at least one of a character image of a target replacement character or stroke information of the target replacement character, in response to a designation of a specific character among recognized characters from handwriting input and an input of the target replacement character that is to replace the specific character, and updating at least one of a character image of the recognized characters or a stroke image of the recognized characters by utilizing at least a corrected one of the character image or the stroke information. The at least one of the character image or the stroke information is corrected based on coordinate information corresponding to the specific character. The coordinate information is generated from at least one of the character image of the recognized characters or the stroke image of the recognized characters that are stored in a memory.

Abstract: An information processing device compares a particular unit including a plurality of words and each word corresponding to an encoded output previously output to an output buffer, when encoding an input text word by word and outputting the encoded input text to an output buffer, detects a duplicating part that includes the particular unit and performs dynamic encoding on the detected part to replace the detected part with a dynamic code.

Abstract: A decoding method includes: decoding first coded data included in a coded data into first partial data, the coded data being encoded from first data with a first character code, by a processor; detecting character boundary in the first partial data based on character code information that the coded data is encoded from the first data with the first character code, by the processor; and converting at least a part of the first partial data into second data with a second character code utilizing the detected character boundary, based on information associating the first character code with the second character code, by the processor.

Abstract: An information processing apparatus according to an embodiment determines whether a target character string is registered in a first dictionary, the target character string being a compression target contained in input data, outputs a compression code corresponding to the target character string when the target string is registered in the first dictionary, searches the target character string in first data when the target character string is not registered in the first dictionary, the first date accumulating character strings that are a part of the input data and have been determined to be not registered in the first dictionary, registers a matched character string in a second dictionary different from the first dictionary when the target character string is searched in the first data and outputs a compression code corresponding to a registration number of the target character string in the second dictionary.

Abstract: A compression device includes a processor configured to execute a process. The process includes: storing, in a storage, a first compressed code in association with a first element, the first compressed code corresponding to a combination of a first element and a first delimiter, the first element being one of a plurality of elements constituting input data, the first delimiter being one of delimiters delimiting the plurality of elements and succeeding the first element in the input data; acquiring, from the storage, the first compressed code in response to reading a sequence of the first element and the first delimiter from the input data; and writing the first compressed code into a storage area that stores therein compressed data of the input data.

Abstract: A compression file formed by compressing an object file is compared in a compressed state with a compression code string that matches with a compression character string of a character string to be searched for. The compression code string acquiring no match as the result of the comparison is decompressed as it is. On the other hand, the compression code string acquiring match is substituted with a substituted character string in a comparison and substitution table generated in advance.

Abstract: A computer-readable recording medium stores a program causing a computer to execute an information generating process that includes tabulating an appearance frequency for each designated word in an object file group in which character strings are described; identifying for each designated word and based on the appearance frequency tabulated for the designated word, a rank in descending order up to a target appearance rate for the designated words; detecting in an object file selected from the object file group, specific designated words among the identified ranks; and generating for each of the detected specific designated words, index information that indicates the presence/absence of the specific designated word in each object file among the object file group.

Abstract: A method includes: first setting a first and a second storage regions; first comparing a compression target data in a file with data in the first storage region; first creating a first compression code of the compression target data based on the data in the first storage region when a predetermined first consistency between the compression target data and the data in the first storage region is detected; second comparing the compression target data with data in the second storage region when the predetermined first consistency between the compression target data and the data in the first storage region is not detected, the compression target data being moved to the second storage region after the second comparing; and first storing the compression target data into the first storage region when a predetermined second consistency between the compression target data and the data in the second storage region is detected.

Abstract: A non-transitory computer-readable recording medium has stored therein a compression program that causes a computer to execute a process. The process includes: extracting a numeric character string from input data, the numeric character string indicating a numerical value and including therein at least one numeral; and converting the numeric character string to a compressed code utilizing a dictionary that associates numeric character strings and compressed codes.