CA2076464C - Language identification system and method for a peripheral unit - Google Patents
Language identification system and method for a peripheral unitInfo
- Publication number
- CA2076464C CA2076464C CA002076464A CA2076464A CA2076464C CA 2076464 C CA2076464 C CA 2076464C CA 002076464 A CA002076464 A CA 002076464A CA 2076464 A CA2076464 A CA 2076464A CA 2076464 C CA2076464 C CA 2076464C
- Authority
- CA
- Canada
- Prior art keywords
- language
- value
- tally
- key
- skew
- 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.)
- Expired - Fee Related
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K15/00—Arrangements for producing a permanent visual presentation of the output data, e.g. computer output printers
-
- 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/12—Digital output to print unit, e.g. line printer, chain printer
- G06F3/1201—Dedicated interfaces to print systems
- G06F3/1202—Dedicated interfaces to print systems specifically adapted to achieve a particular effect
- G06F3/1203—Improving or facilitating administration, e.g. print management
- G06F3/1206—Improving or facilitating administration, e.g. print management resulting in increased flexibility in input data format or job format or job type
-
- 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/12—Digital output to print unit, e.g. line printer, chain printer
- G06F3/1201—Dedicated interfaces to print systems
- G06F3/1223—Dedicated interfaces to print systems specifically adapted to use a particular technique
- G06F3/1237—Print job management
- G06F3/1244—Job translation or job parsing, e.g. page banding
- G06F3/1248—Job translation or job parsing, e.g. page banding by printer language recognition, e.g. PDL, PCL, PDF
-
- 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/12—Digital output to print unit, e.g. line printer, chain printer
- G06F3/1201—Dedicated interfaces to print systems
- G06F3/1278—Dedicated interfaces to print systems specifically adapted to adopt a particular infrastructure
- G06F3/1285—Remote printer device, e.g. being remote from client or server
- G06F3/1286—Remote printer device, e.g. being remote from client or server via local network
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/20—Natural language analysis
- G06F40/263—Language identification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/20—Natural language analysis
- G06F40/279—Recognition of textual entities
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K2215/00—Arrangements for producing a permanent visual presentation of the output data
- G06K2215/0002—Handling the output data
- G06K2215/0005—Accepting output data; Preparing data for the controlling system
- G06K2215/0014—Transforming the printer input data into internal codes
Abstract
A data processing system is responsive to a plurality of input languages, each language adhering to a prescribed syntax. The presence of defined portions ("For" keys) in the incoming data indicate a vote for the presence of a language and the presence of other defined portions ("Against" keys) indicate a vote Against the presence of the language. The system performs the following method for identifying the input language: analyzing, for each expected language, the syntax of an incoming block of data to identify For and Against keys in the block of data; providing For and Against tallies for each expected language in response to the analysis, each tally being a summation of key entries, each key entry comprising an identified key count multiplied by a skew, a skew value indicating the importance of the key in the syntax and in the context of said block of data, the For tally summing entries of For keys and the Against tally summing entries of Against keys; comparing the For and Against tallies to determine whether or not they are so close as to signal uncertainty; and, based upon a further syntactical characteristic of block of data, resolving the uncertainty and indicating a value based on one of the tallies: indicating a value derived from the larger of the tallies in the event of no uncertainty between the tallies; and deciding, based upon the indicated value for each expected language, the identity of a received language.
Description
19 1, 577 2076~64 LANGUAGE IDENTIFICATION SYSTEM AND METHOD
FOR A PERIPHERAL UNIT
FIELD OF THE INVENTION
s This invention relates to the identification of a received language in a data processing system, and more particularly, to a language identification system employing both syntax and context analysis.
BACKGROUND OF THE INVENTION
Modern data processing networks enable various types of computers to interconnect with a communication network. Peripheral units such as printers, plotters etc., are also connected to the communication network and serve as resources for the connected computers. Those peripherals must be able to understand and respond to commands received from the various computers. So long as all connected computers employ the same peripheral control language, a peripheral unit needs to recognize and respond to only one language. When, however, those computers employ different peripheral control languages, the peripheral unit must be able to recognize an incoming language's identity and to respond to commands in the identified language.
191,577 2 ~ertain peripheral control languages employ initial identification code sequences that identify the language. So long as the various computers attached to the network comply with the language's syntactical encoding requirements, language recognition can occur. However, there is no assurance that such code sequences are invariably enabled on all computers that might possibly connect to a network. A manufacturer of a peripheral unit must anticipate that eventuality, or the eventuality that a particular initial identification code sequence might appear in a data stream of another language, causing an erroneous language switch by the peripheral.
Recently, sophisticated peripheral units employ "context switching" systems wherein the context of a received block of code is analyzed to enable identification of the language to be used with a downloaded job. One such context switcher is the QMS ESP, a product of QMS International, One Magnum Pass, Mobile, Alabama 36618. While the details of the QMS ESP product have not been published, its operation can be implied from an external analysis.
2s The ESP product appears to search for particular strings, symbols and control characters (hereinafter collectively referred to as keys) that are representative of a particular control language.
Certain key words enjoy particular importance as being representative of a particular language. In addition, the number of occurrences of a key are glven slgnlflcance.
Based upon statistics accumulated from an initial code sequence, ESP renders a determination of the incoming language. Under certain circumstances, it has been found that ESP does not provide a language identification. It is surmised that such periodic language selection errors occur due to the occurrence of certain keys in more than one language and to the fact that a non-contextual analysis of an incoming data stream will, over a period of time, result in erroneous language indications.
Accordingly, it is an object of an aspect of this invention to provide an improved language identification system for a peripheral unit.
It is an object of an aspect of this invention to provide a language identification system which employs both contextual and syntactical analyses of an incoming data stream.
It is an object of an aspect of this invention to provide a language identification system which is expandable to support future languages.
SUMMARY OF THE INVENTION
A data processing system is responsive to a plurality of input languages, each language adhering to a prescribed syntax. The presence of defined portions ("For" keys) in the incoming data indicate a vote for the presence of a language and the presence of other defined portions ("Against" keys) indicate a vote Against the presence of the .. i.
191,577 4 207646~
language. The system performs the following method for identifying the input language: analyzing, for each expected language, the syntax of an incoming block of data to identify For and Against keys in the block of data; providing For and Against tallies for each expected language in response to the analysis, each tally being a summation of key entries, each key entry comprising an identified key count multiplied by a skew, a skew value indicating lQ the importance of the key in the syntax and in the context of said block of data, the For tally sums entries of For keys and the Against tally sums entries of Against keys; comparing the For and Against tallies to determine whether or not they are so close as to signal uncertainty; and, based upon a further syntactical characteristic of the block of data, resolving the uncertainty and indicating a value based on one of the tallies: or indicating a value derived from the larger of the tallies in the event of no uncertainty between the tallies; and deciding, based upon the indicated value for each expect~d language, the identity of a received language.
Other aspects of this invention are as follows:
~ , ,i i ~[
4a 2076461 In a data processing system responsive to a plurality of input languages, each language adhering to a prescribed syntax, the presence of defined data portions ("For" keys) in incoming data indicating a 5 vote for the presence of a language and the presence of other defined data portions (nAgainst" keys) indicating a vote Against the presence of the language, a method for identifying an input language comprising the steps of:
a) analyzing, for each expected language, the syntax of an incoming block of data to identify For and Against keys in said block of data:
b) providing For and Against tallies for each expected language in response to said analysis, each said tally being a summation of key entries, each key entry comprising an identified key count multiplied by a skew, the value of said skew indicating an importance of said key in said syntax and in the context of said block of data, said For tally summing entries of For keys and said Against tally summing entries of Against keys;
c) comparing said For and Against tallies to determine whether or not they are so close . ~
207646~
4b as to signal uncertainty and, based upon a further syntactical characteristic of said block of data, resolving said uncertainty and indicating a value based on one of said tallies, said indication dependent upon whether said further syntactical characteristic indicates For or Against the language;
d) indicating a value derived from the larger of the tallies in the event of no uncertainty between the tallies; and e) deciding, based upon said indicated value for each said expected language, the identity of a received language.
A data processing system including software, said system responsive to a plurality of input languages, each language adhering to a prescribed syntax wherein defined data portions ("For" keys) in incoming data indicate a vote for the presence of a language and the presence of other defined data portions ("Against" keys) indicate a vote Against the presence of the language, said system including a voter means for each language and a decider means, each said voter means comprising:
syntax means for analyzing, for an expected language, the syntax of an incoming block of data to identify For and Against keys in the block of data;
4c 207~464 tally means for providing For and Against tallies for said language in response to said analysis, each said ta~lly being a summation of key entries, each key entry comprising an identified key count multiplied by a skew, the value of said skew indicating an importance of said key in said syntax and in the context of said block of data, said For tally summing entries of For keys and said Against tally summing entries of Against keys;
first means for comparing said For and Against tallies to determine whether or not they are so close as to signal uncertainty, and, based upon a further syntactical characteristic of said block of data, resolving said uncertainty and indicating a first value based on one of said tallies; and 2^ means for indicating said first value or a second value to said decider means, said second value derived from the larger of the tallies in the event of no uncertainty between the tallies.
DESCRIPTION OF THE DRAWINGS
Fig. 1 is a block diagram of a system that embodies the language identification procedure of the invention;
Fig. 2 is a listing of subroutines in a voter module within the language identification procedure shown in Fig. l;
~, 207646~
191,577 5 Fig. 3 is a syntactical definition of PCL, a printer control language;
Fig. 4 is a syntactical definition of PostScript, a printer control language;
Fig. 5a illustrates a weight table for keys in the PostScript language.
Fig. sb illustrates a weight table for keys in the PCL language.
Fig. 6 is a context table for the PostScript language;
Fig. 7 is a context table for the PCL language;
Figs. 8-11 illustrate a high level flow diagram of the language identification procedure performed by the system of Fig. 1;
DETAILED DESCRIPTION OF THE INVENTION
Referring to Fig. 1, personal computers 10, 12 and 14 are interconnected via a local area network (LAN) 16. A printer 18 is also connected to LAN 16 and provides print services for each of personal computers 10, 12 and 14. Hereafter, the invention will be described in the context of printer 18, however, it is to be understood that other data processing systems that perform services for connected computers can also utilize the same 191,577 6 invention. Examples of such other peripheral units are plotters, facsimile units, etc.
Computers attached to LAN 16 can employ different printer control languages. To illustrate the invention, it will be assumed that PC 10 employs the printer language known as PCL (printer control language), PC 12 employs the printer language PostScript, and PC 14 employs some other printer control language. The invention enables printer 18 to automatically analyze the context of an incoming command/data stream from any of the PCs 10, 12 and/or 14; to identify the language being received;
and to then proceed to carry out print commands in accordance therewith.
Printer 18 includes a central processing unit 20, an input/output (I/O) module 22 and a random access memory module 24, each interconnected via a bus 26 to a print engine 28. A portion of RAM 24 is broken out as shown at 30 and includes that portion of RAM
24 that is utilized for the language identification procedure. Contained therein is a storage area 32 for storing a block of data received from one of PC's 10, 12 or 14. Storage area 32 is preferably large enough to hold a 256 byte block of data. Such a block size has been found sufficient to enable identification of an incoming language without unduly expanding the required processing time.
The language identification procedure includes a plurality of voter modules 34, 36 and 38, each of which is specifically assigned to analysis of an 191,577 7 ~076~61 expected printer language. For instance, voter module 34 is assigned to analyze the PCL language, voter 36 to analyze the PostScript language, etc. A
decider module 40 receives outputs from each of voter modules 34, 36, and 38 and decides, based upon those voter module inputs, the most likely identity of the received language. Decider 40 then instructs CPU 20 to access the syntactical decoding software that will enable it to interpret and execute the decided-upon language. By having the decider and voter functions embodied in different modules, additional languages can be easily accommodated by the addition of a voter module for each new language.
Turning to Fig. 2, a representative voter module and its main components are shown. Subroutine 42 is a syntax analyzer that is provided with definitions of the voter's assigned language structure and includes both rules and descriptive statements. Through the use of these definitions, syntax analyzer 42 is enabled to parse an incoming data block and to identify portions which are particularly relevant to a determination of the identity of the data block's language. Those relevant portions will be hereinafter referred to as keys. There are both positive and negative keys, with positive keys, if present, indicating For the language, and negative keys, if present, indicating Against the language.
Each voter include a plurality of key counters, one key counter for each type (category) of key. Each voter module further includes a weight table 48 that 191,577 8 2 0 764 6~
assigns a weight value to each key as its count is registered. Weight values inserted into weight table 48 will be either positive or negative, depending upon whether the identified key is indicative of the presence of the language or is indicative of an unknown character or other group of characters that are not allowed by the language of syntax. The assigned weight values are summed into a vote value register 46 which maintains a running lo sum whose value is equal to the summation of the positive and negative weight keys that have been detected in the incoming data stream.
A context table 50 is employed to assign to each detected key a different value (a "skew") that is dependent upon the key and its context in the received data block. Context table 50 includes, for each key type, an initial skew value, which is either multiplied or divided (as the case may be) by a skew modifier to result in a skew value that is dependent upon the context of the key in the data block. The skew values (both plus and minus) are then inputted into a pair of vote tally registers 52 which respectively accumulate positive and negative skew values. Thus, a "For" tally register accumulates all positive skew values resulting from the aforesaid computations while an "Against" tally register accumulates negative skew values.
Turning now to Figs. 3 and 4, syntaxes for both PCL
and PostScript are shown in a logical diagram form.
Each logical diagram is embodied as logical statements within the respective syntax analyzer 191,577 9 ~07646~
subroutine 42 in the voter module assigned to scan for the particular language. Thus, voter module 34 (Fig. 1) will have logical statements that embody the syntax shown in Fig. 3. The diagram of Fig. 3 can be analyzed as follows. The PCL syntax requires that a print job be preceded by a defined sequence of ASCII character known as an Escape (has a binary numerical value equal to 27). After an Escape sequence is determined, the syntax analyzer proceeds lo to analyze the next byte in the data flow, and if its binary value is between 48 and 126, the analysis awaits the arrival of the next Escape sequence (not shown). If, after an Escape sequence is detected, the binary value of the next byte is between 33 and 47, the program determines whether succeeding data is a string-number (Str Num) or is a character having a binary value between 96 and 126. A
string-number is defined in the PCL syntax as being one of a plurality of alternative characters, each one of which is classified as a string-number (see logic diagram labeled Str Num). After the syntax analyzer determines the presence of a string-number, it proceeds to determine whether the next character value is between 64 and 94 and if so, data following is skipped. Next the procedure returns to scanning for an Escape se~uence, etc. The final leg of the logic diagram arises if the character has a value between 96 and 126, at which point a string-number determination is again made, etc.
An example will aid in an understanding of the PCL
syntax chart of Fig. 3. Assume that an array of characters with the following values are received:
191,577 10 2076~6~
27, 33 and 96. When the PCL syntax analyzer 42 see a character having a binary value 27, it immediately recognizes it as an ASCII Escape character. Since the next character value is 33, the syntax analyzer increments to box A in Fig. 3, obtains a positive answer and proceeds to an analysis of the next character. Since the next character has a value of 96, it does not match the syntax of a string-number (block B), but does match the condition shown in logic block C. The procedure continues with the PCL
syntax analyzer continuing to identify portions of the incoming data stream that find definitions within the PCL syntax listing.
In Fig. 4, a logic chart is shown for PostScript, with the analyses proceeding along vertical line D
only if a horizontal logical block condition is not fulfilled. Thus, if the Syntax Analyzer that is resident in Voter module 36 does not see a % in the input data stream, it immediately proceeds to determine whether a "<" indicator is present and, if not, an "(", etc. In this manner, syntax analyzer 42 in the PostScript voter module proceeds to analyze for PostScript keys.
Turning now to Figs. 5a and 5b, weight tables are shown for both the PostScript and PCL languages, and indicate keys that are employed in the language analysis procedure. Turning first to Fig. 5a, the PostScript key types are reserved words, syntax errors, documentation keys, special keys, unknown words and reserved punctuation. A reserved word is one which is defined in the language's syntax as 191,577 11 being unavailable for uses, other than that specified by the syntax. A syntax error is an organization of characters which does not meet the syntactical requirements of the language. A
documentation format command is a command that is a routing command for a document, or one which defines its format. A special character sequence is one which is defined by the syntax as being specific to the language. Reserved punctuation is similarly lo defined by the syntax as having specific meaning within the syntax. Finally, unknown words, are just that - words which are not recognized by the syntax.
As shown in the right hand column of Fig. 5a, each key type is assigned a weight, with some weights being positive and others being negative. The negative weights are votes against the language and the positive values are votes for the language.
Note that key types which give rise to negative weights are not considered as significant as key types with assigned positive weights. This is due to the fact that the positive weight keys are more indicative of the presence of a language than the negative weight keys are of the absence of a language. The specific weight values indicated in Fig. 5a are empirically derived and are based upon an estimate of the importance of the key type to an identification of the language.
In Fig. 5b, key types are illustrated for the PCL
language. The Escape character has been described above. Short sequences and complete sequences are defined sequences of characters defined by the PCL
191,577 12 2~7646~
syntax as being special to PCL. Combined sequences are repeated complete sequences. Illegal sequences are sequences of characters that are not recognized by the PCL syntax as being part of the PCL language.
An illegal sequence is equivalent to a syntax error in PostScript. Here again, the values on the right hand side of the chart of Fig. 5b are weight values with the positive values voting "for" the PCL
language and negative value voting "against".
Returning to Fig. 2, it is there noted that each voter module is provided with key type counters 44.
Thus, as can be seen from Fig. Sa, the PostScript voter module 36 will contain 6 key type counters, one for each listed key type. Similarly, as shown in Fig. 5b, the PCL voter module 36 will contain 5 key type counters that maintain a count of the number of each type of key determined from an analysis of an incoming data block. Additionally, zO each voter module includes a voter value register 46. In each voter module, a vote value register 46 is incremented by the value of the weight assigned to a key type, each time a particular key type is found by syntax analyzer 42. Thus, vote value register 46 indicates a sum that is the cumulative value of the negative and positive weights of all keys found in an incoming block of data.
In Figs. 6 and 7, context tables are shown for both the PostScript and PCL languages that enable keys derived from a data block to be differently weighted (i.e. "skewed") in accordance with the context of 191,577 13 2076464 the data block. "Skew" values are then entered in For and Against vote tally registers 52 in each voter module. Each context table includes a key type column that is identical to key type listing found in the weight tables for PostScript and PCL.
The "skew direction" column indicates whether the contextual skew that is to be applied to the key type is initially at a maximum and then decreases (ceiling), or is at a minimum and thereafter lo increases (growing). A "growing" skew direction indicates that successive occurrences of a key type in a data block represent a growing assurance that a data block is configured in the respective language.
Conversely, a "ceiling" skew is indicative that the first occurrence of a particular key type is the most important, with subsequent occurrences being of less importance.
The next column of each context chart indicates "initial skew" values assigned to each key type upon its initial occurrence in a data block. These are empirically defined values whose relative sizes indicate the importance of a specific key's initial appearance in a data block to the identification of the language. For explanatory purposes, the values are shown in Arabic numbers, while in actual implementations they will be configured in a hexidecimal notation. The "skew modification"
column indicates how initial skew values are to be modified upon subsequent appearances of a key type after its initial appearance. For instance, a first documentation format command key is assigned a value of 40, whereas the second occurrence of a 191,577 14 207646~
documentation command format key is assigned a value of 10, (40/4), the third occurrence a value of 2.5, (10/4), etc. Similarly, a special punctuation key is initially assigned a value of 2.79xlO 7, which value is multiplied by 4 upon the second occurrence of a special punctuation key. The resulting product is multiplied by 4 upon the third occurrence of special punctuation key type, etc.
In Fig. 7, a context table for the PCL language is shown. Here it is to be noted that the key types short sequence, complete sequence, and combined sequences, are all subjected to the same initial skew value and skew modification upon subsequent occurrences.
As above indicated, each voter module contains both Four And Against vote tally registers 52. The signed values calculated through the use of the context tables are inserted into the For and Against Vote tally registers, with the positive values summed into the For register and the negative values summed into the Against register. Each vote tally register thus manifests a sum that is indicative of the number of key types, in context, within a received data block. The For vote tally register sum indicates the skewed weights of all keys that indicate the presence of a particular language. The Against vote tally register indicates the sum of a skewed weights of keys whose presence suggest that block being analyzed does not use the particular language handled by the respective voter module.
191,577 15 2076~6~
Turning now to Figs. 8-11, the language identification procedure will be described, in conjunction with the tables shown in Figs. 5a, 5b, 6 and 7. The procedure commences when a new block of data is received(box 100). While the data block can be of any size, it is preferably chosen to be of a size that enables a reasonable sample of incoming data to be included, while not being too long so as to delay the print function. Preferably, the size lo of the received block is approximately 256 bytes.
As above indicated, there is a separate voter module provided for each expected language, and in this case it will be assumed that PCL and PostScript are the expected languages. Each voter module operates in parallel and upon the received block input. As shown in Fig. 8, a voter module's syntax analyzer 42 initially identifies keys as they are sequentially found in the data block input (box 102). Those keys are then identified by type (box 104) and corresponding key type counters are incremented by one each time a new key type is determined (box 106). Similarly, each time a key is found, a signed weight is added to the voting value, the weight Z5 value being found from a weight table (box 108).
For instance, if a PostScript voter module determines the presence of a syntax error, it causes -50 to be added to vote value register 46 (Fig. 2).
Similarly, if a special character sequence is determined, a +80 is added to the voter module vote value register 46.
191,577 16 In this manner, a voter module maintains a single running cumulative sum whose value is indicative of weighted votes for and against the language for which the voting module is scanning. The vote value register sum does not, however, take into account the context (i.e. the relationship of the keys) in which the keys appear in the data block. Thus, the accumulated voting value is insufficient to assure consistently accurate language selection.
Within the syntax analyzer, the procedure continues by determining (box 110) if the last key in the data block has been found. If not, the procedure cycles back to the beginning and repeats itself. If the last key has been identified from the incoming data block, the procedure determines whether the value in the voting value register 46 is greater than or less than 0 (decision box 111). If the voting value is greater than or equal to 0, such fact is indicated as output 112 and if it is less than 0, that fact is manifest as output 113.
Concurrent with the syntax analysis described in Fig. 8, each voter module performs a context 2s analysis. The procedure for the context analysis is shown in Fig. 9 and commences with the establishment of For and Against tally registers (box 120). The procedure receives identified keys and key types as an input from box 104 in Fig. 8. For each identified key, the procedure determines whether the key is the initial key of that type identified in the data block. If yes, the procedure determines an initial skew value for the key type from the 191,577 17 207646~
associated context table (box 124). A PCL voter module employs the values shown in the context table of Fig. 7 and a PostScript voter module employs the values in the context table of Fig. 6.
If the initial skew value is determined to be negative (box 126), the voter module's Against tally is incremented by the initial skew value (box 126).
If, by contrast, the initial skew value is positive, the voter module's For tally register is incremented by the initial skew value (box 128).
Returning to decision box 122, if it is determined that the key input from box 104 is not the initial occurrence in the data block of a key of the specific key type, then the procedure increments to decision box 130 to determine whether the initial skew value for the determined key type is positive or negative. If it is positive, the last skew value that was input to the For tally is altered by combination with the skew modifier (box 132). For example, assuming a positive initial skew value, if the skew modifier indicates that the skew value is to be divided by four, the last skew value input to the For tally is divided by four. Similarly, if the skew modifier indicates a multiply action, then the last skew value input to the For tally is multiplied by the modifier value. Then, the modified skew value is OR'd into the For tally register to update its cumulative value. The OR function prevents the bit size of the cumulative value from growing (and essentially eliminates any carries from the sum).
Since both the For and Against tallies are handled 191,577 18 2076~6~
similarly, a subsequent comparison therebetween is not affected by the lack of the carry function.
Returning to decision box 120, if the initial skew value is found to have a negative value, then the last skew value that was input to the Against tally register is altered by the skew modifier. In the same manner as aforedescribed, if the function indicates a multiply, the last entered skew value is multiplied by the required constant and if a divide is called for, a conforming action takes place (box 136). The procedure then OR's the modified skew value into the Against tally register to update its value.
At this point, the procedure continues by determining whether the last key in the block has been identified (decision box 140), and if not, a further decision is made based upon whether either the For or Against tally indicates a greater than 98~ certainty value (decision box 142). This means that if the cumulative value of either the For or Against tally is greater than 98% of the largest value that the respective tally could ever obtain, then the procedure "short circuits" further analysis of keys, and the assumption is that a language has been presumptively identified.
If decision box 142 indicates a no, the procedure recycles to consider the next key. After the last key in the block has been handled (as determined by decision box 140), the procedure computes the difference between the For and Against tally 191,577 19 ~ 07 6~ 6g registers (box 144). That computed difference is then compared against a maximum expected difference value that could be expected between the tallies.
If the computed difference is less than 25~ (an empirical decision point) of the maximum expected difference value, it is assumed that the For and Against tallies are so close (i.e. "confused") as to not allow a definitive decision to be made, based solely upon the above described contextual analysis.
If the computed difference is 25% or greater than the maximum expected difference value between the tallies, then a "not confused" output results from decision box 146 and it is assumed that the larger tally value is presumptively accurate.
In Fig. lOa, the "not confused" indication from decision box 146 is followed by a determination (decision box 148) as to whether the For tally is greater than the Against tally. Depending on which zo tally is the greater, the larger tally is then "normalized". If a yes is indicated by decision box 148 (For tally > Against tally), a normalization procedure is performed (box 150) on the For tally to map its value into a range of from 0 to +127. The reason for this normalization action is that For and Against tallies in different voter modules will evidence different cumulative values that are dependent upon the characteristics of the language.
Thus, the cumulative values in the various voter modules may have little or no relationship to each other in terms of their absolute values. However, the individual For and Against tally values in each voter module will have a comparative meaning if they 191,577 20 2076464 are evidenced as a percentage (or equivalent number value) of a maximum value which could exist for the specific tally. Thus, assuming a For tally >
Against tally, the For tally is compared to the maximum value that that tally could obtain and a ratio is obtained. That ratio then determines the point within a prescribed numerical range of 0 to +127 into which the tally value is mapped.
In Figs. lOb and lOc, procedures are shown for handling a "confused" indication in voter modules assigned to detect PCL and PostScript, respectively.
The PostScript procedure is more complex than PCL
due to the greater complexity of the Post Script language.
In Fig. lOb, the procedure in a PCL voter module when a confused input is indicated by decision box 146 in Fig. 9. In response to the confused indication the accumulated vote value outputs from decision box 111 in Fig. 8 are examined (decision box 158). If it is found that the accumulated vote value is less than 0, (indicating that the cumulative value of the vote value register in the particular voting module shows a negative sum of accumulated weights), the normalized Against tally is returned to the decider (box 160). If the accumulated vote value is found to be greater than or equal to 0, the For tally (normalized) is returned to the decider (box 162).
In Fig. lOc, the procedure is shown in a PostScript voter module when a confused input is indicated by 191,577 21 207646~
decision box 146 in Fig. 9. In response, the procedure determines whether, in the syntax analysis of the incoming data block (Fig. 8), no syntax errors were found and that at least one special S character sequence has been detected (decision box 164). If syntax errors were found (i.e. a syntax error count not equal to 0), or no special character sequences were detected, the normalized Against tally is returned to the decider module (box 166).
If the AND condition indicated in decision box 164 is present, then the accumulated vote value outputs from decision box 111 in Fig. 8 are examined (decision box 168). If it is found that the accumulated vote value is less than 0, (indicating that the cumulative value of the vote value register in the particular voting module shows a negative sum of accumulated weights), the normalized Against tally is returned to the decider (box 166). If the accumulated vote value is found to be greater than o, the For tally (normalized) is returned to the decider (box 170).
Turning now to Fig. 11, the decider module stores a returned normalized tally from each voter module (box 172). As above described, each voter module will have returned a single number to the decider module that evidences either a value between 0 to +127 or -1 to -128, with the former value being votes for a language and the latter being votes against the language. As shown in decision box 174, if all voter module tallies returned to the decider module are negative, then a non-language indication is set (box 176). On the other hand, if all of the 191,577 22 tallies are not negative, then the largest positive tally is selected as being the incoming language tbox 178).
In summary, the procedure employs three separate and simultaneous accumulations of analytical data to decide upon a language's identification. Those indications include a count of both positive and negative key weights for each voter module assigned lo to a particular language; a weighted sum in each voter module that indicates whether the keys found in the incoming data block cumulatively indicate a positive or negative vote For or Against the language; and For and Against tallies that incorporate a contextual analysis based upon the importance of the keys to the language and therefore provide a parallel and independent language vote.
The combination of these votes, as indicated in the flow diagrams of Figs. 8-11, provides a high level of confidence in the ultimate language selection.
Furthermore, the arrangement of the decision process into a separate decider module, with a separate voting module for each language, enables the system to be modified to accommodate additional languages that are not contemplated at the outset.
It should be understood that the foregoing description is only illustrative of the invention.
Various alternatives and modifications can be devised by those skilled in the art without departing from the invention. Accordingly, the present invention is intended to embrace all such 191,577 23 207646i alternatives, modifications and variances which fall within the scope of the appended claims.
FOR A PERIPHERAL UNIT
FIELD OF THE INVENTION
s This invention relates to the identification of a received language in a data processing system, and more particularly, to a language identification system employing both syntax and context analysis.
BACKGROUND OF THE INVENTION
Modern data processing networks enable various types of computers to interconnect with a communication network. Peripheral units such as printers, plotters etc., are also connected to the communication network and serve as resources for the connected computers. Those peripherals must be able to understand and respond to commands received from the various computers. So long as all connected computers employ the same peripheral control language, a peripheral unit needs to recognize and respond to only one language. When, however, those computers employ different peripheral control languages, the peripheral unit must be able to recognize an incoming language's identity and to respond to commands in the identified language.
191,577 2 ~ertain peripheral control languages employ initial identification code sequences that identify the language. So long as the various computers attached to the network comply with the language's syntactical encoding requirements, language recognition can occur. However, there is no assurance that such code sequences are invariably enabled on all computers that might possibly connect to a network. A manufacturer of a peripheral unit must anticipate that eventuality, or the eventuality that a particular initial identification code sequence might appear in a data stream of another language, causing an erroneous language switch by the peripheral.
Recently, sophisticated peripheral units employ "context switching" systems wherein the context of a received block of code is analyzed to enable identification of the language to be used with a downloaded job. One such context switcher is the QMS ESP, a product of QMS International, One Magnum Pass, Mobile, Alabama 36618. While the details of the QMS ESP product have not been published, its operation can be implied from an external analysis.
2s The ESP product appears to search for particular strings, symbols and control characters (hereinafter collectively referred to as keys) that are representative of a particular control language.
Certain key words enjoy particular importance as being representative of a particular language. In addition, the number of occurrences of a key are glven slgnlflcance.
Based upon statistics accumulated from an initial code sequence, ESP renders a determination of the incoming language. Under certain circumstances, it has been found that ESP does not provide a language identification. It is surmised that such periodic language selection errors occur due to the occurrence of certain keys in more than one language and to the fact that a non-contextual analysis of an incoming data stream will, over a period of time, result in erroneous language indications.
Accordingly, it is an object of an aspect of this invention to provide an improved language identification system for a peripheral unit.
It is an object of an aspect of this invention to provide a language identification system which employs both contextual and syntactical analyses of an incoming data stream.
It is an object of an aspect of this invention to provide a language identification system which is expandable to support future languages.
SUMMARY OF THE INVENTION
A data processing system is responsive to a plurality of input languages, each language adhering to a prescribed syntax. The presence of defined portions ("For" keys) in the incoming data indicate a vote for the presence of a language and the presence of other defined portions ("Against" keys) indicate a vote Against the presence of the .. i.
191,577 4 207646~
language. The system performs the following method for identifying the input language: analyzing, for each expected language, the syntax of an incoming block of data to identify For and Against keys in the block of data; providing For and Against tallies for each expected language in response to the analysis, each tally being a summation of key entries, each key entry comprising an identified key count multiplied by a skew, a skew value indicating lQ the importance of the key in the syntax and in the context of said block of data, the For tally sums entries of For keys and the Against tally sums entries of Against keys; comparing the For and Against tallies to determine whether or not they are so close as to signal uncertainty; and, based upon a further syntactical characteristic of the block of data, resolving the uncertainty and indicating a value based on one of the tallies: or indicating a value derived from the larger of the tallies in the event of no uncertainty between the tallies; and deciding, based upon the indicated value for each expect~d language, the identity of a received language.
Other aspects of this invention are as follows:
~ , ,i i ~[
4a 2076461 In a data processing system responsive to a plurality of input languages, each language adhering to a prescribed syntax, the presence of defined data portions ("For" keys) in incoming data indicating a 5 vote for the presence of a language and the presence of other defined data portions (nAgainst" keys) indicating a vote Against the presence of the language, a method for identifying an input language comprising the steps of:
a) analyzing, for each expected language, the syntax of an incoming block of data to identify For and Against keys in said block of data:
b) providing For and Against tallies for each expected language in response to said analysis, each said tally being a summation of key entries, each key entry comprising an identified key count multiplied by a skew, the value of said skew indicating an importance of said key in said syntax and in the context of said block of data, said For tally summing entries of For keys and said Against tally summing entries of Against keys;
c) comparing said For and Against tallies to determine whether or not they are so close . ~
207646~
4b as to signal uncertainty and, based upon a further syntactical characteristic of said block of data, resolving said uncertainty and indicating a value based on one of said tallies, said indication dependent upon whether said further syntactical characteristic indicates For or Against the language;
d) indicating a value derived from the larger of the tallies in the event of no uncertainty between the tallies; and e) deciding, based upon said indicated value for each said expected language, the identity of a received language.
A data processing system including software, said system responsive to a plurality of input languages, each language adhering to a prescribed syntax wherein defined data portions ("For" keys) in incoming data indicate a vote for the presence of a language and the presence of other defined data portions ("Against" keys) indicate a vote Against the presence of the language, said system including a voter means for each language and a decider means, each said voter means comprising:
syntax means for analyzing, for an expected language, the syntax of an incoming block of data to identify For and Against keys in the block of data;
4c 207~464 tally means for providing For and Against tallies for said language in response to said analysis, each said ta~lly being a summation of key entries, each key entry comprising an identified key count multiplied by a skew, the value of said skew indicating an importance of said key in said syntax and in the context of said block of data, said For tally summing entries of For keys and said Against tally summing entries of Against keys;
first means for comparing said For and Against tallies to determine whether or not they are so close as to signal uncertainty, and, based upon a further syntactical characteristic of said block of data, resolving said uncertainty and indicating a first value based on one of said tallies; and 2^ means for indicating said first value or a second value to said decider means, said second value derived from the larger of the tallies in the event of no uncertainty between the tallies.
DESCRIPTION OF THE DRAWINGS
Fig. 1 is a block diagram of a system that embodies the language identification procedure of the invention;
Fig. 2 is a listing of subroutines in a voter module within the language identification procedure shown in Fig. l;
~, 207646~
191,577 5 Fig. 3 is a syntactical definition of PCL, a printer control language;
Fig. 4 is a syntactical definition of PostScript, a printer control language;
Fig. 5a illustrates a weight table for keys in the PostScript language.
Fig. sb illustrates a weight table for keys in the PCL language.
Fig. 6 is a context table for the PostScript language;
Fig. 7 is a context table for the PCL language;
Figs. 8-11 illustrate a high level flow diagram of the language identification procedure performed by the system of Fig. 1;
DETAILED DESCRIPTION OF THE INVENTION
Referring to Fig. 1, personal computers 10, 12 and 14 are interconnected via a local area network (LAN) 16. A printer 18 is also connected to LAN 16 and provides print services for each of personal computers 10, 12 and 14. Hereafter, the invention will be described in the context of printer 18, however, it is to be understood that other data processing systems that perform services for connected computers can also utilize the same 191,577 6 invention. Examples of such other peripheral units are plotters, facsimile units, etc.
Computers attached to LAN 16 can employ different printer control languages. To illustrate the invention, it will be assumed that PC 10 employs the printer language known as PCL (printer control language), PC 12 employs the printer language PostScript, and PC 14 employs some other printer control language. The invention enables printer 18 to automatically analyze the context of an incoming command/data stream from any of the PCs 10, 12 and/or 14; to identify the language being received;
and to then proceed to carry out print commands in accordance therewith.
Printer 18 includes a central processing unit 20, an input/output (I/O) module 22 and a random access memory module 24, each interconnected via a bus 26 to a print engine 28. A portion of RAM 24 is broken out as shown at 30 and includes that portion of RAM
24 that is utilized for the language identification procedure. Contained therein is a storage area 32 for storing a block of data received from one of PC's 10, 12 or 14. Storage area 32 is preferably large enough to hold a 256 byte block of data. Such a block size has been found sufficient to enable identification of an incoming language without unduly expanding the required processing time.
The language identification procedure includes a plurality of voter modules 34, 36 and 38, each of which is specifically assigned to analysis of an 191,577 7 ~076~61 expected printer language. For instance, voter module 34 is assigned to analyze the PCL language, voter 36 to analyze the PostScript language, etc. A
decider module 40 receives outputs from each of voter modules 34, 36, and 38 and decides, based upon those voter module inputs, the most likely identity of the received language. Decider 40 then instructs CPU 20 to access the syntactical decoding software that will enable it to interpret and execute the decided-upon language. By having the decider and voter functions embodied in different modules, additional languages can be easily accommodated by the addition of a voter module for each new language.
Turning to Fig. 2, a representative voter module and its main components are shown. Subroutine 42 is a syntax analyzer that is provided with definitions of the voter's assigned language structure and includes both rules and descriptive statements. Through the use of these definitions, syntax analyzer 42 is enabled to parse an incoming data block and to identify portions which are particularly relevant to a determination of the identity of the data block's language. Those relevant portions will be hereinafter referred to as keys. There are both positive and negative keys, with positive keys, if present, indicating For the language, and negative keys, if present, indicating Against the language.
Each voter include a plurality of key counters, one key counter for each type (category) of key. Each voter module further includes a weight table 48 that 191,577 8 2 0 764 6~
assigns a weight value to each key as its count is registered. Weight values inserted into weight table 48 will be either positive or negative, depending upon whether the identified key is indicative of the presence of the language or is indicative of an unknown character or other group of characters that are not allowed by the language of syntax. The assigned weight values are summed into a vote value register 46 which maintains a running lo sum whose value is equal to the summation of the positive and negative weight keys that have been detected in the incoming data stream.
A context table 50 is employed to assign to each detected key a different value (a "skew") that is dependent upon the key and its context in the received data block. Context table 50 includes, for each key type, an initial skew value, which is either multiplied or divided (as the case may be) by a skew modifier to result in a skew value that is dependent upon the context of the key in the data block. The skew values (both plus and minus) are then inputted into a pair of vote tally registers 52 which respectively accumulate positive and negative skew values. Thus, a "For" tally register accumulates all positive skew values resulting from the aforesaid computations while an "Against" tally register accumulates negative skew values.
Turning now to Figs. 3 and 4, syntaxes for both PCL
and PostScript are shown in a logical diagram form.
Each logical diagram is embodied as logical statements within the respective syntax analyzer 191,577 9 ~07646~
subroutine 42 in the voter module assigned to scan for the particular language. Thus, voter module 34 (Fig. 1) will have logical statements that embody the syntax shown in Fig. 3. The diagram of Fig. 3 can be analyzed as follows. The PCL syntax requires that a print job be preceded by a defined sequence of ASCII character known as an Escape (has a binary numerical value equal to 27). After an Escape sequence is determined, the syntax analyzer proceeds lo to analyze the next byte in the data flow, and if its binary value is between 48 and 126, the analysis awaits the arrival of the next Escape sequence (not shown). If, after an Escape sequence is detected, the binary value of the next byte is between 33 and 47, the program determines whether succeeding data is a string-number (Str Num) or is a character having a binary value between 96 and 126. A
string-number is defined in the PCL syntax as being one of a plurality of alternative characters, each one of which is classified as a string-number (see logic diagram labeled Str Num). After the syntax analyzer determines the presence of a string-number, it proceeds to determine whether the next character value is between 64 and 94 and if so, data following is skipped. Next the procedure returns to scanning for an Escape se~uence, etc. The final leg of the logic diagram arises if the character has a value between 96 and 126, at which point a string-number determination is again made, etc.
An example will aid in an understanding of the PCL
syntax chart of Fig. 3. Assume that an array of characters with the following values are received:
191,577 10 2076~6~
27, 33 and 96. When the PCL syntax analyzer 42 see a character having a binary value 27, it immediately recognizes it as an ASCII Escape character. Since the next character value is 33, the syntax analyzer increments to box A in Fig. 3, obtains a positive answer and proceeds to an analysis of the next character. Since the next character has a value of 96, it does not match the syntax of a string-number (block B), but does match the condition shown in logic block C. The procedure continues with the PCL
syntax analyzer continuing to identify portions of the incoming data stream that find definitions within the PCL syntax listing.
In Fig. 4, a logic chart is shown for PostScript, with the analyses proceeding along vertical line D
only if a horizontal logical block condition is not fulfilled. Thus, if the Syntax Analyzer that is resident in Voter module 36 does not see a % in the input data stream, it immediately proceeds to determine whether a "<" indicator is present and, if not, an "(", etc. In this manner, syntax analyzer 42 in the PostScript voter module proceeds to analyze for PostScript keys.
Turning now to Figs. 5a and 5b, weight tables are shown for both the PostScript and PCL languages, and indicate keys that are employed in the language analysis procedure. Turning first to Fig. 5a, the PostScript key types are reserved words, syntax errors, documentation keys, special keys, unknown words and reserved punctuation. A reserved word is one which is defined in the language's syntax as 191,577 11 being unavailable for uses, other than that specified by the syntax. A syntax error is an organization of characters which does not meet the syntactical requirements of the language. A
documentation format command is a command that is a routing command for a document, or one which defines its format. A special character sequence is one which is defined by the syntax as being specific to the language. Reserved punctuation is similarly lo defined by the syntax as having specific meaning within the syntax. Finally, unknown words, are just that - words which are not recognized by the syntax.
As shown in the right hand column of Fig. 5a, each key type is assigned a weight, with some weights being positive and others being negative. The negative weights are votes against the language and the positive values are votes for the language.
Note that key types which give rise to negative weights are not considered as significant as key types with assigned positive weights. This is due to the fact that the positive weight keys are more indicative of the presence of a language than the negative weight keys are of the absence of a language. The specific weight values indicated in Fig. 5a are empirically derived and are based upon an estimate of the importance of the key type to an identification of the language.
In Fig. 5b, key types are illustrated for the PCL
language. The Escape character has been described above. Short sequences and complete sequences are defined sequences of characters defined by the PCL
191,577 12 2~7646~
syntax as being special to PCL. Combined sequences are repeated complete sequences. Illegal sequences are sequences of characters that are not recognized by the PCL syntax as being part of the PCL language.
An illegal sequence is equivalent to a syntax error in PostScript. Here again, the values on the right hand side of the chart of Fig. 5b are weight values with the positive values voting "for" the PCL
language and negative value voting "against".
Returning to Fig. 2, it is there noted that each voter module is provided with key type counters 44.
Thus, as can be seen from Fig. Sa, the PostScript voter module 36 will contain 6 key type counters, one for each listed key type. Similarly, as shown in Fig. 5b, the PCL voter module 36 will contain 5 key type counters that maintain a count of the number of each type of key determined from an analysis of an incoming data block. Additionally, zO each voter module includes a voter value register 46. In each voter module, a vote value register 46 is incremented by the value of the weight assigned to a key type, each time a particular key type is found by syntax analyzer 42. Thus, vote value register 46 indicates a sum that is the cumulative value of the negative and positive weights of all keys found in an incoming block of data.
In Figs. 6 and 7, context tables are shown for both the PostScript and PCL languages that enable keys derived from a data block to be differently weighted (i.e. "skewed") in accordance with the context of 191,577 13 2076464 the data block. "Skew" values are then entered in For and Against vote tally registers 52 in each voter module. Each context table includes a key type column that is identical to key type listing found in the weight tables for PostScript and PCL.
The "skew direction" column indicates whether the contextual skew that is to be applied to the key type is initially at a maximum and then decreases (ceiling), or is at a minimum and thereafter lo increases (growing). A "growing" skew direction indicates that successive occurrences of a key type in a data block represent a growing assurance that a data block is configured in the respective language.
Conversely, a "ceiling" skew is indicative that the first occurrence of a particular key type is the most important, with subsequent occurrences being of less importance.
The next column of each context chart indicates "initial skew" values assigned to each key type upon its initial occurrence in a data block. These are empirically defined values whose relative sizes indicate the importance of a specific key's initial appearance in a data block to the identification of the language. For explanatory purposes, the values are shown in Arabic numbers, while in actual implementations they will be configured in a hexidecimal notation. The "skew modification"
column indicates how initial skew values are to be modified upon subsequent appearances of a key type after its initial appearance. For instance, a first documentation format command key is assigned a value of 40, whereas the second occurrence of a 191,577 14 207646~
documentation command format key is assigned a value of 10, (40/4), the third occurrence a value of 2.5, (10/4), etc. Similarly, a special punctuation key is initially assigned a value of 2.79xlO 7, which value is multiplied by 4 upon the second occurrence of a special punctuation key. The resulting product is multiplied by 4 upon the third occurrence of special punctuation key type, etc.
In Fig. 7, a context table for the PCL language is shown. Here it is to be noted that the key types short sequence, complete sequence, and combined sequences, are all subjected to the same initial skew value and skew modification upon subsequent occurrences.
As above indicated, each voter module contains both Four And Against vote tally registers 52. The signed values calculated through the use of the context tables are inserted into the For and Against Vote tally registers, with the positive values summed into the For register and the negative values summed into the Against register. Each vote tally register thus manifests a sum that is indicative of the number of key types, in context, within a received data block. The For vote tally register sum indicates the skewed weights of all keys that indicate the presence of a particular language. The Against vote tally register indicates the sum of a skewed weights of keys whose presence suggest that block being analyzed does not use the particular language handled by the respective voter module.
191,577 15 2076~6~
Turning now to Figs. 8-11, the language identification procedure will be described, in conjunction with the tables shown in Figs. 5a, 5b, 6 and 7. The procedure commences when a new block of data is received(box 100). While the data block can be of any size, it is preferably chosen to be of a size that enables a reasonable sample of incoming data to be included, while not being too long so as to delay the print function. Preferably, the size lo of the received block is approximately 256 bytes.
As above indicated, there is a separate voter module provided for each expected language, and in this case it will be assumed that PCL and PostScript are the expected languages. Each voter module operates in parallel and upon the received block input. As shown in Fig. 8, a voter module's syntax analyzer 42 initially identifies keys as they are sequentially found in the data block input (box 102). Those keys are then identified by type (box 104) and corresponding key type counters are incremented by one each time a new key type is determined (box 106). Similarly, each time a key is found, a signed weight is added to the voting value, the weight Z5 value being found from a weight table (box 108).
For instance, if a PostScript voter module determines the presence of a syntax error, it causes -50 to be added to vote value register 46 (Fig. 2).
Similarly, if a special character sequence is determined, a +80 is added to the voter module vote value register 46.
191,577 16 In this manner, a voter module maintains a single running cumulative sum whose value is indicative of weighted votes for and against the language for which the voting module is scanning. The vote value register sum does not, however, take into account the context (i.e. the relationship of the keys) in which the keys appear in the data block. Thus, the accumulated voting value is insufficient to assure consistently accurate language selection.
Within the syntax analyzer, the procedure continues by determining (box 110) if the last key in the data block has been found. If not, the procedure cycles back to the beginning and repeats itself. If the last key has been identified from the incoming data block, the procedure determines whether the value in the voting value register 46 is greater than or less than 0 (decision box 111). If the voting value is greater than or equal to 0, such fact is indicated as output 112 and if it is less than 0, that fact is manifest as output 113.
Concurrent with the syntax analysis described in Fig. 8, each voter module performs a context 2s analysis. The procedure for the context analysis is shown in Fig. 9 and commences with the establishment of For and Against tally registers (box 120). The procedure receives identified keys and key types as an input from box 104 in Fig. 8. For each identified key, the procedure determines whether the key is the initial key of that type identified in the data block. If yes, the procedure determines an initial skew value for the key type from the 191,577 17 207646~
associated context table (box 124). A PCL voter module employs the values shown in the context table of Fig. 7 and a PostScript voter module employs the values in the context table of Fig. 6.
If the initial skew value is determined to be negative (box 126), the voter module's Against tally is incremented by the initial skew value (box 126).
If, by contrast, the initial skew value is positive, the voter module's For tally register is incremented by the initial skew value (box 128).
Returning to decision box 122, if it is determined that the key input from box 104 is not the initial occurrence in the data block of a key of the specific key type, then the procedure increments to decision box 130 to determine whether the initial skew value for the determined key type is positive or negative. If it is positive, the last skew value that was input to the For tally is altered by combination with the skew modifier (box 132). For example, assuming a positive initial skew value, if the skew modifier indicates that the skew value is to be divided by four, the last skew value input to the For tally is divided by four. Similarly, if the skew modifier indicates a multiply action, then the last skew value input to the For tally is multiplied by the modifier value. Then, the modified skew value is OR'd into the For tally register to update its cumulative value. The OR function prevents the bit size of the cumulative value from growing (and essentially eliminates any carries from the sum).
Since both the For and Against tallies are handled 191,577 18 2076~6~
similarly, a subsequent comparison therebetween is not affected by the lack of the carry function.
Returning to decision box 120, if the initial skew value is found to have a negative value, then the last skew value that was input to the Against tally register is altered by the skew modifier. In the same manner as aforedescribed, if the function indicates a multiply, the last entered skew value is multiplied by the required constant and if a divide is called for, a conforming action takes place (box 136). The procedure then OR's the modified skew value into the Against tally register to update its value.
At this point, the procedure continues by determining whether the last key in the block has been identified (decision box 140), and if not, a further decision is made based upon whether either the For or Against tally indicates a greater than 98~ certainty value (decision box 142). This means that if the cumulative value of either the For or Against tally is greater than 98% of the largest value that the respective tally could ever obtain, then the procedure "short circuits" further analysis of keys, and the assumption is that a language has been presumptively identified.
If decision box 142 indicates a no, the procedure recycles to consider the next key. After the last key in the block has been handled (as determined by decision box 140), the procedure computes the difference between the For and Against tally 191,577 19 ~ 07 6~ 6g registers (box 144). That computed difference is then compared against a maximum expected difference value that could be expected between the tallies.
If the computed difference is less than 25~ (an empirical decision point) of the maximum expected difference value, it is assumed that the For and Against tallies are so close (i.e. "confused") as to not allow a definitive decision to be made, based solely upon the above described contextual analysis.
If the computed difference is 25% or greater than the maximum expected difference value between the tallies, then a "not confused" output results from decision box 146 and it is assumed that the larger tally value is presumptively accurate.
In Fig. lOa, the "not confused" indication from decision box 146 is followed by a determination (decision box 148) as to whether the For tally is greater than the Against tally. Depending on which zo tally is the greater, the larger tally is then "normalized". If a yes is indicated by decision box 148 (For tally > Against tally), a normalization procedure is performed (box 150) on the For tally to map its value into a range of from 0 to +127. The reason for this normalization action is that For and Against tallies in different voter modules will evidence different cumulative values that are dependent upon the characteristics of the language.
Thus, the cumulative values in the various voter modules may have little or no relationship to each other in terms of their absolute values. However, the individual For and Against tally values in each voter module will have a comparative meaning if they 191,577 20 2076464 are evidenced as a percentage (or equivalent number value) of a maximum value which could exist for the specific tally. Thus, assuming a For tally >
Against tally, the For tally is compared to the maximum value that that tally could obtain and a ratio is obtained. That ratio then determines the point within a prescribed numerical range of 0 to +127 into which the tally value is mapped.
In Figs. lOb and lOc, procedures are shown for handling a "confused" indication in voter modules assigned to detect PCL and PostScript, respectively.
The PostScript procedure is more complex than PCL
due to the greater complexity of the Post Script language.
In Fig. lOb, the procedure in a PCL voter module when a confused input is indicated by decision box 146 in Fig. 9. In response to the confused indication the accumulated vote value outputs from decision box 111 in Fig. 8 are examined (decision box 158). If it is found that the accumulated vote value is less than 0, (indicating that the cumulative value of the vote value register in the particular voting module shows a negative sum of accumulated weights), the normalized Against tally is returned to the decider (box 160). If the accumulated vote value is found to be greater than or equal to 0, the For tally (normalized) is returned to the decider (box 162).
In Fig. lOc, the procedure is shown in a PostScript voter module when a confused input is indicated by 191,577 21 207646~
decision box 146 in Fig. 9. In response, the procedure determines whether, in the syntax analysis of the incoming data block (Fig. 8), no syntax errors were found and that at least one special S character sequence has been detected (decision box 164). If syntax errors were found (i.e. a syntax error count not equal to 0), or no special character sequences were detected, the normalized Against tally is returned to the decider module (box 166).
If the AND condition indicated in decision box 164 is present, then the accumulated vote value outputs from decision box 111 in Fig. 8 are examined (decision box 168). If it is found that the accumulated vote value is less than 0, (indicating that the cumulative value of the vote value register in the particular voting module shows a negative sum of accumulated weights), the normalized Against tally is returned to the decider (box 166). If the accumulated vote value is found to be greater than o, the For tally (normalized) is returned to the decider (box 170).
Turning now to Fig. 11, the decider module stores a returned normalized tally from each voter module (box 172). As above described, each voter module will have returned a single number to the decider module that evidences either a value between 0 to +127 or -1 to -128, with the former value being votes for a language and the latter being votes against the language. As shown in decision box 174, if all voter module tallies returned to the decider module are negative, then a non-language indication is set (box 176). On the other hand, if all of the 191,577 22 tallies are not negative, then the largest positive tally is selected as being the incoming language tbox 178).
In summary, the procedure employs three separate and simultaneous accumulations of analytical data to decide upon a language's identification. Those indications include a count of both positive and negative key weights for each voter module assigned lo to a particular language; a weighted sum in each voter module that indicates whether the keys found in the incoming data block cumulatively indicate a positive or negative vote For or Against the language; and For and Against tallies that incorporate a contextual analysis based upon the importance of the keys to the language and therefore provide a parallel and independent language vote.
The combination of these votes, as indicated in the flow diagrams of Figs. 8-11, provides a high level of confidence in the ultimate language selection.
Furthermore, the arrangement of the decision process into a separate decider module, with a separate voting module for each language, enables the system to be modified to accommodate additional languages that are not contemplated at the outset.
It should be understood that the foregoing description is only illustrative of the invention.
Various alternatives and modifications can be devised by those skilled in the art without departing from the invention. Accordingly, the present invention is intended to embrace all such 191,577 23 207646i alternatives, modifications and variances which fall within the scope of the appended claims.
Claims (21)
1. In a data processing system responsive to a plurality of input languages, each language adhering to a prescribed syntax, the presence of defined data portions ("For" keys) in incoming data indicating a vote for the presence of a language and the presence of other defined data portions ("Against" keys) indicating a vote Against the presence of the language, a method for identifying an input language comprising the steps of:
a) analyzing, for each expected language, the syntax of an incoming block of data to identify For and Against keys in said block of data;
b) providing For and Against tallies for each expected language in response to said analysis, each said tally being a summation of key entries, each key entry comprising an identified key count multiplied by a skew, the value of said skew indicating an importance of said key in said syntax and in the context of said block of data, said For tally summing entries of For keys and said Against tally summing entries of Against keys;
c) comparing said For and Against tallies to determine whether or not they are so close as to signal uncertainty and, based upon a further syntactical characteristic of said block of data, resolving said uncertainty and indicating a value based on one of said tallies, said indication dependent upon whether said further syntactical characteristic indicates For or Against the language;
d) indicating a value derived from the larger of the tallies in the event of no uncertainty between the tallies; and e) deciding, based upon said indicated value for each said expected language, the identity of a received language.
a) analyzing, for each expected language, the syntax of an incoming block of data to identify For and Against keys in said block of data;
b) providing For and Against tallies for each expected language in response to said analysis, each said tally being a summation of key entries, each key entry comprising an identified key count multiplied by a skew, the value of said skew indicating an importance of said key in said syntax and in the context of said block of data, said For tally summing entries of For keys and said Against tally summing entries of Against keys;
c) comparing said For and Against tallies to determine whether or not they are so close as to signal uncertainty and, based upon a further syntactical characteristic of said block of data, resolving said uncertainty and indicating a value based on one of said tallies, said indication dependent upon whether said further syntactical characteristic indicates For or Against the language;
d) indicating a value derived from the larger of the tallies in the event of no uncertainty between the tallies; and e) deciding, based upon said indicated value for each said expected language, the identity of a received language.
2. The method as recited in Claim 1 wherein said step (a) further comprising the steps of:
classifying identified For and Against keys by key type;
incrementing or decrementing a language vote count by a weight value assigned to each key type, the increment or decrement amount being a signed key type weight value preassigned to the key type each time a said key is determined, said vote value being incremented for For key types and decremented for Against key types.
classifying identified For and Against keys by key type;
incrementing or decrementing a language vote count by a weight value assigned to each key type, the increment or decrement amount being a signed key type weight value preassigned to the key type each time a said key is determined, said vote value being incremented for For key types and decremented for Against key types.
3. The method as recited in claim 2 wherein said further syntactical characteristic defined in step (c) is whether a said language vote count is greater or less than a prescribed value.
4. The method as recited in Claim 3 wherein said For key types comprise syntactically conforming characters and sequences, and said Against key types comprise syntactically nonconforming characters and sequences, syntactical errors, unknown words, and illegal sequences.
5. The method as recited in Claim 3 wherein said skew for each key type is an initial skew value for a key type modified by a skew modifier, said skew modifier causing said initial skew value to differ for second and subsequent appearances of a key type in a data block.
6. The method as in Claim 5 wherein said skew modifier is a multiplier for key types whose subsequent appearances in a data block are more heavily indicative of a language and wherein said skew modifier is a divider when subsequent appearances of a key type in a data block are not as important to the identification of a language as the first appearance of the key type in the data block.
7. The method as recited in Claim 6 wherein each time said initial skew value is modified by a skew modifier, the next time said skew is modified by said skew modifier, it is the previously modified skew value that is altered, whereby a non-linear change occurs in skew values over a sequence of skew modifications.
8. The method recited in claim 7 wherein after step b, the method performs the additional steps of:
comparing said For and Against tallies against maximum values that each such tally can obtain, and if either said tally is within a preset limit of said maximum value, ceasing further analysis of a block of data in accordance with step (b) and proceeding directly to step (c).
comparing said For and Against tallies against maximum values that each such tally can obtain, and if either said tally is within a preset limit of said maximum value, ceasing further analysis of a block of data in accordance with step (b) and proceeding directly to step (c).
9. The method as recited in claim 2 wherein said uncertainty determination is made by calculating a difference between said For and Against tallies and comparing said difference against a maximum expected difference therebetween, and if said comparison indicates that said difference is greater than a preset percentage of said maximum difference, indicating confusion regarding a choice as between said tallies.
10. The method as recited in Claim 9 where said input languages include PCL, and in response to a confusion indication, a PCL voter module performs the further steps of:
determining if a PCL language vote count is greater than a prescribed value and, if no, indicating a value derived from the Against tally and if yes, indicating a value derived from said For tally.
determining if a PCL language vote count is greater than a prescribed value and, if no, indicating a value derived from the Against tally and if yes, indicating a value derived from said For tally.
11. The method as recited in Claim 9 where said input languages include PostScript, and in response to a confusion indication, a PostScript voter module performs the further steps of:
determining if no syntax error has been detected in the analysis of the block of data and a special character detected that is present in PostScript, and, if no, indicating a value derived from the Against tally and if yes, and said language vote value is greater than said prescribed value, indicating a value derived from said For tally.
determining if no syntax error has been detected in the analysis of the block of data and a special character detected that is present in PostScript, and, if no, indicating a value derived from the Against tally and if yes, and said language vote value is greater than said prescribed value, indicating a value derived from said For tally.
12. The method as recited in claim 1 wherein said comparing step (c) includes the further step of:
mapping said For and Against tallies into a preset range of values, each said tally mapped into said preset range of values in accordance with said tally's relationship to a maximum value each said tally can achieve.
mapping said For and Against tallies into a preset range of values, each said tally mapped into said preset range of values in accordance with said tally's relationship to a maximum value each said tally can achieve.
13. A data processing system including software, said system responsive to a plurality of input languages, each language adhering to a prescribed syntax wherein defined data portions ("For" keys) in incoming data indicate a vote for the presence of a language and the presence of other defined data portions ("Against" keys) indicate a vote Against the presence of the language, said system including a voter means for each language and a decider means, each said voter means comprising:
syntax means for analyzing, for an expected language, the syntax of an incoming block of data to identify For and Against keys in the block of data;
tally means for providing For and Against tallies for said language in response to said analysis, each said tally being a summation of key entries, each key entry comprising an identified key count multiplied by a skew, the value of said skew indicating an importance of said key in said syntax and in the context of said block of data, said For tally summing entries of For keys and said Against tally summing entries of Against keys;
first means for comparing said For and Against tallies to determine whether or not they are so close as to signal uncertainty, and, based upon a further syntactical characteristic of said block of data, resolving said uncertainty and indicating a first value based on one of said tallies; and means for indicating said first value or a second value to said decider means, said second value derived from the larger of the tallies in the event of no uncertainty between the tallies.
syntax means for analyzing, for an expected language, the syntax of an incoming block of data to identify For and Against keys in the block of data;
tally means for providing For and Against tallies for said language in response to said analysis, each said tally being a summation of key entries, each key entry comprising an identified key count multiplied by a skew, the value of said skew indicating an importance of said key in said syntax and in the context of said block of data, said For tally summing entries of For keys and said Against tally summing entries of Against keys;
first means for comparing said For and Against tallies to determine whether or not they are so close as to signal uncertainty, and, based upon a further syntactical characteristic of said block of data, resolving said uncertainty and indicating a first value based on one of said tallies; and means for indicating said first value or a second value to said decider means, said second value derived from the larger of the tallies in the event of no uncertainty between the tallies.
14. The data processing system as recited in claim 13 wherein said decider means comprises:
means for examining said indicated values from each said voter means and deciding upon the identity of the language embodied by said incoming data block.
means for examining said indicated values from each said voter means and deciding upon the identity of the language embodied by said incoming data block.
15. The system as recited in claim 14 further comprising:
means for classifying identified For and Against keys by key type; and weight means for incrementing or decrementing a language vote count by a weight value assigned to each key type, the increment or decrement amount being a signed key type weight value preassigned to the key type each time a said key is determined, said vote value being incremented for For key types and decremented for Against key types.
means for classifying identified For and Against keys by key type; and weight means for incrementing or decrementing a language vote count by a weight value assigned to each key type, the increment or decrement amount being a signed key type weight value preassigned to the key type each time a said key is determined, said vote value being incremented for For key types and decremented for Against key types.
16. The system as recited in claim 15 wherein said further syntactical characteristic is whether a said language vote count is greater or less than a prescribed value.
17. The system as recited in Claim 15 wherein said skew for each key type is an initial skew value for a key type modified by a skew modifier, said skew modifier causing said initial skew value to differ for second and subsequent appearances of a key type in a data block.
18. The system as recited in claim 17, further comprising:
second means for comparing said For and Against tallies against maximum values that each such tally can obtain, and if either said tally is within a preset limit of said maximum value, ceasing further analysis of a block of data by said tally means and operating said first comparing means.
second means for comparing said For and Against tallies against maximum values that each such tally can obtain, and if either said tally is within a preset limit of said maximum value, ceasing further analysis of a block of data by said tally means and operating said first comparing means.
19. The system as recited in claim 18 wherein said first comparison means renders said uncertainty determination by calculating a difference between said For and Against tallies and comparing said difference against a maximum expected difference therebetween, and if said comparison indicates that said difference is greater than a preset percentage of said maximum difference, indicating confusion regarding a choice as between said tallies.
20. The system as recited in claim 13 wherein a said voter means includes means for mapping said For and Against tallies into a preset range of values, each said tally mapped into said preset range of values in accordance with said tally's relationship to a maximum value each said tally can achieve.
21. The data processing system as recited in Claim 20 wherein said decider means indicates (1) a non-language if all voter means provide values that are indicative of Against tallys, or (2) a language based upon the largest For tally value provided from a voter means.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US825,479 | 1992-01-24 | ||
| US07/825,479 US5392419A (en) | 1992-01-24 | 1992-01-24 | Language identification system and method for a peripheral unit |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2076464A1 CA2076464A1 (en) | 1993-07-25 |
| CA2076464C true CA2076464C (en) | 1997-07-15 |
Family
ID=25244099
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002076464A Expired - Fee Related CA2076464C (en) | 1992-01-24 | 1992-08-20 | Language identification system and method for a peripheral unit |
Country Status (7)
| Country | Link |
|---|---|
| US (1) | US5392419A (en) |
| EP (1) | EP0558804B1 (en) |
| JP (1) | JP3485588B2 (en) |
| KR (1) | KR100256458B1 (en) |
| CA (1) | CA2076464C (en) |
| DE (1) | DE69229626T2 (en) |
| TW (1) | TW202508B (en) |
Families Citing this family (158)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE69322457T2 (en) * | 1992-09-03 | 1999-07-15 | Hewlett Packard Co | Automatic language limit detection for a peripheral device that supports a variety of control languages |
| JP2871370B2 (en) * | 1993-01-20 | 1999-03-17 | キヤノン株式会社 | Output control method and device |
| US5402527A (en) * | 1993-04-23 | 1995-03-28 | Xerox Corporation | Apparatus and method for determining the page description language in which a print job is written |
| US5548507A (en) * | 1994-03-14 | 1996-08-20 | International Business Machines Corporation | Language identification process using coded language words |
| US5580177A (en) * | 1994-03-29 | 1996-12-03 | Hewlett-Packard Company | Printer/client network with centrally updated printer drivers and printer status monitoring |
| JP3919238B2 (en) * | 1994-05-31 | 2007-05-23 | キヤノン株式会社 | Printing system, printing control method for printing system, and printing control apparatus |
| JP3201141B2 (en) * | 1994-06-02 | 2001-08-20 | セイコーエプソン株式会社 | Data receiving method |
| US5526469A (en) * | 1994-06-14 | 1996-06-11 | Xerox Corporation | System for printing image data in a versatile print server |
| US6132116A (en) * | 1994-06-14 | 2000-10-17 | Canon Kabushiki Kaisha | Print system and method for presenting required record time of print system |
| US6002843A (en) * | 1994-06-15 | 1999-12-14 | Canon Kabushiki Kaisha | Printing apparatus and its control method |
| FR2723457B1 (en) * | 1994-08-08 | 1997-01-31 | Oce Graphics France | METHOD FOR AUTOMATICALLY RECOGNIZING A LANGUAGE IN WHICH DIGITAL DATA IS RECEIVED |
| US6597465B1 (en) | 1994-08-09 | 2003-07-22 | Intermec Ip Corp. | Automatic mode detection and conversion system for printers and tag interrogators |
| US5805781A (en) * | 1994-12-07 | 1998-09-08 | Hewlett-Packard Company | Printer method and apparatus for combining sub-images to eliminate image artifacts |
| JP3563793B2 (en) * | 1994-12-21 | 2004-09-08 | キヤノン株式会社 | Data processing method and apparatus |
| US5555350A (en) * | 1995-04-05 | 1996-09-10 | Xionics Document Technologies, Inc. | Multi-interpreter printer and process including recognition of out-of-bank characters |
| TW307846B (en) * | 1995-04-24 | 1997-06-11 | Fuji Xerox Co Ltd | |
| US5828817A (en) * | 1995-06-29 | 1998-10-27 | Digital Equipment Corporation | Neural network recognizer for PDLs |
| US5715379A (en) * | 1995-10-30 | 1998-02-03 | Xerox Corporation | Architecture for a digital printer with multiple independent decomposers |
| US6009382A (en) * | 1996-08-19 | 1999-12-28 | International Business Machines Corporation | Word storage table for natural language determination |
| US6023670A (en) * | 1996-08-19 | 2000-02-08 | International Business Machines Corporation | Natural language determination using correlation between common words |
| US5913185A (en) * | 1996-08-19 | 1999-06-15 | International Business Machines Corporation | Determining a natural language shift in a computer document |
| US6002998A (en) * | 1996-09-30 | 1999-12-14 | International Business Machines Corporation | Fast, efficient hardware mechanism for natural language determination |
| JP3559666B2 (en) * | 1996-12-27 | 2004-09-02 | キヤノン株式会社 | Output control device and output control method |
| US6415250B1 (en) * | 1997-06-18 | 2002-07-02 | Novell, Inc. | System and method for identifying language using morphologically-based techniques |
| US6272456B1 (en) * | 1998-03-19 | 2001-08-07 | Microsoft Corporation | System and method for identifying the language of written text having a plurality of different length n-gram profiles |
| US7126703B1 (en) * | 1998-08-04 | 2006-10-24 | Sharp Laboratories Of America, Inc. | Printer controller with error recovery for multiple language capability |
| US6292772B1 (en) | 1998-12-01 | 2001-09-18 | Justsystem Corporation | Method for identifying the language of individual words |
| EP1006431A1 (en) * | 1998-12-02 | 2000-06-07 | Xerox Corporation | Printing system and method |
| US6167369A (en) * | 1998-12-23 | 2000-12-26 | Xerox Company | Automatic language identification using both N-gram and word information |
| US6760887B1 (en) | 1998-12-31 | 2004-07-06 | International Business Machines Corporation | System and method for highlighting of multifont documents |
| US6718519B1 (en) | 1998-12-31 | 2004-04-06 | International Business Machines Corporation | System and method for outputting character sets in best available fonts |
| US6813747B1 (en) | 1998-12-31 | 2004-11-02 | International Business Machines Corporation | System and method for output of multipart documents |
| US7039637B2 (en) | 1998-12-31 | 2006-05-02 | International Business Machines Corporation | System and method for evaluating characters in an inputted search string against a character table bank comprising a predetermined number of columns that correspond to a plurality of pre-determined candidate character sets in order to provide enhanced full text search |
| US7031002B1 (en) | 1998-12-31 | 2006-04-18 | International Business Machines Corporation | System and method for using character set matching to enhance print quality |
| US7103532B1 (en) | 1998-12-31 | 2006-09-05 | International Business Machines Corp. | System and method for evaluating character in a message |
| US6539118B1 (en) | 1998-12-31 | 2003-03-25 | International Business Machines Corporation | System and method for evaluating character sets of a message containing a plurality of character sets |
| US7191114B1 (en) | 1999-08-27 | 2007-03-13 | International Business Machines Corporation | System and method for evaluating character sets to determine a best match encoding a message |
| US8645137B2 (en) | 2000-03-16 | 2014-02-04 | Apple Inc. | Fast, language-independent method for user authentication by voice |
| US6781710B1 (en) * | 2000-03-27 | 2004-08-24 | Hewlett-Packard Development Company, L.P. | Print job capture subsystem with pass-through support |
| US6519557B1 (en) | 2000-06-06 | 2003-02-11 | International Business Machines Corporation | Software and method for recognizing similarity of documents written in different languages based on a quantitative measure of similarity |
| US20040205675A1 (en) * | 2002-01-11 | 2004-10-14 | Thangaraj Veerappan | System and method for determining a document language and refining the character set encoding based on the document language |
| FR2848688A1 (en) * | 2002-12-17 | 2004-06-18 | France Telecom | Text language identifying device for linguistic analysis of text, has analyzing unit to analyze chain characters of words extracted from one text, where each chain is completed so that each time chains are found in word |
| JP2004362249A (en) * | 2003-06-04 | 2004-12-24 | Advanced Telecommunication Research Institute International | Translation knowledge optimization device, computer program, computer and storage medium for translation knowledge optimization |
| US8027832B2 (en) * | 2005-02-11 | 2011-09-27 | Microsoft Corporation | Efficient language identification |
| US8677377B2 (en) | 2005-09-08 | 2014-03-18 | Apple Inc. | Method and apparatus for building an intelligent automated assistant |
| US7973954B2 (en) * | 2006-08-28 | 2011-07-05 | Sharp Laboratories Of America, Inc. | Method and apparatus for automatic language switching for an imaging device |
| US9318108B2 (en) | 2010-01-18 | 2016-04-19 | Apple Inc. | Intelligent automated assistant |
| US8977255B2 (en) | 2007-04-03 | 2015-03-10 | Apple Inc. | Method and system for operating a multi-function portable electronic device using voice-activation |
| US9330720B2 (en) | 2008-01-03 | 2016-05-03 | Apple Inc. | Methods and apparatus for altering audio output signals |
| US8996376B2 (en) | 2008-04-05 | 2015-03-31 | Apple Inc. | Intelligent text-to-speech conversion |
| US10496753B2 (en) | 2010-01-18 | 2019-12-03 | Apple Inc. | Automatically adapting user interfaces for hands-free interaction |
| US20100030549A1 (en) | 2008-07-31 | 2010-02-04 | Lee Michael M | Mobile device having human language translation capability with positional feedback |
| US8583418B2 (en) * | 2008-09-29 | 2013-11-12 | Apple Inc. | Systems and methods of detecting language and natural language strings for text to speech synthesis |
| US8712776B2 (en) * | 2008-09-29 | 2014-04-29 | Apple Inc. | Systems and methods for selective text to speech synthesis |
| US9959870B2 (en) | 2008-12-11 | 2018-05-01 | Apple Inc. | Speech recognition involving a mobile device |
| US8380507B2 (en) * | 2009-03-09 | 2013-02-19 | Apple Inc. | Systems and methods for determining the language to use for speech generated by a text to speech engine |
| US10706373B2 (en) | 2011-06-03 | 2020-07-07 | Apple Inc. | Performing actions associated with task items that represent tasks to perform |
| US9858925B2 (en) | 2009-06-05 | 2018-01-02 | Apple Inc. | Using context information to facilitate processing of commands in a virtual assistant |
| US10241644B2 (en) | 2011-06-03 | 2019-03-26 | Apple Inc. | Actionable reminder entries |
| US10241752B2 (en) | 2011-09-30 | 2019-03-26 | Apple Inc. | Interface for a virtual digital assistant |
| US9431006B2 (en) | 2009-07-02 | 2016-08-30 | Apple Inc. | Methods and apparatuses for automatic speech recognition |
| US10705794B2 (en) | 2010-01-18 | 2020-07-07 | Apple Inc. | Automatically adapting user interfaces for hands-free interaction |
| US10679605B2 (en) | 2010-01-18 | 2020-06-09 | Apple Inc. | Hands-free list-reading by intelligent automated assistant |
| US10553209B2 (en) | 2010-01-18 | 2020-02-04 | Apple Inc. | Systems and methods for hands-free notification summaries |
| US10276170B2 (en) | 2010-01-18 | 2019-04-30 | Apple Inc. | Intelligent automated assistant |
| US8682667B2 (en) | 2010-02-25 | 2014-03-25 | Apple Inc. | User profiling for selecting user specific voice input processing information |
| US10762293B2 (en) | 2010-12-22 | 2020-09-01 | Apple Inc. | Using parts-of-speech tagging and named entity recognition for spelling correction |
| US9262612B2 (en) | 2011-03-21 | 2016-02-16 | Apple Inc. | Device access using voice authentication |
| US10057736B2 (en) | 2011-06-03 | 2018-08-21 | Apple Inc. | Active transport based notifications |
| US8994660B2 (en) | 2011-08-29 | 2015-03-31 | Apple Inc. | Text correction processing |
| US10134385B2 (en) | 2012-03-02 | 2018-11-20 | Apple Inc. | Systems and methods for name pronunciation |
| US9483461B2 (en) | 2012-03-06 | 2016-11-01 | Apple Inc. | Handling speech synthesis of content for multiple languages |
| US9280610B2 (en) | 2012-05-14 | 2016-03-08 | Apple Inc. | Crowd sourcing information to fulfill user requests |
| US9721563B2 (en) | 2012-06-08 | 2017-08-01 | Apple Inc. | Name recognition system |
| US9495129B2 (en) | 2012-06-29 | 2016-11-15 | Apple Inc. | Device, method, and user interface for voice-activated navigation and browsing of a document |
| US9576574B2 (en) | 2012-09-10 | 2017-02-21 | Apple Inc. | Context-sensitive handling of interruptions by intelligent digital assistant |
| US9547647B2 (en) | 2012-09-19 | 2017-01-17 | Apple Inc. | Voice-based media searching |
| US9336197B2 (en) * | 2013-01-22 | 2016-05-10 | Tencent Technology (Shenzhen) Company Limited | Language recognition based on vocabulary lists |
| JP2016508007A (en) | 2013-02-07 | 2016-03-10 | アップル インコーポレイテッド | Voice trigger for digital assistant |
| US9368114B2 (en) | 2013-03-14 | 2016-06-14 | Apple Inc. | Context-sensitive handling of interruptions |
| WO2014144579A1 (en) | 2013-03-15 | 2014-09-18 | Apple Inc. | System and method for updating an adaptive speech recognition model |
| KR101759009B1 (en) | 2013-03-15 | 2017-07-17 | 애플 인크. | Training an at least partial voice command system |
| WO2014197336A1 (en) | 2013-06-07 | 2014-12-11 | Apple Inc. | System and method for detecting errors in interactions with a voice-based digital assistant |
| WO2014197334A2 (en) | 2013-06-07 | 2014-12-11 | Apple Inc. | System and method for user-specified pronunciation of words for speech synthesis and recognition |
| US9582608B2 (en) | 2013-06-07 | 2017-02-28 | Apple Inc. | Unified ranking with entropy-weighted information for phrase-based semantic auto-completion |
| WO2014197335A1 (en) | 2013-06-08 | 2014-12-11 | Apple Inc. | Interpreting and acting upon commands that involve sharing information with remote devices |
| CN110442699A (en) | 2013-06-09 | 2019-11-12 | 苹果公司 | Operate method, computer-readable medium, electronic equipment and the system of digital assistants |
| US10176167B2 (en) | 2013-06-09 | 2019-01-08 | Apple Inc. | System and method for inferring user intent from speech inputs |
| CN105265005B (en) | 2013-06-13 | 2019-09-17 | 苹果公司 | System and method for the urgent call initiated by voice command |
| JP6163266B2 (en) | 2013-08-06 | 2017-07-12 | アップル インコーポレイテッド | Automatic activation of smart responses based on activation from remote devices |
| US9620105B2 (en) | 2014-05-15 | 2017-04-11 | Apple Inc. | Analyzing audio input for efficient speech and music recognition |
| US10592095B2 (en) | 2014-05-23 | 2020-03-17 | Apple Inc. | Instantaneous speaking of content on touch devices |
| US9502031B2 (en) | 2014-05-27 | 2016-11-22 | Apple Inc. | Method for supporting dynamic grammars in WFST-based ASR |
| US9715875B2 (en) | 2014-05-30 | 2017-07-25 | Apple Inc. | Reducing the need for manual start/end-pointing and trigger phrases |
| US9633004B2 (en) | 2014-05-30 | 2017-04-25 | Apple Inc. | Better resolution when referencing to concepts |
| US9842101B2 (en) | 2014-05-30 | 2017-12-12 | Apple Inc. | Predictive conversion of language input |
| US9430463B2 (en) | 2014-05-30 | 2016-08-30 | Apple Inc. | Exemplar-based natural language processing |
| US9760559B2 (en) | 2014-05-30 | 2017-09-12 | Apple Inc. | Predictive text input |
| US10170123B2 (en) | 2014-05-30 | 2019-01-01 | Apple Inc. | Intelligent assistant for home automation |
| US9734193B2 (en) | 2014-05-30 | 2017-08-15 | Apple Inc. | Determining domain salience ranking from ambiguous words in natural speech |
| US10078631B2 (en) | 2014-05-30 | 2018-09-18 | Apple Inc. | Entropy-guided text prediction using combined word and character n-gram language models |
| US9785630B2 (en) | 2014-05-30 | 2017-10-10 | Apple Inc. | Text prediction using combined word N-gram and unigram language models |
| US10289433B2 (en) | 2014-05-30 | 2019-05-14 | Apple Inc. | Domain specific language for encoding assistant dialog |
| US9966065B2 (en) | 2014-05-30 | 2018-05-08 | Apple Inc. | Multi-command single utterance input method |
| US9338493B2 (en) | 2014-06-30 | 2016-05-10 | Apple Inc. | Intelligent automated assistant for TV user interactions |
| US10659851B2 (en) | 2014-06-30 | 2020-05-19 | Apple Inc. | Real-time digital assistant knowledge updates |
| US10446141B2 (en) | 2014-08-28 | 2019-10-15 | Apple Inc. | Automatic speech recognition based on user feedback |
| US9818400B2 (en) | 2014-09-11 | 2017-11-14 | Apple Inc. | Method and apparatus for discovering trending terms in speech requests |
| US10789041B2 (en) | 2014-09-12 | 2020-09-29 | Apple Inc. | Dynamic thresholds for always listening speech trigger |
| US9606986B2 (en) | 2014-09-29 | 2017-03-28 | Apple Inc. | Integrated word N-gram and class M-gram language models |
| US10074360B2 (en) | 2014-09-30 | 2018-09-11 | Apple Inc. | Providing an indication of the suitability of speech recognition |
| US10127911B2 (en) | 2014-09-30 | 2018-11-13 | Apple Inc. | Speaker identification and unsupervised speaker adaptation techniques |
| US9668121B2 (en) | 2014-09-30 | 2017-05-30 | Apple Inc. | Social reminders |
| US9646609B2 (en) | 2014-09-30 | 2017-05-09 | Apple Inc. | Caching apparatus for serving phonetic pronunciations |
| US9886432B2 (en) | 2014-09-30 | 2018-02-06 | Apple Inc. | Parsimonious handling of word inflection via categorical stem + suffix N-gram language models |
| US10552013B2 (en) | 2014-12-02 | 2020-02-04 | Apple Inc. | Data detection |
| US9711141B2 (en) | 2014-12-09 | 2017-07-18 | Apple Inc. | Disambiguating heteronyms in speech synthesis |
| US9865280B2 (en) | 2015-03-06 | 2018-01-09 | Apple Inc. | Structured dictation using intelligent automated assistants |
| US10567477B2 (en) | 2015-03-08 | 2020-02-18 | Apple Inc. | Virtual assistant continuity |
| US9721566B2 (en) | 2015-03-08 | 2017-08-01 | Apple Inc. | Competing devices responding to voice triggers |
| US9886953B2 (en) | 2015-03-08 | 2018-02-06 | Apple Inc. | Virtual assistant activation |
| US9899019B2 (en) | 2015-03-18 | 2018-02-20 | Apple Inc. | Systems and methods for structured stem and suffix language models |
| US10210385B2 (en) | 2015-04-09 | 2019-02-19 | Hewlett-Packard Development Company, L.P. | Routing image frames to element detectors |
| US9842105B2 (en) | 2015-04-16 | 2017-12-12 | Apple Inc. | Parsimonious continuous-space phrase representations for natural language processing |
| US10083688B2 (en) | 2015-05-27 | 2018-09-25 | Apple Inc. | Device voice control for selecting a displayed affordance |
| US10127220B2 (en) | 2015-06-04 | 2018-11-13 | Apple Inc. | Language identification from short strings |
| US10101822B2 (en) | 2015-06-05 | 2018-10-16 | Apple Inc. | Language input correction |
| US11025565B2 (en) | 2015-06-07 | 2021-06-01 | Apple Inc. | Personalized prediction of responses for instant messaging |
| US10255907B2 (en) | 2015-06-07 | 2019-04-09 | Apple Inc. | Automatic accent detection using acoustic models |
| US10186254B2 (en) | 2015-06-07 | 2019-01-22 | Apple Inc. | Context-based endpoint detection |
| US10747498B2 (en) | 2015-09-08 | 2020-08-18 | Apple Inc. | Zero latency digital assistant |
| US10671428B2 (en) | 2015-09-08 | 2020-06-02 | Apple Inc. | Distributed personal assistant |
| US9697820B2 (en) | 2015-09-24 | 2017-07-04 | Apple Inc. | Unit-selection text-to-speech synthesis using concatenation-sensitive neural networks |
| US10366158B2 (en) | 2015-09-29 | 2019-07-30 | Apple Inc. | Efficient word encoding for recurrent neural network language models |
| US11010550B2 (en) | 2015-09-29 | 2021-05-18 | Apple Inc. | Unified language modeling framework for word prediction, auto-completion and auto-correction |
| US11587559B2 (en) | 2015-09-30 | 2023-02-21 | Apple Inc. | Intelligent device identification |
| US10691473B2 (en) | 2015-11-06 | 2020-06-23 | Apple Inc. | Intelligent automated assistant in a messaging environment |
| US10049668B2 (en) | 2015-12-02 | 2018-08-14 | Apple Inc. | Applying neural network language models to weighted finite state transducers for automatic speech recognition |
| US10223066B2 (en) | 2015-12-23 | 2019-03-05 | Apple Inc. | Proactive assistance based on dialog communication between devices |
| US10446143B2 (en) | 2016-03-14 | 2019-10-15 | Apple Inc. | Identification of voice inputs providing credentials |
| US9934775B2 (en) | 2016-05-26 | 2018-04-03 | Apple Inc. | Unit-selection text-to-speech synthesis based on predicted concatenation parameters |
| US9972304B2 (en) | 2016-06-03 | 2018-05-15 | Apple Inc. | Privacy preserving distributed evaluation framework for embedded personalized systems |
| US10249300B2 (en) | 2016-06-06 | 2019-04-02 | Apple Inc. | Intelligent list reading |
| US10049663B2 (en) | 2016-06-08 | 2018-08-14 | Apple, Inc. | Intelligent automated assistant for media exploration |
| DK179309B1 (en) | 2016-06-09 | 2018-04-23 | Apple Inc | Intelligent automated assistant in a home environment |
| US10192552B2 (en) | 2016-06-10 | 2019-01-29 | Apple Inc. | Digital assistant providing whispered speech |
| US10509862B2 (en) | 2016-06-10 | 2019-12-17 | Apple Inc. | Dynamic phrase expansion of language input |
| US10586535B2 (en) | 2016-06-10 | 2020-03-10 | Apple Inc. | Intelligent digital assistant in a multi-tasking environment |
| US10067938B2 (en) | 2016-06-10 | 2018-09-04 | Apple Inc. | Multilingual word prediction |
| US10490187B2 (en) | 2016-06-10 | 2019-11-26 | Apple Inc. | Digital assistant providing automated status report |
| DK201670540A1 (en) | 2016-06-11 | 2018-01-08 | Apple Inc | Application integration with a digital assistant |
| DK179415B1 (en) | 2016-06-11 | 2018-06-14 | Apple Inc | Intelligent device arbitration and control |
| DK179343B1 (en) | 2016-06-11 | 2018-05-14 | Apple Inc | Intelligent task discovery |
| DK179049B1 (en) | 2016-06-11 | 2017-09-18 | Apple Inc | Data driven natural language event detection and classification |
| US10593346B2 (en) | 2016-12-22 | 2020-03-17 | Apple Inc. | Rank-reduced token representation for automatic speech recognition |
| DK179745B1 (en) | 2017-05-12 | 2019-05-01 | Apple Inc. | SYNCHRONIZATION AND TASK DELEGATION OF A DIGITAL ASSISTANT |
| DK201770431A1 (en) | 2017-05-15 | 2018-12-20 | Apple Inc. | Optimizing dialogue policy decisions for digital assistants using implicit feedback |
| US10431203B2 (en) | 2017-09-05 | 2019-10-01 | International Business Machines Corporation | Machine training for native language and fluency identification |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4829580A (en) * | 1986-03-26 | 1989-05-09 | Telephone And Telegraph Company, At&T Bell Laboratories | Text analysis system with letter sequence recognition and speech stress assignment arrangement |
| JPH085213B2 (en) * | 1987-03-04 | 1996-01-24 | ブラザー工業株式会社 | Printer |
| US4992957A (en) * | 1988-03-17 | 1991-02-12 | Seiko Epson Corporation | Printer and method for utilizing character codes and control codes within a printer |
| GB8810387D0 (en) * | 1988-05-03 | 1988-06-08 | Altham D R S | Printer control device |
| JP2615137B2 (en) * | 1988-06-13 | 1997-05-28 | 三田工業株式会社 | Printing device |
| US5062143A (en) * | 1990-02-23 | 1991-10-29 | Harris Corporation | Trigram-based method of language identification |
| US5293466A (en) * | 1990-08-03 | 1994-03-08 | Qms, Inc. | Method and apparatus for selecting interpreter for printer command language based upon sample of print job transmitted to printer |
| US5165014A (en) * | 1990-09-12 | 1992-11-17 | Hewlett-Packard Company | Method and system for matching the software command language of a computer with the printer language of a printer |
| JP2661416B2 (en) * | 1991-06-29 | 1997-10-08 | ブラザー工業株式会社 | Printing system |
| JP2875670B2 (en) * | 1991-12-02 | 1999-03-31 | キヤノン株式会社 | Output control device and output control method thereof |
| US5222200A (en) * | 1992-01-08 | 1993-06-22 | Lexmark International, Inc. | Automatic printer data stream language determination |
-
1992
- 1992-01-24 US US07/825,479 patent/US5392419A/en not_active Expired - Fee Related
- 1992-08-20 CA CA002076464A patent/CA2076464C/en not_active Expired - Fee Related
- 1992-11-02 EP EP92118745A patent/EP0558804B1/en not_active Expired - Lifetime
- 1992-11-02 DE DE69229626T patent/DE69229626T2/en not_active Expired - Fee Related
- 1992-11-06 TW TW081108886A patent/TW202508B/en active
-
1993
- 1993-01-21 KR KR1019930000765A patent/KR100256458B1/en not_active IP Right Cessation
- 1993-01-25 JP JP00985693A patent/JP3485588B2/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| JP3485588B2 (en) | 2004-01-13 |
| US5392419A (en) | 1995-02-21 |
| JPH0619720A (en) | 1994-01-28 |
| TW202508B (en) | 1993-03-21 |
| DE69229626T2 (en) | 1999-11-11 |
| KR100256458B1 (en) | 2000-05-15 |
| EP0558804A3 (en) | 1994-04-20 |
| KR930016864A (en) | 1993-08-30 |
| DE69229626D1 (en) | 1999-08-26 |
| CA2076464A1 (en) | 1993-07-25 |
| EP0558804B1 (en) | 1999-07-21 |
| EP0558804A2 (en) | 1993-09-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2076464C (en) | Language identification system and method for a peripheral unit | |
| US5555435A (en) | Automatic language boundary identification for a peripheral unit that supports multiple control languages | |
| US5293466A (en) | Method and apparatus for selecting interpreter for printer command language based upon sample of print job transmitted to printer | |
| US6175834B1 (en) | Consistency checker for documents containing japanese text | |
| KR970007280B1 (en) | Method for character recognition and data processing system | |
| EP2228743A1 (en) | Method for detecting new malicious executables, based on discovering and monitoring characteristic system call sequences | |
| US20230087540A1 (en) | Communication permission list generation device, communication permission list generation method, and non-transitory computer readable-medium | |
| CN113535458B (en) | Abnormal false alarm processing method and device, storage medium and terminal | |
| CN115269288A (en) | Fault determination method, device, equipment and storage medium | |
| JP2875670B2 (en) | Output control device and output control method thereof | |
| CN112084489A (en) | Suspicious application detection method and device | |
| CN1055553C (en) | Lancuage identification system and method for a peripheral unit | |
| CN112073360A (en) | Detection method, device, terminal equipment and medium for hypertext transmission data | |
| CN113239346B (en) | Method and system for operation maintenance based on information security | |
| KR102468156B1 (en) | Apparatus, method, computer-readable storage medium and computer program for calculating priority of targets in response to cyber threats | |
| CN117093996B (en) | Safety protection method and system for embedded operating system | |
| CN114860673B (en) | Log feature identification method and device based on dynamic and static combination | |
| JP3161107B2 (en) | Character recognition device | |
| CN116170241A (en) | Intrusion detection method, system and equipment of industrial control system | |
| US20070192856A1 (en) | Method and apparatus for network security | |
| CN117950962A (en) | Abnormal call identification method, device, electronic equipment and medium | |
| CN114139707A (en) | Equipment data acquisition platform | |
| CN112199947A (en) | Method and device for detecting program name broad | |
| CN116866241A (en) | Internet of things terminal detection method, system and storage medium based on DPI | |
| CN117494224A (en) | File analysis method, device, equipment and medium based on information intelligent check |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed |