WO1998059302A1 - Procede et dispositif de traitement de donnees destine a la saisie d'une sequence de donnes, ainsi que procede d'acces a une memoire et memoire associee - Google Patents

Procede et dispositif de traitement de donnees destine a la saisie d'une sequence de donnes, ainsi que procede d'acces a une memoire et memoire associee Download PDF

Info

Publication number
WO1998059302A1
WO1998059302A1 PCT/DE1998/001754 DE9801754W WO9859302A1 WO 1998059302 A1 WO1998059302 A1 WO 1998059302A1 DE 9801754 W DE9801754 W DE 9801754W WO 9859302 A1 WO9859302 A1 WO 9859302A1
Authority
WO
WIPO (PCT)
Prior art keywords
memory
input
word
sequence
input section
Prior art date
Application number
PCT/DE1998/001754
Other languages
German (de)
English (en)
Inventor
Frank Karl
Original Assignee
Frank Karl
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Frank Karl filed Critical Frank Karl
Priority to AU85334/98A priority Critical patent/AU8533498A/en
Publication of WO1998059302A1 publication Critical patent/WO1998059302A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/903—Querying
    • G06F16/90335—Query processing
    • G06F16/90344—Query processing by using string matching techniques
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/20—Natural language analysis
    • G06F40/274—Converting codes to words; Guess-ahead of partial word inputs

Definitions

  • the invention relates to a method for operating a data processing system, in which a data input unit generates an input sequence from data words with a predetermined number of bit positions. Different characters are displayed on a display unit depending on the value of the data words. At least one predefined value characterizes separating data words which subdivide the input sequence into input sections. Several of these input sections are stored in a memory. In addition, depending on the new data words generated since the last separation data word, an input section belonging to the new data words is read at least once during the generation of the input sequence and is automatically appended or inserted at the end of the input sequence.
  • a disadvantage of the known method is that only four letters per word have to be entered until a word can be clearly selected from the memory, which is then inserted completely or partially into the input sequence.
  • the known method as indicated, for example, on page 69 of the book mentioned, can be perceived by some operators to be rather confusing than helpful, so that it is recommended that these persons switch off the "auto-complete" method. As confusing is felt especially when the automatically inserted letters are not confirmed and therefore have to be removed.
  • the invention is based on the knowledge that there are input sequences in which the probability that an input section repeats decreases with the number of data words entered since the input section was entered. In other words: there is a high probability that an input section repeats itself after the input of a few data words. If the input units e.g. generated when entering a text, words that already occurred when another font was entered do not appear as often in the current font as words that have already been entered in the current font. Words that occur in a paragraph of the current font that has already been entered do not appear as often in the paragraph that is currently entered as words that have already been entered in the paragraph that is currently entered. The same applies to different sentences.
  • the input section or a part of the input section which was last accessed is therefore read from the memory from a plurality of input sections which belong to the new data words entered since the last separation data word.
  • Access means reading the memory only if no input sections are written to the memory during the method. However, if additional entries are saved in the memory during the procedure, the saving is also an access.
  • the time of the last access to the input sections is taken into account in addition to the sequence of letters within the input sections.
  • This alphabetical and chronological procedure allows you to automatically insert a word residue after entering the first letter or, in the case of an abbreviation, an entire word that is highly likely to be confirmed.
  • the probability of wrong decisions also decreases disproportionately if two or even three letters have to be selected, taking into account the last access, if the suggestion made after entering the first letter or the first two letters of the currently entered word is not confirmed has been and had to be removed.
  • the disproportionate decrease in the probability of wrong decisions includes to be attributed to the fact that with increasing number of letters of a word already entered there are fewer associated input sections.
  • the number of data words entered between the associated input sections increases, so that the number of wrong decisions is reduced due to the above-mentioned temporal relationships.
  • the memory is only searched when the first new data word has a specific value from a predetermined value set.
  • the memory takes several process steps to be accessed only for selected inputs, and the implementation of the method is accelerated. This is important for a method that is carried out, so to speak, in real time for the input of the input sequence, because otherwise there may be delays in the input.
  • This measure can also increase the likelihood of the entries being confirmed. For example, only when entering nouns in start the German language with a capital letter, made a proposal by the method according to the invention, so very high confirmation rates can be achieved. When entering a program text in a programming language in which the program commands begin with uppercase letters, almost all automatically inserted insertions are confirmed.
  • the method according to the invention is further accelerated if the memory is searched only if the number of data words entered after the input of the last separation data word does not exceed a predetermined number. E.g. If only a maximum of two suggestions are inserted per word, the memory no longer has to be searched after entering the third letter.
  • the copying processes for inserting the proposal and removing them in the absence of confirmation are also eliminated. This measure is also advantageous because, in the case of two or three unsuccessful suggestions within one word, the relationships explained above obviously do not apply.
  • the input section is checked whether the input section is already stored in the memory. If this is not the case, the input section is automatically added to the memory.
  • the automatic entry of input sections takes place immediately after the first use of the relevant input sections. Without this measure, the entry is usually made manually and only after the input section, e.g. a word that has already been entered several times.
  • the second time the entry section is entered e.g. with a keyboard, keystrokes can be saved.
  • This Memory has the advantage that it "forgets" input sections that have not been accessed for a long time, that is, automatically deletes them. This is advantageous, for example, for words that have been stored in the wrong spelling in the memory or if input sequences for new subject areas, ie also with a changing vocabulary, are entered.
  • the method according to the invention with a short-term memory is very powerful in terms of the confirmation rate with a small memory requirement. Good results can be achieved with a memory for fifty or a hundred input units. Such a small memory can also be searched very quickly.
  • the method according to the invention can be used advantageously if input sections are repeated in the input sequence, e.g. is the case when entering legal or technical texts.
  • the method according to the invention is also advantageously used in word processing programs for inputting programs in programming languages such as C, C ++, Java, etc., since there are only a predetermined number of upper and / or lower case keywords in the respective programming language, depending on which entered program still a relatively limited number of recurring variable names.
  • the time sequence of the accesses can advantageously be taken into account if the input sections form an input section sequence in which the input sections are arranged depending on the last access time.
  • certain groups of input sections e.g. all input sections beginning with the letter "A" can be contained in different input section sequences. Since the individual input section sequences do not contain as many input sections, the time for searching is shortened.
  • the invention also relates to a data processing system for carrying out the method according to the invention or its further educations.
  • the technical effects mentioned also apply to the data processing system.
  • the known access methods are used to realize the access to the memory, such as associative memory, linked data lists or hash search methods.
  • the invention relates to a method for accessing a storage unit and this storage unit itself.
  • This access method and the storage unit are used in particular when executing the inventive method for entering the input sequence.
  • the special feature of the access method according to the invention and the memory unit according to the invention is that, in addition to the known assignment, e.g. via an address or, as in the case of an associative memory, via the content of the memory cells, the chronological order of access to the memory words is also taken into account.
  • several memory words can belong to one input word.
  • one is selected in the memory unit according to the invention in the case of a plurality of memory words which belong to an input word and is output completely or only partially.
  • the selection is preferably made within the memory unit, so that essentially only the input word has to be entered from the outside and the output word has to be read.
  • An access unit such as a processor, is therefore no longer required than in conventional memory accesses.
  • the time selection takes place, for example, according to the LIFO principle (last in first out) or according to the FIFO principle (first in first out). In the first case, one of the memory words belonging to the input word is selected which has not been accessed for the longest time.
  • the memory word that was last accessed is selected from the associated memory words.
  • the storage unit according to the invention already allows an output word to be output when the input word has only been partially defined and entered into the memory.
  • the access time when reading a memory word is reduced in cases in which a suitable output word is already read out, although the input word has not yet been completely entered.
  • An example of an application for the storage unit and the access method is, for example, the input of a sequence of letters in which, depending on the part of the word already entered, a new word or a remainder of the word is proposed, which is confirmed or rejected by an operator.
  • Associative memories are commercially available memory modules which are also referred to as "content addressable memory". Depending on the input word, a memory word is determined which contains the input word. Then either the entire determined memory word or only a part of it is output.
  • FIG. 1 essential electronic functional units for entering an input sequence
  • FIGS. 3A and 3B show a flow diagram with method steps which are carried out when the input sequence is input.
  • FIG. 1 shows essential electronic functional units for entering an input sequence with a commercially available keyboard 10.
  • FIG. 1 shows five keys 12 to 20 of the keyboard keys, which are connected to a keyboard controller 22 contained in the keyboard 10 via connecting lines 24 to 30.
  • the key 16 is used, for example, when entering the letters "a” and "A", in the latter case the key 12 must also be pressed.
  • the keyboard 10 is connected via a multi-core line 34 to a computer 40 which, among other things. includes a processor 42 and memory 44.
  • the processor 42 processes the commands of a word processing program 46 stored in the memory 44, a text being entered into an input file using the keyboard 10.
  • the processor 42 is controlled by the method steps stored as an instruction sequence in the memory 44 as an instruction sequence.
  • the memory 44 also contains a short-term memory 48, in which input sections of an input sequence entered with the keyboard 10 are stored.
  • the word processing program is e.g. the well-known program "WinWord" or "Word 97", which can be expanded with the associated macro programming language by the macro blocks explained below.
  • a letter macro is processed, of which letter macros 50, 52 and 54 are shown in FIG. 1, which in this order belong to the letters "a", "b" and "Z".
  • the letter macro 50, 52, 54 belonging to the just actuated key 12 to 20 transfers the ASCII code (American Standard Code II) of the entered character to a main macro 56 and then starts the execution of the main macro 56 explained below with reference to FIGS. 3A and 3B.
  • the computer 40 is connected via a connecting line 58 to a screen 60 on which the letters entered are displayed.
  • the current end of the input sequence is shown on the Screen 60 is displayed by a cursor 62. It can be seen on the screen 60 shown in FIG. 1 that the letter "A” has already been entered.
  • the word extension "bsatz” has then been inserted automatically and can be confirmed by the operator by entering a "7". Details of these operations are explained below.
  • FIG. 2 shows an auxiliary file 100 which is used when the input sequence is input into the input file.
  • the lines of the auxiliary file 100 are labeled ZI to Z6.
  • line ZI the ASCII data word of the key just pressed is transferred to the main macro 56, compare FIG. 1.
  • FIG. 3 the key "7" was just pressed so that the transferred data word has the value "55” according to the ASCII code . This value leads to the display of the "7" when the auxiliary file 100 is displayed on the display unit 60 (see FIG. 1).
  • the word "paragraph” was determined in line Z5 of the short-term memory 48 and the word residue "bsatz", which had not yet been entered, was automatically added to the current end of the input sequence in the input file.
  • the appended word residue is stored in line Z4 of the auxiliary file 100 for further processing.
  • the value of a variable IMWORD is stored which is the current one Has value one. The value one indicates that a noun is currently being entered, ie for a German text a word that begins with an uppercase letter. If no noun is currently entered, the variable IMWORT has the value zero.
  • the auxiliary file 100 also contains a movable text mark TM, which is moved within the short-term memory 48 in order to avoid identical suggestions during the input of a word.
  • FIGS. 3A and 3B show a flowchart with method steps which are processed by the processor 42 when executing the instructions of the main macro 56, compare FIG. 1.
  • the method begins in a step 150 in which the variable IMWORT is assigned the value stored in line Z3 of the auxiliary file 100.
  • the currently entered data word, ie the currently entered letter or character, from line ZI of the auxiliary file 100 is stored in a variable b $.
  • the previously entered data words of the currently entered word stored in line Z2 of the auxiliary file 100 are assigned to a variable w $.
  • the appended word remainder stored in line Z4 is assigned to a variable r $.
  • Step 150 is always carried out immediately after a letter macro 50 to 54 has been processed, see FIG. 1.
  • step 152 it is checked whether the currently entered data word, ie the variable b $, has a value which identifies separating data words. Separation data words are generated when entering a space, a comma or a period. If it is determined in step 152 that the current data word b $ is not a separating data word, a step 154 follows in which it is checked whether the variable IMWORT is zero. This can only be the case if the first letter of a word has just been entered.
  • Step 156 it is checked based on the data word b $ whether the first letter is an uppercase letter and thus a noun is currently to be entered. If the data word b $ belongs to an uppercase letter, the variable IMWORT is set to the value one in a step 158. Step 156 is omitted in another exemplary embodiment, in which suggestions can be generated when all the words entered are entered, so that, for example, repetitive verbs or nouns written in lower case, for example, are processed in the same way as in the exemplary embodiment in FIGS. 3A and 3B is the case for nouns capitalized in German.
  • step 160 follows immediately after step 156 and the variable IMWORT remains at the value zero.
  • step 160 the processing in the input file is continued. The execution of the main macro 56, compare FIG. 1, is thus ended for the currently entered letter, since a second part shown in FIG. 3B is only processed if the variable IMWORD has the value one.
  • step 154 If, on the other hand, it is already determined in step 154 that the variable IMWORT has the value one, this means that a noun is currently being processed. The procedure in this case immediately continued with the second part shown in Figure 3B.
  • step 162 follows immediately after method step 152.
  • step 162 it is checked whether the variable IMWORD has the value zero. If this is the case, no noun is currently being processed and step 164 follows, in which the input file is returned to. The second part shown in FIG. 3B is then not carried out.
  • step 166 follows immediately after step 162. Step 166 is only carried out if the processing of a noun has ended with the current input. In step 166, the variable IMWORT is set to the value zero to mark the completion of the entry of the noun. A step 168 then follows.
  • step 168 the bookmark TM, cf. Figure 2, placed at the beginning of the short-term memory 48, i.e. to the beginning of line Z5 of the auxiliary file 100. This is necessary because the bookmark TM is displaced during the process in order to avoid repetitive suggestions in the case of several suggestions per word.
  • the short-term memory 48 is searched for the noun stored in the variable w $, i.e. after the last word entered.
  • the short-term memory 48 is always searched during the search to the end of the file of the auxiliary file 100, i.e. towards the right end of line Z6.
  • step 172 It is then checked in a step 172 whether the noun contained in the variable w $ has been found. If this word was not found, step 174 follows immediately after step 172, in which the current processing position is set to the bookmark TM in the auxiliary file 100, which, as already mentioned, was placed in step 168 at the beginning of the short-term memory 48. At this point, the noun stored in the variable w $ is inserted, ie written into the short-term memory 48.
  • step 176 the processing position in the auxiliary file 100 is moved to the end of the auxiliary file 100.
  • step 180 the word stored at the end of the auxiliary file 100 and thus also at the end of the temporary memory 100 is deleted, compare step 178.
  • the entry of this word was a long time ago, so that it is relatively unlikely that this word will be used again soon is entered.
  • the number of words stored in the short-term memory 48 remains constant if a word which has already been stored is deleted for each new word inserted into the short-term memory 48.
  • step 180 the word stored in the variable w $ is deleted.
  • the variable r $ only contains a suggestion if such a suggestion was made while entering the last noun entered.
  • step 172 If, on the other hand, it is determined in step 172 that the last entered noun has been found when searching the short-term memory 48, this noun is removed from the short-term memory 48 in step 182, the words in the short-term memory 48 adjacent to the noun to be removed closing the gap that arises. This is due to the fact that the data words of the auxiliary file 100 are managed in a manner similar to a so-called linked list.
  • step 184 and 185 the removed noun, which is also contained in the variable w $, is inserted again at the beginning of the short-term memory 48.
  • the number of in Short-term memory 48 words thus remains unchanged here.
  • step 186 as in step 180, the noun stored in the variable w $ and the remainder of the word possibly stored in the variable r $ are deleted.
  • step 164 already explained, in which the input of the input sequence in the input file is continued.
  • the short-term memory 48 stores the last words entered in line Z5 and the first words entered in line Z6. The last words entered are to the left of a line. So the word “Berlin” was entered before the word "bus", see Figure 2. The entry of the word "car” is furthest back.
  • the words in the short-term memory 48 thus form a sequence in which the position of the respective word is determined by the access time at which this word was last accessed. If you access the access times on a timeline, the order of the times corresponds to the order of the words belonging to the times in the sequence.
  • the short-term memory 48 is searched line by line from top to bottom.
  • the search within the lines is from left to right.
  • a search order is thus defined in the short-term memory 48.
  • This search sequence takes into account the chronological order of access in the case of several words which contain the letter sequence sought, starting from the text mark TM. From the words stored between the bookmark TM and the end of the short-term memory 48 with the searched letter sequence, the word that was last accessed is found.
  • a second part of the method shown in FIG. 3B is only processed if it is determined in a step 190 that the variable IMWORT has the value one and thus a noun is currently being entered. Otherwise, editing the last entered letter ended in a step 192 explained below.
  • step 194 follows, in which it is checked whether the currently entered character is a "7", i.e. see FIG. 1 to determine whether the key 20 was pressed.
  • a “7” is generally never entered when the letters of a noun are entered correctly, so that the “7” that is easy to enter on the keyboard 10 when entering the input sequence was selected as the confirmation character , which indicates that a previous proposal has been accepted.
  • a step 196 follows immediately after step 194.
  • step 196 the proposal stored in the variable r $ is added to the letter sequence of the noun currently entered in the variable w $.
  • the variable w $ thus contains all previously entered or confirmed letters of the noun just entered, so that the current input status is always stored in the variable w $ when the noun currently entered is edited further.
  • step 198 a return is made to the input file and any "7" that may have already been inserted into the input sequence is removed, since it was obviously only entered as confirmation, step 200. Then in a step 202 the current input position is added to the end of the one already inserted Proposal. An operator can now either continue entering the noun to be currently entered or end the input of this noun with a separating data word.
  • step 194 If, on the other hand, it is determined in step 194 that no "7" has been entered, it can be assumed that either no proposal has been made or that an already inserted proposal has not been confirmed. In both cases, a step 204 follows immediately after step 194, in which it is checked whether the currently entered noun already has more than two letters Has. This query makes it possible to suppress suggestions after the second letter, so that a maximum of two suggestions are made for each noun entered. The suppression takes place in that the current processing position in the auxiliary file 100 is set at the end thereof, and thus no word can be found when searching the short-term memory 48 starting at the current processing position, step 206.
  • the processing position in the auxiliary file 100 is set in step 208 to the position at which the bookmark TM is currently located.
  • the bookmark TM is located at the beginning of the short-term memory 48, where it has been moved to after the last noun has been entered, cf. Step 168.
  • the bookmark TM is located at a different location, if it has already been moved during the input of the currently entered noun, compare step 216 explained below.
  • the number of suggestions per noun entered is not limited. In this case, steps 204 to 208 are omitted and step 210 immediately follows step 210 if no "7" has currently been entered.
  • Step 206 is followed, like step 208, by step 210, in which the noun part previously stored in the variable w $ is supplemented by the currently entered letter, which is stored in the variable b $.
  • step 212 the short-term memory 48 is searched from the current position of the bookmark TM for a stored word which contains the letter sequence stored in the variable w $.
  • the search starts from the current position of the bookmark TM if step 208 has been carried out immediately before step 210. Otherwise it will be a positive one Search result suppressed by starting the search at the end of the short-term memory 48.
  • step 214 it is checked whether the search was successful. If so, i.e. If a word was found in the short-term memory 48, the processing is continued in step 216.
  • step 216 the bookmark TM is placed behind the found word in the short-term memory in the search direction, so that this word cannot be found again in the next search when further letters of the currently entered noun are entered. This measure prevents the same suggestion from being made twice while entering a noun.
  • step 218 follows.
  • step 218 it is checked whether the word found in the short-term memory 48 contains other letters in addition to the letters contained in the variable w $. If this is not the case, i.e. if the word found is identical to the sequence of letters stored in the variable w $, no new suggestion can currently be made, and the processing is continued in step 220. In an alternative exemplary embodiment, however, instead of step 220 and the steps following this step, step 212 is returned, and the short-term memory is searched again in order to eventually find another word which, in addition to the letters contained in the variable w $, contains further words Contains letters, see arrow 221.
  • step 220 the variable r $ is used to check whether an old suggestion was inserted into the input sequence when the method steps shown in FIGS. 3A and 3B were last processed. If this is the case, the letters in the variable r $ must be removed, since the old proposal has obviously not been accepted. These letters are deleted in step 222. The input file is then returned in step 224. In step 226, the old proposal, which is no longer valid, is removed from the input sequence. After that The processing of the last letter entered is ended in step 192.
  • step 228 follows immediately after step 220, in which a return is made to the input file. The processing of the letter currently entered is then ended in step 192.
  • step 230 follows immediately after step 218.
  • the variable r $ is used to check whether an old suggestion is contained in the input file which was obviously not accepted, since otherwise steps 194 to 202 would have been branched to in step 194. If an old suggestion is present, the letter sequence of the old suggestion in the variable r $ is overwritten by the letter or the letter sequence by which the word found in the short-term memory 48 differs from the content of the variable w $, i.e. through the new proposal, compare step 232.
  • step 234 the input file is returned and the old proposal is overwritten with the new proposal stored in the variable r $, step 236.
  • the processing of the letter currently entered is then ended in step 192.
  • step 238 follows immediately after step 230, in which the new proposal is stored in the variable r $.
  • the input file is then activated in step 240 and the new proposal is inserted at the current input position, step 242.
  • step 192 in which, as already mentioned, the processing of the letter currently entered is ended.
  • step 220 ′ follows the step 214 immediately after step 214 220 corresponds, but was shown again for reasons of clarity.
  • Steps 222 ', 224', 226 'and 228' following step 220 ' also correspond in this order to steps 222, 224, 226 and 228 already explained above.
  • step 192 the current values of the variables w $, r $ and IMWORT are stored in the auxiliary file 100 so that they can be used when processing the next letter or character entered.
  • FIGS. 3A and 3B The method shown in FIGS. 3A and 3B is carried out when the input sequence is input for each input letter and for selected or all input characters.
  • the entered letters and characters are processed immediately after entry, similar to what is known as real-time processing. This is the only way to insert or remove suggestions in the input sequence without delay if they are not confirmed.
  • the procedure for automatically generating suggestions when entering an input sequence can also be carried out without macros.
  • the method steps explained with reference to FIGS. 3A and 3B are contained in the instruction sequence of the word processing program 46.
  • the auxiliary file 100 is in this If a memory area is used in the computer 40 according to FIG. 1. Switching between auxiliary file 100 and input file is then also omitted, since the task of auxiliary file 100 is carried out by the memory area.
  • the auxiliary file 100 is not a so-called document that can be edited like the input file, but a storage file in the memory 44 of the computer 40 or on its hard disk memory.
  • corrections made are also taken into account when entering a noun. This results in the possibility of accepting changes in the short-term memory 48 after confirming a proposal, e.g. if the ending of the proposed noun is changed.
  • a table is used for administration.
  • the words retain their position within the sequence of their memory cells in memory 44 and 48, respectively, so that copying operations are eliminated.
  • the table contains the address values of the memory cells in which the words are stored as well as the position of the words within the sequence assigned to these address values. Using the table are preferably both assigned certain addresses to positions in the sequence as well as vice versa to determined positions in the sequence addresses in the memory.
  • Access to the memory 44 can be simplified by using a table called a mirror table. While the table for consecutive memory addresses stores the positions that are generally not consecutive within the sequence, the mirror addresses for consecutive positions within the sequence store the memory addresses that are generally also not consecutive.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computational Linguistics (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Health & Medical Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • General Health & Medical Sciences (AREA)
  • Document Processing Apparatus (AREA)

Abstract

Procédé permettant d'exploiter un dispositif de traitement de données, selon lequel est utilisée une mémoire transitoire (48). Lors de la lecture de la mémoire transitoire (48), l'ordre temporel de l'accès aux mots mis en mémoire est également pris en considération, en plus du contenu desdits mots mis en mémoire.
PCT/DE1998/001754 1997-06-23 1998-06-23 Procede et dispositif de traitement de donnees destine a la saisie d'une sequence de donnes, ainsi que procede d'acces a une memoire et memoire associee WO1998059302A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU85334/98A AU8533498A (en) 1997-06-23 1998-06-23 Method and data processing device for inputting an input sequence and method foraccessing a storage unit and corresponding storage unit

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE19726569A DE19726569C1 (de) 1997-06-23 1997-06-23 Verfahren zum Zugriff auf eine Speichereinheit und Datenverarbeitungsanlage zum Eingeben einer Eingabefolge sowie zugehörige Speichereinheit
DE19726569.3 1997-06-23

Publications (1)

Publication Number Publication Date
WO1998059302A1 true WO1998059302A1 (fr) 1998-12-30

Family

ID=7833355

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/DE1998/001754 WO1998059302A1 (fr) 1997-06-23 1998-06-23 Procede et dispositif de traitement de donnees destine a la saisie d'une sequence de donnes, ainsi que procede d'acces a une memoire et memoire associee

Country Status (3)

Country Link
AU (1) AU8533498A (fr)
DE (1) DE19726569C1 (fr)
WO (1) WO1998059302A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4744050A (en) * 1984-06-26 1988-05-10 Hitachi, Ltd. Method for automatically registering frequently used phrases
DE4124024A1 (de) * 1990-07-19 1992-03-12 Reime Reinhold Verfahren zum verarbeiten von tastatureingaben in einem rechner, einer schreibmaschine oder dergleichen
GB2289561A (en) * 1994-05-16 1995-11-22 Mitsuhiro Aida Text input system
WO1997046951A1 (fr) * 1996-06-04 1997-12-11 Lennerstad Idé Dispositif de traitement de texte

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4744050A (en) * 1984-06-26 1988-05-10 Hitachi, Ltd. Method for automatically registering frequently used phrases
DE4124024A1 (de) * 1990-07-19 1992-03-12 Reime Reinhold Verfahren zum verarbeiten von tastatureingaben in einem rechner, einer schreibmaschine oder dergleichen
GB2289561A (en) * 1994-05-16 1995-11-22 Mitsuhiro Aida Text input system
WO1997046951A1 (fr) * 1996-06-04 1997-12-11 Lennerstad Idé Dispositif de traitement de texte

Also Published As

Publication number Publication date
AU8533498A (en) 1999-01-04
DE19726569C1 (de) 1998-11-19

Similar Documents

Publication Publication Date Title
DE68928231T2 (de) Verfahren und Vorrichtung zur Maschinenübersetzung
DE69031319T2 (de) Übersetzungssystem von mehreren Sprachen
DE2756352C3 (de) Schaltungsanordnung zum Aussuchen und Sortieren von Daten in gleichartig aufgebauten Sätzen
DE69031491T2 (de) Hypertextdatenverarbeitungssystem und Verfahren
DE69726339T2 (de) Verfahren und Apparat zur Sprachübersetzung
DE2854837A1 (de) Uebersetzungsvorrichtung
DE19922974A1 (de) Verfahren und Vorrichtung zur Bearbeitung eines Dokuments
DE3115349A1 (de) "elektronisches uebersetzungsgeraet"
DE68922870T2 (de) Textverarbeitungseinrichtung für europäische Sprachen mit Rechtschreibungs-Korrekturfunktion.
DE4225200A1 (de) Elektronisches woerterbuch
DE2801610A1 (de) Verfahren zum definieren von anfangswerten fuer die textverarbeitung
DE19645128C2 (de) Verfahren zum Verwalten von Dokumenten sowie Gerätetreiber zur Durchführung des Verfahrens
DE69909360T2 (de) Verfahren und System um Dokumente über eine elektronische Datei wiederaufzufinden
EP1079307B1 (fr) Procédé de fonctionnement d'un système de mémoire ainsi que système de mémoire
DE19849855C1 (de) Verfahren zur automatischen Generierung einer textlichen Äußerung aus einer Bedeutungsrepräsentation durch ein Computersystem
EP1412875B1 (fr) Procede de traitement de texte dans un ordinateur et ordinateur
DE19726569C1 (de) Verfahren zum Zugriff auf eine Speichereinheit und Datenverarbeitungsanlage zum Eingeben einer Eingabefolge sowie zugehörige Speichereinheit
DE19624988A1 (de) Verfahren zur automatischen Erkennung eines gesprochenen Textes
DE29711267U1 (de) Datenverarbeitungsanlage zum Eingeben einer Eingabefolge und zugehörige Speichereinheit
DE3511920A1 (de) Elektronischer ratgeber
DE3714514A1 (de) Vorrichtung und verfahren zur textverarbeitung
WO2014139649A1 (fr) Système associé à un véhicule comprenant un dispositif de saisie alphanumérique avec bouton d'effacement et/ou bouton de sélection dans une liste
DE4311211C2 (de) Computersystem und Verfahren zur automatisierten Analyse eines Textes
EP1429254B1 (fr) Traitement d'interruptions dans un noeud CAN
DE19804603A1 (de) Verfahren zum Ermitteln von Wörtern in einem Sprachsignal

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AU CA JP US

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
NENP Non-entry into the national phase

Ref country code: JP

Ref document number: 1999503591

Format of ref document f/p: F

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: CA