Abstract:
A data processing apparatus that is capable of reducing the garbling of characters caused by the difference among the character codes when setting data are transferred to another apparatus by the import-export function. A storage unit stores setting data for the data processing apparatus. A receiving unit receives an instruction for exporting the setting data stored in the storage unit. A converting unit converts Unicode data included in the setting data into character code data of language, which is set to the data processing apparatus. An export unit exports the character code data converted by the converting unit and the Unicode data.
Abstract:
A dialog manager and spoken dialog service having a dialog manager generated according to a method comprising selecting a top level flow controller based on application type, selecting available reusable subdialogs for each application part, developing a subdialog for each application part not having an available subdialog and testing and deploying the spoken dialog service using the selected top level flow controller, selected reusable subdialogs and developed subdialogs. The dialog manager capable of handling context shifts in a spoken dialog with a user. Application dependencies are established in the top level flow controller thus enabling the subdialogs to be reusable and to be capable of managing context shifts and mixed initiative dialogs.
Abstract:
A dialog manager and spoken dialog service having a dialog manager generated according to a method comprising selecting a top level flow controller based on application type, selecting available reusable subdialogs for each application part, developing a subdialog for each application part not having an available subdialog and testing and deploying the spoken dialog service using the selected top level flow controller, selected reusable subdialogs and developed subdialogs. The dialog manager capable of handling context shifts in a spoken dialog with a user. Application dependencies are established in the top level flow controller thus enabling the subdialogs to be reusable and to be capable of managing context shifts and mixed initiative dialogs.
Abstract:
Embodiments of the invention relate to a method for identifying broken tag words of a data item and replacing the broken tag words with a compound word. Data items that have at least two tag words are examined to determine if the tag words are broken elements of a compound word. A computational assessment is conducted to determine a relationship between a set of compound words and an examined data item. Based upon the computational assessment a set of broken tag words may be replaced with a related compound word.
Abstract:
Techniques and structures that facilitate text operations in a bitmap-based document are described. In some embodiments, a bitmap image, as well as one or more data structures that may include text code data and text coordinate data, may be generated from an original document. Text coordinate data may relate a location of the text code data to a location in the bitmap image. In some embodiments, a bitmap representation of text and one or more data structures, that may include a set of coordinates of the bitmap representation of text and text code data corresponding to the set of coordinates and the bitmap image may be received. Text operations may be performed on the bitmap representation of text.
Abstract:
A method and computer program product for reflowing a PDL page without using the original application used to create the PDL page. The method and computer program product include receiving a page represented in a page description language, the page including a plurality of page objects, and changing one or both of a size of the page and a size of one or more of the page objects, while maintaining spatial relationships between the page objects.
Abstract:
To provide a display device for enabling preferable Japanese hyphenation while suppressing restriction due to a character code system. A font data memory unit (50) stores font data which contains a plurality of font records each containing font information for displaying a character and line feed control information for controlling line feed conducted before and/or after the character. A character string display unit (54) displays a character string based on the font information relevant to all or some of the plurality of font records. A line feed control unit (52) determines a line feed position in the character string being displayed by the character string display unit (54) based on line feed control information relevant to characters included in the character string.
Abstract:
The hierarchy of the hyphenation points in a word is considered and the amount of space remaining in the line where the hyphenated word is to fit is determined, thus selecting the best hyphenation point for the word. Instead of selecting the last possible hyphen within the hot zone, the hot zone is scanned to find hyphenation points that may be better than the last hyphen within the hot zone. The higher a hyphenation point is in the hierarchy, the more preferred is the hyphen.
Abstract:
Automatic means and methods for hyphenating words suitable for use with digitally controlled printing apparatus wherein the consonant-vowel pattern of a predetermined selected portion of a word is converted to binary digital values and compared to a compact table of consonant-vowel pattern values. Certain exception conditions may be separately handled to increase accuracy.
Abstract:
Apparatus for automatic hyphenation of input words from a word processing system. The apparatus includes a digital reference matrix memory containing a vector representation of all legal hyphenations for each dictionary word in the form of a calculated magnitude and associated unique vector angles. The vector magnitude constitutes the address data for accessing the memory. When an input word is received for hyphenation, a hyphen is added to the word and its magnitude is calculated. The memory is accessed for an address which equals the calculated magnitude. If the address is not found, a signal is generated indicating that the word cannot be legally hyphenated. If the address is found, then the corresponding angles, representing legal hyphenations of the input word, are compared with test words generated by sequentially inserting hyphens in the input word. All equal compares are flagged and the corresponding hyphenated input words are gated onto the output line.