CA2124986A1 - Text input method - Google Patents
Text input methodInfo
- Publication number
- CA2124986A1 CA2124986A1 CA002124986A CA2124986A CA2124986A1 CA 2124986 A1 CA2124986 A1 CA 2124986A1 CA 002124986 A CA002124986 A CA 002124986A CA 2124986 A CA2124986 A CA 2124986A CA 2124986 A1 CA2124986 A1 CA 2124986A1
- Authority
- CA
- Canada
- Prior art keywords
- word
- input
- unique
- dictionary
- text
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
- G06F3/02—Input arrangements using manually operated switches, e.g. using keyboards or dials
Landscapes
- Engineering & Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Machine Translation (AREA)
Abstract
A text to input and display, character by character, is looked up in a dic-tionary to find a unique line of text to represent a unique word with the same leading part as the text input.
If successful, the remainder of word data to input is supplemented from the dictionary.
If successful, the remainder of word data to input is supplemented from the dictionary.
Description
(2) 212~986 SPECIFICATION
This invention relates to a text input method for an electronic data and word processing system, and personal information system including a handwritten character recognition function.
The conventional system of text input has a way of using an abbreviation of word being frequently used as well as a shorhand that assigns a single character to a longer line of text or commands,to lower the burden of the text input. However.it is inconvenient in that such way should get a person remember each of the abbreviation and shorthand and the expectation for higher input performa n ce depe n ds on each perso n' s mnemonics.
The present invention was made to improve the above-mentioned defect of co n v entional systems,providing an efficie n t way to use it without particular skills.
I have found that such defect may be improved by the way to supplement the remainder of word data input if the dictionary has a unique word data with the same leading part as the word data to input.
98(~ C3) The present invention has a dictionary to find a unique word in comparison with word data input, character by character, and automatically supplements the remaining part of word data to input from the dictionary if the dictionary has the unique one with the same leading part as the word data in the inpu t bu f f er.
In drawings which illustrate embodiments of the invention.Figure 1 to 9 are flow-charts for the example method of the the presen t i nvention and Figure 10 to 12 show examples of the dictionary to use by the invention method.
In the flowchart,A001 is the first step to clear the contents of the program counter,flag,and the working area.
A002 accepts a word data from input means, character by character.
A003 checks if the input is the end of text code, and goes to the stop point of this process i f i t is the end.
Otherwise,the step proceeds to the next A003A.
A003A tests if the none flag is ON
which means that there is no word in the dictionary with the same leading part as the word data input.
And if ON,the step goes to NONE FLAG
procedure which is not described here.
If OFF,the step proceeds to A003B.
A003B tests if the in pu t is a word - 2124~6 (4) separator code. If it is the separator, A003C takes place to clear the contents of input buffer because of the termina-tion of the word input and then the step goes back to A002 for the next word input.
A004 arises if the input is not sepa-rator code at A003B and the input data is displayed at the end of text on the display.
A005 is the step to add the input data to the end of previous text in the input buffer memory.
A006 performs a dictionary search to know if the word data input is the same as the leading part of some line of text to represent unique word in the dictionary.
A006A tests the result of the dictionary search at A006.
In case of negative result,A006B takes place to turn on the none flag and goes back to A002. Affirmative result brings the process to the next A007.
A007 confirms if A006 found a single one by testing the flag for the unique word. If not.the step goes back to A002.
Otherwise, A008 takes place in which the input text on the display is repla-ced with those of the unique word from the dictionary and contents of the input buffer is cleared. Then jumps to the step of A002.
S001 is an entry of the subprogram to search the unique line of text to represent the unique word in the dicti-nary. S002 is to test if there is no more word to retrieve in the dictionary.
If not so,the process goes to the next S003. Otherwise,it goes to the 21~4~86 ( exit of this subprogram.
S003 gets the word located in the middle of the area between upper limit and lower limit in the dictionary.
Next S004 checks if the leading part of the word from dictionary is greater than that of word data input.
If the greater flag is ON at S004,S005 gets up to divide the retrieval area size into 2 to use the lower half area for the next retrieval,as there is a possibility to find the unique word in the lower half area,because the dictio-nary word found at S003 was greater than the word data input. Then.the step goes back to S002. If the greater than flag is OFF at S004.the step proceeds to S006.
At S006.it is tested if the leading part of the word data from the dictio-nary is equal to that of the word data input.
If equal,S007 is performed to investi-gate if it is single.
In case of a single word.next step S008 turns on the flag for the unique word in the dictionary and goes to exit.
If there are plural words,the step goes to S012.
If not equal at S006.the step proceeds to S009 in which the testing is made if the leading part of the word data from the dictionary is less than that of the word data input.
If the less than flag is ON after testing at S009,S010 divides the retrie-val area size into 2 to use the upper half area for the next retrieval,as there is a possibility to find the unique word in the upper half area because the dictionary word found at 2124~6 (6) S003 was less than that o fwo rd data input.
If the less than fl ag is OFF at S009.there is something wrong with the procedure in the program and goes to the error procedure o fSOll which is not described here.
Jumping here from S007.S012 tries to find the word with the leading part greater than that o f the word data input in the upper hal fof the retrieval area in the dictionary.
At the next S013.the step goes to S014if no word was found. and goes to S015 if found.
S014 sets new upper limit to ret r ieve in the dictionary using the position of the upper limit by which S012 was attempted because the upper half area in this case is occupied by the word data with the leading part equal to that of the word data input. Then,the step goes to S016.
S015 sets new upper limit to retrieve in the dictionary using the position of the word found at the step of S012.
S016 tries to fi nd the word with the leading part less than that o f the word data input in the lower hal f area of the dictionary.
S017 tests i f the word was fou nd.
S018 takes place i f not found at S017 and sets new lower limit using the position of the lower limit by which S016 was attempted because the lower area is occupied by the word data with the leading part equal to that of the word data input. Then.the step goes to the exit o f this subprogram.
S019 arises i ffou nd at S017 and sets 2124986 (1) new lower limit to retrieve using the position of the word with the leading part less than that of the word data input and jumps to the exit of this subprogram.
As a subset of a dictionary search for the word data input consisting of a first character and some other charac-ters,T001 which i s equivalent to the aforementioned SOOl.is an entry of this subprogram.
T002 which is equivalent to the afore-mentioned S002 checks if there is still more word to retrieve in the dictionary.
If there is no more word,the step goes to the exit. The process advances to the next T002A.if there are some more words to retrieve.
T002A branches to the aforementioned S003 i f the input is the f irst one o f the word data input,and to the next T002B i f it was not first.
T002B is to check if all words between upper and lower limit in the dictio-nary have the same leading part as that of the word data input.
T002C selects the words with the lead-ing part which is not same as that o f the word data input.
T002D shifts one character to the left fo t every words selected at T002C and extract those words if terminated after making a character shift.
T002E sets new upper and lower limit to retrieve in the dictionary after extracing words terminated at T002D.
Then.the step goes to the aforementioned S003.
This invention relates to a text input method for an electronic data and word processing system, and personal information system including a handwritten character recognition function.
The conventional system of text input has a way of using an abbreviation of word being frequently used as well as a shorhand that assigns a single character to a longer line of text or commands,to lower the burden of the text input. However.it is inconvenient in that such way should get a person remember each of the abbreviation and shorthand and the expectation for higher input performa n ce depe n ds on each perso n' s mnemonics.
The present invention was made to improve the above-mentioned defect of co n v entional systems,providing an efficie n t way to use it without particular skills.
I have found that such defect may be improved by the way to supplement the remainder of word data input if the dictionary has a unique word data with the same leading part as the word data to input.
98(~ C3) The present invention has a dictionary to find a unique word in comparison with word data input, character by character, and automatically supplements the remaining part of word data to input from the dictionary if the dictionary has the unique one with the same leading part as the word data in the inpu t bu f f er.
In drawings which illustrate embodiments of the invention.Figure 1 to 9 are flow-charts for the example method of the the presen t i nvention and Figure 10 to 12 show examples of the dictionary to use by the invention method.
In the flowchart,A001 is the first step to clear the contents of the program counter,flag,and the working area.
A002 accepts a word data from input means, character by character.
A003 checks if the input is the end of text code, and goes to the stop point of this process i f i t is the end.
Otherwise,the step proceeds to the next A003A.
A003A tests if the none flag is ON
which means that there is no word in the dictionary with the same leading part as the word data input.
And if ON,the step goes to NONE FLAG
procedure which is not described here.
If OFF,the step proceeds to A003B.
A003B tests if the in pu t is a word - 2124~6 (4) separator code. If it is the separator, A003C takes place to clear the contents of input buffer because of the termina-tion of the word input and then the step goes back to A002 for the next word input.
A004 arises if the input is not sepa-rator code at A003B and the input data is displayed at the end of text on the display.
A005 is the step to add the input data to the end of previous text in the input buffer memory.
A006 performs a dictionary search to know if the word data input is the same as the leading part of some line of text to represent unique word in the dictionary.
A006A tests the result of the dictionary search at A006.
In case of negative result,A006B takes place to turn on the none flag and goes back to A002. Affirmative result brings the process to the next A007.
A007 confirms if A006 found a single one by testing the flag for the unique word. If not.the step goes back to A002.
Otherwise, A008 takes place in which the input text on the display is repla-ced with those of the unique word from the dictionary and contents of the input buffer is cleared. Then jumps to the step of A002.
S001 is an entry of the subprogram to search the unique line of text to represent the unique word in the dicti-nary. S002 is to test if there is no more word to retrieve in the dictionary.
If not so,the process goes to the next S003. Otherwise,it goes to the 21~4~86 ( exit of this subprogram.
S003 gets the word located in the middle of the area between upper limit and lower limit in the dictionary.
Next S004 checks if the leading part of the word from dictionary is greater than that of word data input.
If the greater flag is ON at S004,S005 gets up to divide the retrieval area size into 2 to use the lower half area for the next retrieval,as there is a possibility to find the unique word in the lower half area,because the dictio-nary word found at S003 was greater than the word data input. Then.the step goes back to S002. If the greater than flag is OFF at S004.the step proceeds to S006.
At S006.it is tested if the leading part of the word data from the dictio-nary is equal to that of the word data input.
If equal,S007 is performed to investi-gate if it is single.
In case of a single word.next step S008 turns on the flag for the unique word in the dictionary and goes to exit.
If there are plural words,the step goes to S012.
If not equal at S006.the step proceeds to S009 in which the testing is made if the leading part of the word data from the dictionary is less than that of the word data input.
If the less than flag is ON after testing at S009,S010 divides the retrie-val area size into 2 to use the upper half area for the next retrieval,as there is a possibility to find the unique word in the upper half area because the dictionary word found at 2124~6 (6) S003 was less than that o fwo rd data input.
If the less than fl ag is OFF at S009.there is something wrong with the procedure in the program and goes to the error procedure o fSOll which is not described here.
Jumping here from S007.S012 tries to find the word with the leading part greater than that o f the word data input in the upper hal fof the retrieval area in the dictionary.
At the next S013.the step goes to S014if no word was found. and goes to S015 if found.
S014 sets new upper limit to ret r ieve in the dictionary using the position of the upper limit by which S012 was attempted because the upper half area in this case is occupied by the word data with the leading part equal to that of the word data input. Then,the step goes to S016.
S015 sets new upper limit to retrieve in the dictionary using the position of the word found at the step of S012.
S016 tries to fi nd the word with the leading part less than that o f the word data input in the lower hal f area of the dictionary.
S017 tests i f the word was fou nd.
S018 takes place i f not found at S017 and sets new lower limit using the position of the lower limit by which S016 was attempted because the lower area is occupied by the word data with the leading part equal to that of the word data input. Then.the step goes to the exit o f this subprogram.
S019 arises i ffou nd at S017 and sets 2124986 (1) new lower limit to retrieve using the position of the word with the leading part less than that of the word data input and jumps to the exit of this subprogram.
As a subset of a dictionary search for the word data input consisting of a first character and some other charac-ters,T001 which i s equivalent to the aforementioned SOOl.is an entry of this subprogram.
T002 which is equivalent to the afore-mentioned S002 checks if there is still more word to retrieve in the dictionary.
If there is no more word,the step goes to the exit. The process advances to the next T002A.if there are some more words to retrieve.
T002A branches to the aforementioned S003 i f the input is the f irst one o f the word data input,and to the next T002B i f it was not first.
T002B is to check if all words between upper and lower limit in the dictio-nary have the same leading part as that of the word data input.
T002C selects the words with the lead-ing part which is not same as that o f the word data input.
T002D shifts one character to the left fo t every words selected at T002C and extract those words if terminated after making a character shift.
T002E sets new upper and lower limit to retrieve in the dictionary after extracing words terminated at T002D.
Then.the step goes to the aforementioned S003.
Claims (7)
1. A text input method comprising;
input means for inputting a plurality of word data;
dictionary means for storing a plurality of a line of text to represent a unique word in the said dictionary, original word data for the said line of text and relevant word data for the said original word data;
means for determining the said unique line of text to represent the said unique word with the same leading part as the said word data from said input means, in the dictionary:
means for selecting a desired word among the said relevant words in case of that the said unique word has the said relevant words in the dictionary;
output means for outputting the said unique word represented by the said line of text which was determined by the said means for determining, and outputting the said unique word selected by the said means for selec-ting;
means for controlling all the said means.
input means for inputting a plurality of word data;
dictionary means for storing a plurality of a line of text to represent a unique word in the said dictionary, original word data for the said line of text and relevant word data for the said original word data;
means for determining the said unique line of text to represent the said unique word with the same leading part as the said word data from said input means, in the dictionary:
means for selecting a desired word among the said relevant words in case of that the said unique word has the said relevant words in the dictionary;
output means for outputting the said unique word represented by the said line of text which was determined by the said means for determining, and outputting the said unique word selected by the said means for selec-ting;
means for controlling all the said means.
2. A text input method omprising;
input means for inputting a plurality of word data;
dictionary means for storing a plurality of a line of text to represent a unique word in said dictionary and an original (9) word data;
means for determining said unique line of text to represent said unique word with the same leading part as said word data to input from said input means, in said dictionary;
output means for outputting said original word data represented by said unique line of text which was determined by said means for determining said unique line of text;
means for controlling all said means.
input means for inputting a plurality of word data;
dictionary means for storing a plurality of a line of text to represent a unique word in said dictionary and an original (9) word data;
means for determining said unique line of text to represent said unique word with the same leading part as said word data to input from said input means, in said dictionary;
output means for outputting said original word data represented by said unique line of text which was determined by said means for determining said unique line of text;
means for controlling all said means.
3. The method of claim 2, wherein said input means comprises inputting a plurality of a first character followed by other characters of said word data to input from said input means.
4. The method of claim 3, wherein said means for determining said unique line of text comprises determining said unique line of text to represent said unique word containing the first character followed by other characters of said word data to input from said input means, in said dictionary.
5. A text input method comprising;
input means for inputting a plurality of word data;
dictionary means for storing a plurality of an original word data;
means for determining a unique original word with the same leading part as said word data to input from said input means.
in said dictionary;
output means for outputting said original word data which was determined (10) by said means for determining said unique original word:
means for controlling all the said means.
input means for inputting a plurality of word data;
dictionary means for storing a plurality of an original word data;
means for determining a unique original word with the same leading part as said word data to input from said input means.
in said dictionary;
output means for outputting said original word data which was determined (10) by said means for determining said unique original word:
means for controlling all the said means.
6. The method of claim 5, wherein said input means comprises inputting a plurality of a first character followed by other characters of said word data to input from said input means.
7. The method of claim 6, wherein said means for determing said unique original word comprises determining said unique original word containing the first character followed by other characters of said word data to input from said input means, in said dictionary.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CA002124986A CA2124986A1 (en) | 1994-06-16 | 1994-06-16 | Text input method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CA002124986A CA2124986A1 (en) | 1994-06-16 | 1994-06-16 | Text input method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2124986A1 true CA2124986A1 (en) | 1995-12-17 |
Family
ID=4153721
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002124986A Abandoned CA2124986A1 (en) | 1994-06-16 | 1994-06-16 | Text input method |
Country Status (1)
| Country | Link |
|---|---|
| CA (1) | CA2124986A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106598937A (en) * | 2015-10-16 | 2017-04-26 | 阿里巴巴集团控股有限公司 | Language recognition method and device for text and electronic equipment |
-
1994
- 1994-06-16 CA CA002124986A patent/CA2124986A1/en not_active Abandoned
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106598937A (en) * | 2015-10-16 | 2017-04-26 | 阿里巴巴集团控股有限公司 | Language recognition method and device for text and electronic equipment |
| CN106598937B (en) * | 2015-10-16 | 2019-10-18 | 阿里巴巴集团控股有限公司 | Language Identification, device and electronic equipment for text |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4302326B2 (en) | Automatic classification of text | |
| EP1361522B1 (en) | A system for automatically annotating training data for a natural language understanding system | |
| US4580241A (en) | Graphic word spelling correction using automated dictionary comparisons with phonetic skeletons | |
| US5999896A (en) | Method and system for identifying and resolving commonly confused words in a natural language parser | |
| US5970448A (en) | Historical database storing relationships of successively spoken words | |
| EP0807306B1 (en) | Speech recognition system and method with automatic syntax generation | |
| JP5474933B2 (en) | A system for teaching writing based on the user's past writing | |
| US7937263B2 (en) | System and method for tokenization of text using classifier models | |
| JP4833313B2 (en) | Chinese dialect judgment program | |
| JPH0418346B2 (en) | ||
| US20090012789A1 (en) | Method and process for performing category-based analysis, evaluation, and prescriptive practice creation upon stenographically written and voice-written text files | |
| US7164367B2 (en) | Component-based, adaptive stroke-order system | |
| WO1999014689A1 (en) | System and method for creating a language grammar | |
| EP1687739A2 (en) | Text segmentation and label assignment with user interaction by means of topic specific language models and topic-specific label statistics | |
| JP5231698B2 (en) | How to predict how to read Japanese ideograms | |
| US4730269A (en) | Method and apparatus for generating word skeletons utilizing alpha set replacement and omission | |
| EP0643357A2 (en) | Text input method | |
| EP0717364A2 (en) | Method for expecting correction information in a natural language processing system | |
| CA2124986A1 (en) | Text input method | |
| JPH05189476A (en) | Method for changing form of word and data processing device for executing method thereof | |
| GB2282685A (en) | Text input method | |
| EP1282853A1 (en) | Apparatus and method for inputting alphabet characters on keypad | |
| CA2136656C (en) | Hand writing text input system | |
| JP4025821B2 (en) | Text input device | |
| JPS6068425A (en) | Kana/kanji converter having learning function |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| FZDE | Dead |