AU700320B2 - Text input system - Google Patents

Description

1 TEXT INPUT SYSTEM The present invention relates to the text input system to lower the burden of text input for the information processing and communication control system.

In the present specification a reference to 'text' is to include a line of text or a string of radicals or characteristics, or a sequence of component characters, making up a word or line of text.

As one of the text input method to lower the burden of input, the conventional system utilizes an abbreviation or a shorthand. For example, it has a dictionary with plural words which are compared with S 15 the data input and the word data corresponding to the data input is fetched from the dictionary and no more input is necessary.

ee However, in case of the above mentioned Sa method, it is necessary to remember the abbreviation 20 and activate the system function to find a desired word depressing a corresponding key, and its efficiency depends upon the user's capability, as all characters of the abbreviated or shorthand words must correspond to those of data input for the successful functioning.

The conventional method has a common way to accept a leading part of word data or a radical of Chinese character or Japanese kanji character from the keyboard or handwriting input unit. After the operator depresses the enter key, the input data is compared with the contents of dictionary to find word to d the sele H o we a. key typi find for (eye that to i char or spa ng som a des typing s-free the o nput a ac te r, hich pla y, esire one r, th ce ke e cha ired on t )mann perat line equates the if any. The d word on t of them.

e method to y as a sepa racters to word is not he keyboard er. And, i t or reiterat of text, c the system res to r rmi uit n a un data input operator may he display s i is es ha: to s Enter after nate and able blind like ly the steps acter by col late for with the contents i I 1 ii a i s i a y wo g pa some or.

erat but e effi cas w o u 1 woul nary of C char the ras w n i c rt as th of them Its meth or s abi to the ciency.

of dictionary and h have the same e text input, is selected by the tod heavily relies on lity and does not increase of the e o d b wi hin act fre the t the Such an e erato tical a li se le f the handwriting inpu e plenty of words in t th the same radical as ese characters or Japa ers input which will quent change of a list display and repeated desired word on the required actions may fficiency of input and r' s convenience.

l y, the sy s t em f i r s t st of radicals and the cts the radical to whi of steps t, he nese ch the system gets back t o t he o p er a o 3/33 he r ion 1 wh i p i ng.

evant cha the oper requires racte ator.

more rs for the That is burden on

S

5* S S

S.

S

S*

T

inven a way or a an ef to th of it equiv have

T

give the o an ef a nat

I

metho he tex t i on, w of da handwr f i c i en e oper while alent been d he tex an ext perato ficien ural i n comp d, the inp s in a in ting and to r it i o wh ing.

inp a bu be y of ut syst tended put fro input natura withou s in us at they em to m un 1 t e of pro a ke it, f way bein and e ard giving input onscious the step me en g a he nput metho arison wit invention ta with th y characte racter inp ata on the om diction one in the more data way to re of data in he operato a variety thod sh and tra ble to data in d.

h the c method e dicti r, at th ut and disp la ary aft dictio input.

onventiona collates onar y, e time replaces y with er finding nary and fici rden wel low.

ly increase t and lower on the typin method ment invention is way to furth an the g ioned Addi flexible increase ly, ffe this ctive the e f f i c i ency of input, by

_T

4/33 decreasing the number of dictionary wo wi ct to th of da re su fr

S.

*4 C. C 0*

C

S*

S

rds by th mor ers an store ose am word.

ta inp ach th ppleme om the In c e inpu ntents rds an ve the the w than dec r in th ng wo t wou t and char t the dicti se of char of di phra folio rd ld s ac r on t ac ct s e wi to ha pecifi se the dictio s with decre horten ter po emaini ar y.

he com ter or ionary v c n a s n the w number umber ry by he sam e the he tim tion t nart se e nu e o of ord of le st mb to word twe nd top

S,

ng the invention system s Th a wh as th c o: of no un af v e ue ha i pu in ti e nt w ion ord s y s t e m i s tne s nput da t chara g the i on a r y.

input a ne in t 1 e c i o n lection id rele of havi a, by se ord whi g input g part er than n t a m e ta cte npu The fte he of van ng lec ch ch of determine di c t i onar eading par which inc or stroke, and the co ystem requ finding th ctionary, he desired word data, ural relev ng the cludes the acter in t levant wor s y t ludes ntent ires e or word ant s among in ca word un i qu folio remai data he d that was success fully collated.

The system determines a unique line of which i data an plural stem of the uni is uniq same on or whic same on in the text da word.

dat es s case whic the ine a in sai aid line of dete h have t s y s t e m system of text rminate s last inp ue and i last inp part of than the d d of cti he de dat wi ut ncl ut 1 i st icti tex ng same termi a wh th t char ude s char ne o em o onary t e an as is as emai a ot d t the un i the nin her nes ich he act th act f f er, e er The w o r wor as sai the par oth col sai ystem d which h id line input s ame end f said than t ted wit di c t ion ete as of yst r m i n e rmine the s text em, a rt a s e of s a uniq ame lead or data nd which the rema text or successf eading p ue data ing part from has ining data ully art of t o er la d hat was h said 1 ary data.

The c es, to the di ording re in Al so, conve y cons its o tionar A c c o r ha r a c ter po s i t i on, in the above determine the unique word ctionary can be varied to the number of words to the dictionary.

in the abbreviation input, nt i onal method uses a d i c t i oisting of an abbreviation riginal form of word in the y.

ding to the invention system, in the compa cha tak ters n wor lace; ison between the input strokes of the abbreinput, the fol lowings The sys of text spec if i text or first a l ine of and whi between of text rega rd 1 some ot while c text or ei the r of the data or compari precedi tem determines a unique line or data or a predetermined c number range of 1 ine of data which has the same nd last data as those of text or da ta f rom input system, ch may inc lude some other data f i r s t and la s t da t a o f l i ne or data from input system, ess of the continuity of her data to be equivalent ol lat ing between line of data and dictionary data, f rom le f t to r i ght compa r i son first data and its fol lowing f rom r i ght to le f t for the son o f la s t da t a and i t s ng data.

r The sys t em de t e rmine s a un i que l ine o f t ex t in s a i d d i c t i ona ry sy s t em whi ch represents the unique word in the d i c t i ona ry and wh i ch conta ins the f i r s t cha r a c te r f ol lowed by some other charac ter s o f word da ta to input f rom the input system, a t the t ime o f each charac ter input, and in case of having plural data which contain the same first and some other characters of the word da ta to input f rom input system, r 71/3 the system line of te the same c character one as the the remain data other already co text data.

determines the unique which terminates with ract whi ast g pa han ated er as ch inc input rt of the pa with the lud cha lin rt the Sa es ra e th 1 st the cte of at ine input s ame r in text was of r r he via ze ts in ch an ona via bbr r d, re via not on sti wed bbr i qu o m e ome cte e i ent n d tan ab fi c te omp ry. Ev tion d ev i ati the i all th ted wo have and ma ng of by so ev i ate e in t e x a m p examp r posi n the total are ples c io ic da b r rs rs ar en ic on nv e rd to y t h me d he le ti di n gi ou em y. I tio on act e w se se y c ts th h si ig em of Th he ar ra re ab an w d at th vi ti na do th o ab o te er c er to mp ct w f t p ha rator eit ch un wi th th charact d which na ry.

he numb a word y in co f chara ow. The line o of uld of be ris rs rd ext h t w o e exam or word pattern element data to repre- 8/33 sent an original word data.

Al s o, the r e is a po s s i b i i mo re qui ck in f ind ing a unique ty to word be in the d of sh examp its 3 if a dicti Word (o r line of text) ic or le, rd Sionary, by words in ab i 1 i ty" character dec r e asin the dictio can be ide positions in the fol g the nary. F nti f ie e lowing number or d at ab i) b ide" ona ry.

is not The char tion word uniq dict number acter in a s to b ue in ionary The num cha the to er ac wo 1 f rs of e the r abandon ate bot d o m e n domen hor ide ility ject le normal oard olish olition omin a b 1 e ound out

V

33 y e i d ge oa d u pt e nc e en t i n the o l ut e 01 yve o rb o rb en t t a i n (T o t a 1) 12 7 184 0 0 0 0 0 0.

1 27 /1 84 0. 6 9 (3 1% d if fe re n ce) Handwr it ing c p a tt e rn elIe me c te r o de s or i g in a 1 w o r d 0v2 00 12 1102

I-

0 21 1 2 51 21 20 03 0 I n u n co d s e a t 0 s i x amp 1 e, T iE t he s ec on d t i o n.

or "C p at t er c an b e n elIemen t 1 0/33 003012 0134 I 3 12011111

I

the S1 ent sy cril to I t i o I tio e tem.

drawings: r r In F00 1, conten Ne by cha F0 an END F 0 03A the st

FO

a code a t x r 0 t e 0 s a bl an sys tem of ed in ig. 17 ary to the fl t the s of c t F002 a c t e r.

3 test code.

o term p goes 4 test to ter ock tem.

pre Fig.

show use owch beg i oun t inp diagram wa i

F

mp th of g, fl a i th d ig.

lea s, a x t, to th wo Fig. 12, e rk are of the of example, ention is .12 and F i g.

s of the invention Sa.

r s i I f ina to s i min f th yes, te a

FOO

f th ate S, t he p sets charac data i p goes If NO, s to or. If n which ut word, F004B.

YE

t 4.

e in a wo he s roce T- f npu t ea, suit ata Se.

oe s rmi f f, is a word to nates and the back to is goes to end F 0 0 2.

04B tex If t adds t inp he te the ut st wo and of rd to goes FOO4 not sepa tor code,the p oc s p oc ed no t s e p a r a t o r c o d e, the p r o c e s s p r o c e e d s to F005.

F 0 0 5 period co the step sentence ce), and the perio F0 06 one of le the step F006C For the c explanati matter of related t In case o of F006C, F006D made to s of word f just befo If YES, FO the state the curre current i and the s I f NO, not goes to F tes de.

goe are goe d c tes tte goe te ase on fu o t f t th te upp rom ts if t If it i s to FC a (term s back ode, the ts if t r s (cha s to FO sts if other is made nction he way he ESC e step sts if lement dictio the cur takes input/ data in t has t goes g takes for th esult o he input d s the peri )05A which a e, s the enten s not 06.

na o s t e ac 6C.

t hai he: hi f od oe he he ar: en la is ut, b tion FO0 2.

ep go a ta ter s) is a n ESC I f NO, rr r r

ESC

n ue no inv the

FOO

e s s ini the a i re jus use cel npu cod o fu to t t di ent i te s 6D.

was ng p pro nput stor t be the led t of ther e ectly n.

ing re 06E of nt npu tep hin 002 e r cha to ce p b e e fore t 0 p e f th Sac nex

FOO

02.

If th

A

r s) ay 006 th the B, t e ana tne step t data input.

6 is one of e process goes input data, he input data input data xt data. Then, test T-f lag.

the ded t the end of form a new line of te e step goes to F007 to 12 3 3 F007 tests the T-f lag to know if the At in re pr fo s to ionar o mor ud i ng ionar input h mea ieve to F ionar he sa ca te ieve edure owing F 0 8A ionar ther data he di 00 8B.

he te retr y. I f e wo the y, an at ns t in t 008 y se look me t that in t is s. T tes y re e ar inpu ctio If stin proc goes 0 9 A, goes nts ning ieve s ON, i rd to line d the F002.

hat th he dic that i arch.

t i l l t me seal of t step If T ere tion s th exist ns th ch a xt da goes flag re wo ry, th subp n the ther ique in t ck to

OFF

s to step cess s up ime, the he d in t T- fl e sh ctio c t i c ined the th a al a he ag iou na a st r St oo *o exp 1 hen, ts i trie e wo t an anry NO, t g of eed e word he of to to h ts 008 A r d h s s t s t At e a c o re di Ne d p a t k t ep ep

F

nd nt ma c t xt ro o o

I

t 0 1 to I the to 1 f d par ds whi which If YE e step F008B, to FO ext FO s y s t e m system 009 B.

splay, of da d disp es the 009D a sent e dic is Id b ry. I t SO ep g esul F008 ch i cou S, th goe if 0 9A.

08C.

ma k F009 sup ta i t Ot herewise, oWS 0 w S ude be un tep g o F01 is un ique oes 1.

ique, ry.

ff buz ave men t f in in go zer s ts r o m rom put put es Sona

FOO

ces s the F002 ry, a 9C ma and end o ay.

end ds ce Being back to the step of F008B, 13 3 in case of plural words found, the p goes to F end parts y are compa Next F008D nique word, s to F009A.

F010A.

F010A perf which from the f the so, t se, th he leading e dictiota input.

is step step goes a go to th Th it rr r r r r r r r e ro is c s fo If stin es b 1 re r th st r es t If ique s fo If 08A oce s e wo ctio the e ne 12.

t of wo ntents orms the test i rd and abbrevi are explained low: the is ck u 1 t, te sul

FO(

suit sue c e F 002.

e pro ng if s uni to s the test the pro lowings.

the test r F 1OC comes t d data t ary. The e are wo t input.

re ce s f sfI In es it ue,

PP

ul g ul ot 11 tr ce a t g of ted wo at S02 next I1, t case s goe is u the lemen t of oes t t at uniq and ieve ss go a to the pr f s to que roc rd.

0 and s ss-

C

the not d C i 11 es n

FO

re ro d

N

orem th the to trie ep g ent i oned there 0, T-f esu 1 o no s ba ent N t

FO

the

FO

th o i 12A un 02.

e s ndicate ma sue s ss fu 1 ubprocess S002 is to to search in the dictionary.

14/33 test if there is no more word to ret pro on ret the If te s the the to o f the this wor 002, dic the

NO

di s u ds th tio ne

MOR

cti bp r to e p ary. I t S002

WORD

nary a f so, the A, turns to nd goes to t o e a of s s.

rie e s s ve at goes r r r r r r r r r r his bou er, dar S00 dic of te r If ge si fo po in dic te r go fl eed At of 1 t qua case, ndary and 1 y getl 4 coml tiona word or n the g ts up ze in r the ssibi the tiona than es b a ag is s to S006, th of er th wit he ing are y, fro da are imi up th owe sma th nd th located etween up n the dic limit me ata value imit mean r on a r y.

s e t t ing the npu th nar o t.

reater to div to 2 to next r lity to lower h ry data the da ck to S OFF at 3006.

it is from t t of th 07 is p ag I e ti se 1 rie ind f a i ount in 2.

004,

ON

re 1 a tr ow as un be

SO

Th t w e 1 y i t S iev er th iqu c au 03 en, gre tep 004, al hall ere e se was the h ding the the s ed if the le ictionary is ta input.

rmed to know ading if it is single. In case of a s i ngle Vr3 3 te re up as un be

SO

the g for t i ona proce da ta, NOT E S009.

At S ding less If t t ing rieva er ha there que d ause 3 was step If t re is cedu r erro nex the y a s.

he

UAL

09, art han e 1 t S t s un nd If ste at tep S ique goes there p goe S006 r n n t lu 01 te s on the the of this ral numb 2.

p p roceeds testi ata f of t han f S010 ze in or th sib i 1 e upp onary n tha S002.

han f g wro proce re of g i om e d ag ivi o 2 ne ty r h dat of ma he ta s O de i dict inpu N af f the ionary t.

ter the eva 1, the er r r r r r T 1i e ti h e the pro the not whi i n v inv to dic s t s t e s s ess eth th oc e t u t.

g i wi an 011 o t lat s OFF th the d goes which he mat ed to at S009, d ch en

B

fi crib s no on.

nchi the ed here, due t directly r ng here from SOO data with the 1 ies t e tha 1 f r y, ry tha re sp tri as t of trie ecif eva 1 the of n ta ar ra ea ta

SO

of taining ut.

the step the s

A

goes a m e ame t th to S if no word was found, if found.

and goes to S015 16A31 0 *r 0 S014 rieve ition 2 was f are data that s to S015 rieve ition t gre ause a low the S016 ding ut in tiona S017 S018 7 and ition 6 was a is lead a inp exit S019 s new posi ding a inp s sub S020 ew di up ted is er limi onary u limit cause t e is oc ding pa S Then, to ing y w e u upi t e the e 1 inp s n the at( th er st( t: pa t ry.

ew di da an a m it es to s s we r per ion wi at be 1im

SO

nd an alf e d if wer r 1 eca the al e s nro imi y u th da oun ne d wi dat f th th the a e the hich pper ed by qual step ata wa not f limit imit b use th words to tha tep go C e S S.

ound.

d at ing the hich ower th f the to rises ower 1 ons of rt les and j o c e s s.

nd its by eq t su if imi th s t ump ound to r an us e e of d ing followings are the process of determination for the root 17/33 of word and abbreviated word, to be F010A.

called by S020 have the of the ch of charac data, the the a tests for i f oot r s sam ara ter de W 0 in to se If th w o in an of to Ne ca d c lud the ect s o, te d i u t.

i f "De the ati s e s ses

SO

ut er

S

S

orresp es the Slead i ed at the s sting s the If NO,

YES,

termi n exit ve res the p: 21 tes is inc than wl he dat ed. I f s goes e if t it is hich d nput a ubproc S r te or fin ond da ng the tep is sam t S02 on o o th inpu t of llat es t e if s th ement ioned plural wo of word.

troke or t e word pat f th e pa t an all ion o SO the e la e s s ess s on rds (In he I terr roo 1 whi is E lur ep).

A i oo t dal es 1 he and s s.

at o S( ha r t o co l ele ase di ele of h ual wo c tea al ment 1 rds which f S021, ags oe s he

OB

un i thi of e s s if ed wa npu is

SO

f la

TU

ot goe I f ag d g r u u t t h oc rn e wor subpr he te o jum e las the al rea a m o n amon clude A and for u

QUE,

rresp to th t is "Det s to d o s p t

P

d oc e ma

I

g data d, the the tes nique wo S021B ex ond to t e exit o

UNIQUE,

e r m i n e d ermined the exit ting rd is tract he f S021C of s not S022 turns on t he f unique word" this subproc If the 1 included at a e s s.

ast input character the te s t ing of S021, i 1/33 turns on the flag for "Not determined" and goes to As a sul for the data first charac ters, T001 v a forementior this subpro T002 wh: a forement i or still word If there is to the exit.

the next TO( words to re TOO2A b: S003 if the data input, was not fir the exit of th set of input ter and hich eq ed SOO ram.

ch is e ed S002 o retri no more The pr 2A, i f r i eve.

anche s input i and to su ona g o er to nt r qu i ch eve wo oce the nt i th he dv re to f th e di ste anc e mor r o c e ss.

search a a r a ce of he re is tion a r y.

goes to ntioned e of B if it 4 4 to t s th the oreme st on TO02 s t.

TOO

ween tion that

TOO

ding t of

TOO

t fo ext ter f t.

TOO

retr ract The 2B up ary of 2C pa da 2D r e rac is per ha th sel rt ta shi ve r ts to check and low ve the s e data i ects the which is input.

fts one y words those wo if er 1 a m e ame nput.

wo r not all imi lea s w the th t same lef and wa s shi cha sel rds acter to cted at T if the wo ing a cha Se art he as the 002C rd racter limit r T00 2D.

reminated after mak 2E set ieve i ing wo n, the new the upper dictio and nary owe r afte s at afo rds by the proce step goes to th mentioned S003.

I133 Fig. 13, an example of the dictionary shows seve 9.« 9* 9.

99 9.* 99* 999.

*99* 9 ft 9..

9.

99 9 9 .9 the con input o a c t r Re f di c t ion bet i cal able to corresp root of them by In this selects adhe r en Sim (Ex. 3) in this becomes of the the dat Fig Fig for the In the of the explain Ref word pa for the ra 1 ts o ing actr is ing wit der, uni s to ases to retri d i c t i onary.

ary or be ond w o th ca ad to Fig. 1 actr unique i to Fig. 1 h plural an inpu que. How 3 words and coul xt data the next nt, and 3 (Ex.

ess" i n the 3 (Ex.

words t of ever, with d sele input.

input c ge 1) n c di 2) i ad a th ct fter es on a r y.

ith the 1phas not a me e of d, ne e, ere t" e.

lar fte dic un i irs in 14 15, han ig.

ord d b rri ter han eve and

Y,

in ion u e, t a put is Fi dwr 16, pa e lo ng n e dwr dat tro he by y afte lasl id t exa r 16 a ing ie hi ern ng a dm i ma dat di le ex put dwr eme to dm ni ki a ct 2 am r it nt Fi g.

ve trat g co e twe ona r f di les spec ng i data 13 i ve mpar i son en y.

ct ionary 1 and 2 t i v e y.

nput is w.

to F leme itin a. F ke s data 1 f ts act n a eme i g.

nt g, t or suc in or ta f am Ex. 2 di c irst p e, e y tep a s I coun h dat re s ut.

Next (2nd) s tep adds the input "013 dat col the lea wo r and the the end of line o with the dictiona there is the word a input or which h part as the data picked up from th played. (The proces ut data with the display takes plac ord corresponding n the d i c t i onary, 1st step for the after showing "Not f data and ry.

which includes as the same input, its e dictionary s to replace word determined If there to the data the step goes next data registered 0e OS e a.

a a *r 0 6P a a.

a.

0 0 a 0S

E

of an tne a In t S is its f #4 e Next ch co in laced tio s e put st st tro esp his ary.

ampl At t trok n thE e o f nds case, he us me o wo iona sele that t S dict I tes #3 only whi rep to the input and IE with the data input on the display.

The claims defining the invention are as follows: i. A text input system comprising: means for entering a line of text, character by character; means for storing a plurality of lines of text, and original words in a dictionary; means for determining a unique line of text in said dictionary which includes said entered line of text, without a further special key depression, at the time of character input; C means for replacing said entered line of text with said unique line of text or said original word which o• was determined by said means for determining S said unique line of text, without the necessity of CC CC Sdepressing a special function key.

2. A text input system as in claim i, wherein said system comprises: means for identifying plural lines of text with the same stem of word which includes said entered line of text, and determining a unique line of text which has the same last character as the last entered character, among said identified plural lines of text, without being

Claims (15)

1. 4. 4 4 actuated by the depression of a special function key, at .4 the time of character input; 4*4 4. means for replacing said entered line of text with what was determined by said means for identifying and o determining, without the necessity of depressing a special function key. 3. A text input system as in claim 2, wherein said system comprises: means for identifying plural lines of text with the same first part which includes said entered line of text, and determining said unique line of text which has the same last character as the last entered character, among said identified plural lines of text, without being actuated by the depression of a special function and identifying plural lines of text with the same first part which includes said entered line of text, and determining said unique line of text which includes the same one as the last entered character in the remaining part other than that was successfully collated between said entered line of text and those in said dictionary, among said identified plural lines of text, without being actuated by the depression of a special function key, at the time of character input. t4. A text input system as in claim 1, wherein said system comprises: o means for entering a line of text consisting of a first character followed by some other following characters, character by character; *few S. means for determining a unique line of text in said dictionary which includes said entered line of text, at the time of character input, without a further special key depression. A text input system as in claim i, wherein said system comprises: means for storing a plurality of lines of text and relevant words for said line of text in a dictionary; means for determining a unique line of text stored with plural number of said relevant words for said line of text in said dictionary, and selecting a unique word among said relevant words which includes said entered line of text in the part other than that was already collated with said entered line of text, at the time of next following character input, without a further special key depression; means for replacing said entered line of text with what was determined and selected by said means for determining and selecting, without the necessity of depressing a special function key.
2. 6. A text input system as in claim 1, wherein said S"system comprises: means for entering a line of text of handwriting strokes, stroke by stroke; means for storing a plurality of lines of text of handwriting strokes and original words in a dictionary; means for determining a unique line of text of handwriting strokes in said dictionary which includes said entered line of text of handwriting strokes, at the time of entering the handwriting stroke, without a further special key depression; means for replacing said entered line of text of handwriting strokes with said unique line of text or said original word which was determined by said means for determining, without the necessity of depressing a special function key.
3. 7. A text input system as in claim 6, wherein said system comprises: means for identifying plural lines of text of handwriting strokes with the same first part which includes said entered line of text of handwriting strokes, and determining said unique line of text of Shandwriting strokes which has the same last stroke as the S last entered stroke, among said identified plural lines of text of handwriting strokes, e S without being actuated by the depression of a special St function key, at the time of entering strokes to follow, and means for identifying plural lines of text of *oe. handwriting strokes with the same first part which includes to said entered line of text of handwriting strokes, and determining said unique line of text of handwriting strokes which includes the same one as the last entered stroke in the remaining part other than that was successfully collated between said entered line of text of handwriting strokes and those in said dictionary, among said identified plural lines of text of handwriting strokes, without being actuated by the depression of a special function key, at the time of entering stroke; means for replacing said entered line of text of handwriting strokes with said unique line of text or said original word which was identified and determined by said means for identifying and determining, without the necessity of depressing a special function key.
4. 8. A text input system as in claim 6, wherein said system comprises: means for entering a line of text consisting of a first stroke and some other following strokes of S handwriting strokes, stroke by stroke; a o a means for determining a unique line of text of aooo handwriting strokes in said dictionary which contains said entered first stroke and some other following strokes of line of text of handwriting strokes, at the time of entering the handwriting strokes, without a further special key depression. ae a. a
5. 9. A text input system as in claim 1 or 6, wherein said means for determining said unique line of text comprises determining a predetermined number range of lines of text in said dictionary. A text input system as in claim 1 or 6, wherein said means for storing comprises storing said line of text in said dictionary which is organized in a random access manner.
6. 11. A text input method comprising the steps of: entering a line of text, character by character; storing a plurality of lines of text, and original words in a dictionary; determining a unique line of text in said dictionary which includes said entered line of text, without a further special key depression, at the time of 0 0. character input; 0e replacing said entered line of text with said 0o00 00 00 line of text or said original word which was determined by Ssaid determining step, without the necessity of depressing a special function key.
7. 12. A text input method as in claim 11, wherein said method comprises the steps of: identifying plural lines of text with the same stem of word which includes said entered line of text, and determining said unique line of text which has the same last character as the last entered character, among said identified plural lines of text, at the time of entering characters, without being actuated by the depression of a special function key; identifying plural lines of text with the same 28 stem of word which includes said entered line of text, and determining said unique line of text which includes the same one as the last entered character in the remaining part of said line of text other than that was successfully collated between said entered line of text and those in said dictionary, among said identified plural lines of text, at the time of entering characters, without being actuated by the depression of a special function key; replacing said entered line of text with said line of text or said original word which was determined by S said identifying and determining step, without the necessity of depressing a special function key. .goo.:
8. 13. A text input system as in claim 12, wherein said o00 method comprises the steps of: identifying plural lines of text with the same first part which includes said entered line of text, and determining said unique line of text which has the same last character as the last entered character, among said identified plural lines of text, without being actuated by the depression of a special function key, at the time of entering characters to follow, and identifying plural lines of text with the same first part which includes said entered line of text, and determining said unique line of text which includes the same one as the last entered character in the remaining part other than that was successfully collated between said entered line of text and those in said dictionary, among said identified plural lines of text, without being actuated by the depression of a special function key, at the time of character input.
9. 14. A text input method as in claim 11, wherein said 6 o6 method comprises the steps of: 0*09 oooo 9. 99 entering a line of text consisting of a first Scharacter followed by some other following characters, S" character by character; determining a unique line of text in said 666o99 dictionary which contains said entered first character and some other following characters of entered line of text at the time of character input, without a further special key depression. A text input method as in claim 11, wherein said method comprises: storing a plurality of lines of text and relevant words for said line of text in a dictionary; determining a unique line of text stored with plural number of said relevant words for said line of text in said dictionary, and selecting a unique word among said relevant words which includes said entered line of text in the part other than that was already collated with said entered line of text, at the time of next following character input, without a further special key depression; replacing said entered line of text with what was determined and selected by said determining and selecting steps, without the necessity of depressing a special function key. S
10. 16. A text input method as in claim 11, wherein said S. method comprises: :entering a line of text of handwriting strokes; storing a plurality of lines of text of handwriting strokes and original words, in a dictionary; determining a unique line of text of handwriting strokes in said dictionary which includes said entered line of text of handwriting strokes, at the time of entering the handwriting stroke, without a further special key depression; replacing said entered line of text of handwriting strokes with said unique line of text or said original word what was determined by said determining step, without the necessity of depressing a special function key.
11. 17. A text input method as in claim 16, wherein said method comprises: identifying plural lines of text of handwriting strokes with the same first part which includes said entered line of text of handwriting strokes, and determining a unique line of text of handwriting strokes which has the same last stroke as the last entered stroke, among said identified plural lines of text of handwriting strokes, without being actuated by the depression of a 0o0. special function key, at the time of entering strokes to follow, and identifying plural lines of text of handwriting strokes with the same first part which includes said o• 0 entered line of text of handwriting strokes, and rgQ determining a unique line of text of handwriting strokes V. which includes the same one as the last entered stroke in V• the remaining part other than that was successfully collated between said entered line of text of handwriting strokes and those in said dictionary, among said identified plural lines of text of handwriting strokes, without being actuated by the depression of a special function key, at the time of entering the handwriting stroke; replacing said entered line of text of handwriting strokes with said unique line of text or said original word which was determined by said identifying and determining step, without the necessity of depressing a special function key.
12. 18. A text input method as in claim 16, wherein said method comprises the steps of: entering a line of text consisting of a first stroke and some other following strokes of handwriting strokes, stroke by stroke; .determining a unique line of text of handwriting *4*4 strokes in said dictionary which contains said entered 4 first stroke and some other following strokes of line of text of handwriting strokes, at the time of entering the 4* handwriting stroke, without a further special key 444* depression. 00 4
13. 19. A text input method as in claim 11 or 16, wherein said determining step comprises determining a predetermined number range of lines of text in said dictionary. A text input method as in claim 11 or 16, wherein said storing step comprises storing said lines of text in said dictionary which is organized in a random access manner.
14. 21. A text input system substantially as hereinbefore described with reference to, and as illustrated by, the accompanying drawings.
15. 22. A text input method substantially as hereinbefore described with reference to the accompanying drawings. Dated this Twenty-third day of October 1998. 9. :MITSUHIRO AIDA By his Patent Attorneys FISHER ADAMS KELLY 9 ABSTRACT A data is input, character by cha a r @0 0e 6 0@ *0 S. 0 6 66 0 SSOS S el em inpu a di inpu data lead and uniq last end end data ly i to b (o r of ata) the ary te s he d art othe the to b to and e twe dic que ch ara o f yst ing if tio be fol tem uni un ome to ona re aracter str cter or wor orm a line em looks up the line o there is a nary, f indin unique, (2) lowing data of word an que, the ique, the other foll be unique, ry. What was placed with oke or d patt of dat in f data uni qu g t the fi to be d the first first owing respec deter the d t d art, ern a tive- mined ata input and requ i r e s no more input.