公开(公告)号：DE3382188D1

公开(公告)日：1991-04-11

申请号：DE3382188

申请日：1983-05-25

Applicant: IBM

Inventor： CONVIS DANNY BRADLEY ,  GRIMM PAUL JAMES ,  REED MARTIN ANDREW

IPC: H04N1/411 ,  G06F3/041 ,  G06F3/048 ,  G06K9/48 ,  G06K11/06 ,  G06T3/00 ,  G06T9/00 ,  G06T9/20 ,  H04N1/41 ,  G09G1/16 ,  G06F15/20

Abstract: @ A method for compactly storing and reproducing script and graphic data from a computer input device. The computer input device sends a time sequence stream of x, y coordinates indicating graphic character locations on the input device. The first coordinate point of the graphic data is stored. Subsequent points are buffered until a reversal in the coordinate magnitude direction is detected with regard to either coordinate axis. This point is taken as a sample point and terminates a buffered segment and starts a new buffered segment. Each segment of the graphic character is approximated by a circular arc segment which is retained by storing the horizontal displacement to the mid-point of the arc segment along with the x and y displacements to the ending point of the segment. The retained information is sufficient to reproduce the input script or graphic for display, print, or manipulation. This is accomplished by mathematically regenerating the arc segments in the same sequence as they were originally created.

公开(公告)号：DE3482508D1

公开(公告)日：1990-07-19

申请号：DE3482508

申请日：1984-04-05

Applicant: IBM

Inventor： CONVIS DANNY BRADLEY ,  CREHAN DONALD THOMAS ,  LOVELL CHARLES JAMES

IPC: G06F3/12 ,  G06F3/14 ,  G06F3/153 ,  G06F17/21 ,  G06K15/10 ,  G06Q10/00 ,  G06T11/20 ,  G09G5/00 ,  G09G5/24 ,  G09G5/30 ,  G09G5/36 ,  G09G5/40 ,  G09G1/16

公开(公告)号：DE3175443D1

公开(公告)日：1986-11-13

申请号：DE3175443

申请日：1981-02-05

Applicant: IBM

Inventor： CONVIS DANNY BRADLEY ,  GLICKMAN DAVID ,  ROSENBAUM WALTER STEVEN

IPC: G06K9/72 ,  G06F17/27 ,  G06F15/20

Abstract: Method and system for reducing the computation required to match a misspelled word against various candidates from a dictionary to find one or more words that represent the best match to the misspelled word. The method consists in comparing steps (20-24) a bit mask whose bits are set to reflect the presence or absence of specific characters or character combinations without regard to position in the misspelled word and in each of the dictionary candidate words. Then, (steps 25-27) a candidate word is dismissed from additional processing if there is not a predetermined percentage of bit mask match between the masks of the misspelled word and the candidate word.