公开(公告)号：JPH0896085A

公开(公告)日：1996-04-12

申请号：JP22755994

申请日：1994-09-22

Applicant: IBM JAPAN

Inventor： NOZAKI HIROSHI ,  ITO NOBUYASU

IPC: G06K9/03 ,  G06K9/72

Abstract: PURPOSE: To balance the limit of the number which can be presented and a request to perform a prediction as far as possible by effectively performing a switch as to whether performing only a one-character prediction or performing a word prediction. CONSTITUTION: A reading candidate character string is recognized from the reading information inputted from a coordinate input/display device 11 via a character input part 7. For every recognized reading candidate character string, the character which can be continuous to the reading candidate character string and the incidence probability (branch probability) are acquired by retrieving a dictionary. The probability L of a predicted character string is determined. At this time, whether the number of the predicted character string is more than the maximum number N to be presented to a user as candidate character strings or not is judged. The words are sorted in order of larger L. The difference of the sum total Lc of the L of the words up to an N number and the sum total Ld of the L of the words up to an N+1st number or after is a prescribed number or more, the word predicted by performing an extension is presented to the user.

公开(公告)号：JPH06162274A

公开(公告)日：1994-06-10

申请号：JP30700692

申请日：1992-11-17

Applicant: IBM JAPAN

Inventor： ITO NOBUYASU

IPC: G06K9/72

Abstract: PURPOSE:To enable a post-processing based on a transition probability in a language provided with a lot of character sets such as Japanese by adding attributes such as the parts of speech or the like to candidate characters obtained as the result of character recognition and evaluating the transition probability. CONSTITUTION:In a post-processing device for selecting the optimum combination of the candidate characters from the view point of a character transition probability from the strings (character lattices) of candidate character groups obtained as the result of recognizing Japanese character strings, a character/part of speech correspondence storage means 10 stores the parts of speech possibly adopted by the respective characters in the character strings for the respective characters and a part of speech corresponding means 11 makes the parts of speech correspond to the respective candidate characters based on stored contents. Also a character transition probability storage means 12 stores the transition probabilities that the respective characters corresponding to the parts of speech are connected to each other and a connection relation evaluation means 13 evaluates the connection relation of the candidate characters with the candidate characters in front in the character lattices for the respective candidate characters corresponding to the parts of speech based on the stored contents of the transition probability storage means 12. Then, an optimum pass selecting means 15 selects the candidate character whose connection relation is optimum.

公开(公告)号：JPH07319900A

公开(公告)日：1995-12-08

申请号：JP10818694

申请日：1994-05-23

Applicant: IBM JAPAN

Inventor： ITO NOBUYASU

IPC: G06F17/30

Abstract: PURPOSE:To balance a necessary spatial cost and a retrieval cost by deciding a prefix part from a partial string where a small number of input characters are decided and retrieving 'TRIE' again. CONSTITUTION:A candidate character lattice is inputted from an input device 307 and is stored in a prescribed area on the main storage of a computer as a candidate character lattice 308 by a candidate character lattice storage means 302 with the control of an input means 301. The storage means 302 supplies the candidate character lattice 308 to reference or transfers it. The input means 301 stores the specified content of a file in a magnetic disk into the candidate character lattice 308 through the input device 307. A retrieval work quantity estimation means 303 calculates a retrieval start position from which the work quantity of dictionary retrieval can be expected to be small from the candidate character lattice and data 309 of the number of average branches, which is obtained at the time of generating a TRIE dictionary and is preserved in the magnetic disk.

公开(公告)号：JPH02250188A

公开(公告)日：1990-10-05

申请号：JP7044289

申请日：1989-03-24

Applicant: IBM JAPAN

Inventor： ITO NOBUYASU

IPC: G06K9/70 ,  G06F17/30 ,  G06K9/62 ,  G06T7/00 ,  G10L11/00 ,  G10L15/06 ,  G10L15/12

Abstract: PURPOSE:To reduce the duplicate recursion formula calculation of templates having the same partial label sequence from the first by making plural templates into a tree structure dictionary corresponding to each access bus. CONSTITUTION:A tree structure dictionary 11 where each label corresponds to one node is generated from plural label sequences forming templates and is held in a storage device 12. A buffer area is reserved in the storage device with respect to the node of each label of the tree structure dictionary 11. Node selection 13 of the tree structure dictionary 11 is performed in the depthwise direction, and stage calculation execution 14 of the input label sequence is performed with respect to the label corresponding to the selected node, and the result is held in the buffer reserved for the selected node, and this operation is repeated. Thus, the duplicate recursion formula calculation of templates having the same partial label sequence from the first is reduced.