Abstract:
The invention refers to a method for text recognition, wherein the method is executed by a processor of a computing device and comprises steps of providing a confidence matrix, wherein the confidence matrix is a digital representation of an input sequence, entering a regular expression, searching for a symbol sequence of the input sequence that matches the regular expression, wherein a score value is computed by the processor using confidence values of the confidence matrix, wherein the score value is an indication of the quality of the matching between the symbol sequence of the input sequence and the regular expression. Further, the invention relates to a computer program product which when executed by a processor of a computing device performs the method.

Description:
[0001]    The disclosure relates to a method for text recognition and a computer program product. 
       BACKGROUND 
       [0002]    Computer aided information retrieval out of historical manuscripts or other document types as well as from sequences of spoken text is still very difficult and limited. 
         [0003]    A direct search based on sample sequences is a very slow procedure and does not generalize to other writing styles or other accents in speech. A search based on pre-transcribed computer code (e.g. ASCII) is fast, but it requires an expensive (time and human resources) and error-prone manual transcription process. 
         [0004]    The document A. Graves, et al., “A Novel Connectionist System for Unconstrained Handwriting Recognition”, IEEE Transactions of pattern analysis and machine intelligence, vol. 31, no. 5, May 2009 discloses a method for recognizing unconstrained handwritten text. The approach is based on a recurrent neural network which is designed for sequence labeling task where the data is hard to segment and contains long-range bidirectional interdependencies. 
         [0005]    Document US 2009/0077053 A1 discloses a method for searching a term in a set of ink data. The method includes an operation for converting ink data into intermediate data in an intermediate format in the form of at least one segmentation graph. Each node of the graph includes at least one ink segment associated with at least one assumption of correspondence with a recognition unit. The method further includes an operation for searching for the term carried out on the intermediate data. 
       SUMMARY 
       [0006]    It is an object to provide improved technologies for text recognition. 
         [0007]    A method for text recognition according to independent claim  1  and a computer program product according to independent claim  9  are provided. Further embodiments are subject matter of dependent claims. 
         [0008]    In one aspect, a method for text recognition is provided. The method is executed by a processor of a computing device and comprises steps of: providing a confidence matrix, wherein the confidence matrix is a digital representation of an input sequence, entering a regular expression, and searching for a symbol sequence of the input sequence that matches the regular expression, wherein a score value is computed by the processor using confidence values of the confidence matrix, wherein the score value is an indication of the quality of the matching between the symbol sequence of the input sequence and the regular expression. The step of searching is performed on the confidence matrix. In other words, the regular expression can be applied directly on the confidence matrix for decoding the symbol sequence. 
         [0009]    In another aspect, a computer program product is disclosed, wherein the computer program product is adapted to perform the steps of the method when executed by a processor of a computing device. The computer program product can be stored on a non-transitory medium. 
         [0010]    A confidence matrix (also called ConfMat) is a 2-dimensional matrix of arbitrary length, containing a vector of dimension N at each position at the horizontal axis (x-axis or t-axis). Each vector element corresponds to a certain symbol channel. For example, in case the digits 0 to 9 are encoded, N=10 symbol channels are needed. An additional channel may be introduced, the NaC-channel (Not a Character-channel). The NaC-channel represents the complement of all other coded symbol channels (e g unknown symbols or symbol transitions). Each horizontal position within the matrix corresponds to a certain position of the input sequence. This can be a 1:1 mapping or a 1:S mapping, wherein matrix column x corresponds to input sequence position x*S. S is called the subsampling factor. 
         [0011]    A confidence value is a real number value correlated to the confidence or even probability for a certain symbol at the corresponding position in the input sequence. The higher the confidence value, the higher or more assured is the classifier (e.g. a classifier module) to “see” a certain symbol at the specific sequence position. The confidence value may be a pseudo-probability. Such estimation of a probability allows a clean mathematical treatment. Also, other confidence values can be used. 
         [0012]    A regular expression (also called RegEx) is a sequence of characters, describing a set of strings, forming search patterns with strings, e.g. for string matching or “find and replace” operations. Each character in a regular expression can be either understood to be a metacharacter with its special meaning, or a regular character with its literal meaning. The pattern sequence itself is an expression that is a statement in a language designed specifically to represent prescribed targets in the most concise and flexible way to direct the automation of text processing of general text files, specific textual forms, or of random input strings. 
         [0013]    The input sequence can be provided in form of written text or spoken text. The step of providing the confidence matrix can include transforming a written text or a spoken text into the confidence matrix, for example using a classifier module. The written text can be provided by scanning a document in order to provide a digital version of the text. The document may comprise hand-written text. The spoken text can be provided as an audio file. 
         [0014]    The input sequence can comprise one or more symbols. Several symbols may form a symbol sequence. The symbol may comprise a letter (e.g. A to Z, a to z), a numerical digit (e.g. 0 to 9), a punctuation mark (such as “.”, “?” or “−”), a control sign (e.g. “@”) and a whitespace. 
         [0015]    The regular expression can comprise one or more embedded dictionaries. The embedded dictionary provides one or more terms and can be considered as a placeholder. It may contain any string. For example, the dictionary may comprise a list of cities. The cities can be included in the regular expression via the dictionary. 
         [0016]    The regular expression may comprise a regular expression group (also called RegEx-group). The regular expression may define labeled regions in the regular expression for parsing on the confidence matrix. A RegEx-group is a subsequence of characters between a left and a right parenthesis. The RegEx-group may be labeled, so that the subsequence can be accessed in the workflow by its label. The regular expression can comprise several RegEx-groups, which may be labeled. For example, a regular expression group may be defined as RegEx=“(?&lt;HNr&gt;[0-9]{1,4}[A-Za-z]?) ?(?&lt;street&gt;[[:dictStreet:]])”. An address like “14 A Hamburger Straβe” may be handwritten without gaps between the address parts (thus handwritten “14AHamburgerStraβe”). Using the regular expression, this address will be correctly identified as HNr. (house number):  14 A and street name: Hamburger Straβe. There will be no wrong recognition as HNr.:  14  and street name “AHamburger Straβe”. A parsing of the address without the regular expression group is not possible. For analyzing and labeling the elements of the address, the regular expression including the dictionary is necessary. This allows a direct search for the “best” symbol sequence for a given confidence matrix. 
         [0017]    The confidence matrix may be a digital representation of a structured or semi-structured input sequence. The method may further comprise a step of parsing the structured or semi-structured input sequence using the regular expression. RegEx-Groups are a powerful parsing tool for structured and semi-structured text. The method may provide corresponding subsequences for all defined RegEx-Groups, facilitating an intelligent parsing of the input sequence into relevant sub-components. The method may further comprise a step of labeling the input sequence, wherein a score value is assigned to each element of the input sequence. 
         [0018]    Structured data has a unique data model. Single elements of the structured data can be labeled directly. For example, in a table, each column has its label. Semi-structured data can be brought into a structured form using a grammar and a lexis. After structuring the semi-structured data, single elements can be labeled. 
         [0019]    Whether data is structured, semi-structured or even unstructured has no influence on the confidence matrix. However, it has an influence of the decoding, namely the evaluation of the confidence matrix using the regular expression. The structure of the data may comprise so-called constraints for the decoding. With other words, only possible but no senseless tags are “allowed”. These decoding conditions are formulated using the regular expression. The regular expression is necessary for decoding semi-structured data because type and number of the identifying elements are not known a priori. 
         [0020]    A RegEx can be a simple string, in case it represents a specific word, or a complex expression including one or several embedded dictionaries and/or RegEx-groups in case a sequence with a complex pattern shall be parsed (e.g. for postal address, email addresses, date and time, etc). Valid matches can be provided as a list sorted by scores. RegEx-groups can represent subsequences and, therefore, support very complex parsing schemes. RegEx-groups can be used to reproduce the content of the input sequence associated with the group. For example, a RegEx-group may comprise five digits (e.g. a postal code). All examples of five digits found in the input sequence can be reproduced via the RegEx-group. 
         [0021]    The method may further comprise transcribing the input sequence into a symbol sequence or a character-encoding scheme. For example, the input sequence can be transcribed in an ASCII text (ASCII—American Standard Code for Information Interchange). The transcription may be performed context-sensitive and/or based on one or more dictionaries. 
         [0022]    The method is very fast and fault-tolerant. It does not require any manual transcription of content. It enables very complex search approaches using regular expressions, for example including embedded dictionaries and RegEx-Groups, like email addresses, phone numbers, clearing limits in radio communication etc. Parsing, namely splitting a sequence of characters into relevant components, of structured and semi-structured written and spoken input sequences may be applied for e.g. forms, addresses, radio communication between pilots and controllers, etc. In many cases a proper identification of relevant sub-components of an entire sequence (e.g. an email address within an entire text) can only be done based on the results of a recognition (one needs to know the symbol sequence to detect an email address). But without having good constraints a decoding of a sequence into symbols is often erroneous (“free recognition”) in comparison to a constraint decoding (e.g. when it is already known that the sequence should be an email address). Using the regular expression including RegEx-Groups, structured and semi-structured sequences can be parsed into relevant sub-components (e.g. an address can be parsed into zip code, city, street, house number, etc). 
         [0023]    The regular expression can be transformed to a graph based model represented by a finite state automaton. A finite state automaton is a graphical model describing the behavior of a system by means of states and transitions. There exists a duality between finite state automaton and regular expressions. For each finite state automaton there exists a regular expression and vice versa. For example, the regular expression may be transformed to a non-deterministic finite state automaton, e.g. by using Thompson&#39;s algorithm. Alternatively, a deterministic model for a finite state automaton may be applied. There are other algorithms in place to transform a regular expression into a finite state automaton. The finite state automaton may be implemented as a finite state transducer. The finite state transducer may comprise a finite set of states, a finite input alphabet, a finite output alphabet, a set of initial states being a subset of the set of states, a set of final states being another subset of the set of states, and a transition relation. The finite state can be weighted. It can be interpreted as a weighted automaton covering the whole process, where each transition at each time point t is weighted by the probabilities of the most likely sequences of emissions using that arc of the automaton at time t. 
         [0024]    The graph based model may be implemented by dynamic programming. Dynamic programming is a method for solving complex problems by breaking them down into simpler sub-problems. The graphical model may define all allowed transitions. For example, based on Viterbi&#39;s principle all paths with the highest probabilities can be calculated along the edges of the graphical model. 
         [0025]    The confidence matrix can be stored on a memory of the computing device. The regular expression may be entered by an input device, for example a keyboard, a mouse or a touch sensitive screen. Alternatively, the regular expression may be entered by receiving the regular expression from another computing device, e.g. via a wired or wireless connection between the computing device and the other computing device. 
         [0026]    The method may comprise a step of outputting the score value. The score value can be outputted to an output device, for example a display device or a printing device. 
         [0027]    The disclosure refers to the usage of a computing device. The computing device may comprise one or more processors configured to execute instructions. Further, the computing device may comprise a memory in form of volatile memory (e.g. RAM—random access memory) and/or non-volatile memory (e.g. a magnetic hard disk, a flash memory or a solid state device). The computing device may further comprise means for connecting and/or communicating with other (computing) devices, for example by a wired connection (e.g. LAN local area network, Firewire (IEEE 1394) and/or USB—universal serial bus) or by a wireless connection (e.g. WLAN—wireless local area network, Bluetooth and/or WiMAX—Worldwide Interoperability for Microwave Access). The computing device may comprise a device for registering user input, for example a keyboard, a mouse and/or a touch pad. The computing device may comprise a display device or may be connected to a display device. The display device may be a touch-sensitive display device (e.g. a touch screen). 
     
    
     
       DESCRIPTION OF EMBODIMENTS 
         [0028]    In the following, exemplary embodiments are disclosed with reference to figures of a drawing. 
           [0029]      FIG. 1  shows an example for a confidence matrix. 
           [0030]      FIG. 2  shows a flow diagram for a method for text recognition. 
           [0031]      FIG. 3  shows further steps of the method for text recognition. 
           [0032]      FIG. 4  shows an example for a graph model representation. 
           [0033]      FIG. 5  shows a flow diagram for creating a confidence matrix. 
       
    
    
       [0034]      FIG. 1  shows an example of a confidence matrix (ConfMat) of a short script sequence which is shown below the ConfMat. The ConfMat contains the digit-channels (0-9) and the NaC-channel. The darker the field at a position, the higher the confidence for a certain symbol (black equals 1.0 and white equals 0.0). In other embodiments, the confidence matrix may additionally contain a set of letters, e.g. A to Z as well as a to z, punctuation marks and/or control signs. 
         [0035]    In  FIG. 2  a flow diagram for text recognition is shown. In step 1, a confidence matrix of an input sequence is provided. The confidence matrix is a digital representation of the input sequence. The input sequence can be a written text or a spoken text. An input of a regular expression is registered in step 2. In step 3, a symbol sequence that matches the regular expression is searched in the input sequence. For the search, a score value is computed using confidence values of the ConfMat (step 4). 
         [0036]      FIG. 3  shows an exemplary embodiment for recognizing text. An input sequence (e.g. written text or spoken text) is transformed in a confidence matrix  14 . Details for transforming the input sequence are provided below with reference to  FIG. 5 . The confidence matrix comprises all confidences for the occurrence of all symbols of a symbol table (e.g. Latin 2) at a corresponding position of the input sequence. Matching and searching operations of an arbitrary regular expression can be performed on the given ConfMat. As a result of this operation matching scores (e.g. a matching probability) for the best matching result are derived. In addition, results for all labelled RegEx-Groups contained in the RegEx can be provided. For example, all results matching a RegEx-group comprising five digits (e.g. a postal code) can be outputted. All results can be provided as a result list sorted by scores. Scores can be confidences (e.g. pseudo probabilities) or also costs (e.g. negative logarithmic probabilities). As many embedded dictionaries as necessary can be used in the matching procedure. This enables the use of specific vocabularies at certain positions within the RegEx. 
         [0037]    For scoring, a specific cost function based on negative logarithmic probabilities can be used, but also other scoring or cost functions can be used. 
         [0038]    As search expression, a list of regular expressions is entered in step 10. The list may comprise one or more embedded dictionaries and/or RegEx-Groups. A graph based model is generated for the list of regular expressions in step 11, e.g. using Thompson&#39;s algorithm. This results in a graph based model comprising a finite state automaton, e.g. a finite state transducer (step 12). The graph based model and the confidence matrix are inputted in a dynamic programming module  13 . Using, for example, the Viterby algorithm or the CTC algorithm (CTC—Connectionist Temporal Classification) a matching between the elements of the confidence matrix and the regular expression is determined in step 14. The results are outputted as a list in step 15. Confidence values can be provided. The list can be a sorted by the highest confidence. Further, RegEx-Groups can be included for parsing. 
         [0039]    The value to be optimized: 
         [0040]    In one embodiment, the sequence with the highest score (probability) for a given ConfMat and a given regular expression r is provided: 
         [0000]    
       
         
           
             
               
                 s 
                 _ 
               
               = 
               
                 arg 
                  
                 
                     
                 
                  
                 
                   
                     max 
                     
                       s 
                       ∈ 
                       
                         S 
                          
                         
                           ( 
                           r 
                           ) 
                         
                       
                     
                   
                    
                   
                     
                       ∑ 
                       
                         t 
                         = 
                         1 
                       
                       T 
                     
                      
                     
                       c 
                       
                         
                           s 
                           t 
                         
                         , 
                         t 
                       
                     
                   
                 
               
             
             , 
           
         
       
     
         [0000]    in which S(r) is the set of all sequences, which are described by the regular expression r, and t refers to the column in the ConfMat. S(r) may contain specific path treatment depending on the classifier module, e.g. optional NaCs between two symbols or consecutive repeated emissions of symbols in case of a CTC trained system. Using logarithmic probabilities c a,t =ln p (a|y t ) as score values, the final sequence  s  can be calculated as follows: 
         [0000]    
       
         
           
             
               s 
               _ 
             
             = 
             
               
                 arg 
                  
                 
                     
                 
                  
                 
                   
                     max 
                     
                       s 
                       ∈ 
                       
                         S 
                          
                         
                           ( 
                           r 
                           ) 
                         
                       
                     
                   
                    
                   
                     ln 
                      
                     
                       ( 
                       
                         
                           ∏ 
                           
                             t 
                             = 
                             1 
                           
                           T 
                         
                          
                         
                           p 
                            
                           
                             ( 
                             
                               
                                 s 
                                 t 
                               
                               | 
                               
                                 y 
                                 t 
                               
                             
                             ) 
                           
                         
                       
                       ) 
                     
                   
                 
               
               = 
               
                 arg 
                  
                 
                     
                 
                  
                 
                   
                     max 
                     
                       s 
                       ∈ 
                       
                         S 
                          
                         
                           ( 
                           r 
                           ) 
                         
                       
                     
                   
                    
                   
                     p 
                      
                     
                       ( 
                       
                         s 
                         | 
                         y 
                       
                       ) 
                     
                   
                 
               
             
           
         
       
     
         [0000]    In other words,  s  is the sequence with the highest probability. Note that the probabilities at different positions are assumed to be independent. 
       Constructing the Graphical Model: 
       [0041]    There are many algorithms in place to transform a regular expression into a finite state automaton. Thompson&#39;s algorithm can be used for constructing a non-deterministic automaton. A non-deterministic automaton in combination with the Viterbi Approximation is preferred before deterministic models due to lower computing costs and therefore a higher speed. 
       Dynamic Programming: 
       [0042]    The graphical model defines all allowed transitions. Based on Viterbi&#39;s principle all paths with the highest probabilities will be calculated along the edges of the graphical model. The large performance trade-off in comparison to the calculation of many single sequences is based on the fact that only a small number of paths have to be evaluated and stored at each position—independent of the number of possible symbols for that specific transition. 
         [0043]    Expanding finite state automatons by an additional output band leads to finite state transducers. Thus, finite state transducers can model the process if the output band provides the probabilities of the best paths up to the specific position. 
         [0044]    The above described method provides the following advantages:
       fully automatic acquisition of the content of text sequences (e.g. writing and speech),   no transcription errors because all information is stored in the ConfMat,   fast processing of all requests (search and retrieval),   complex requests are possible (e.g. by using regular expressions),   sophisticated technology for content dependent parsing (e.g. by using RegEx-groups),   robust recognition (even transcription) due to the use of embedded dictionaries (constraint recognition) e.g. zip code, city, street in an address or radio communication of pilots.       
 
         [0051]    In the following, an example for performing the method is disclosed. For constructing the graphical model, Thompson&#39;s algorithm is used. The regular expression is the input for this algorithm, as an output it delivers a graph. The edges of the graph define all allowed symbol transitions. After any node an optional node for “seeing” a NaC is inserted. 
         [0052]      FIG. 4  shows an example for the RegEx: [0-9] {5} to represent a 5-digit number (e.g. a zip-code). Accepting states are marked by double circles. 
         [0053]    The dynamic programming module now calculates probabilities along the edges based on the graph and a given ConfMat. For each edge in the graph and each sequence position the probabilities of most likely paths will be calculated. The sequence with the highest probability maximizes all sequence probabilities which reach to an accepted state at position t. 
         [0054]    The sequence with the highest probability for a specific edge is calculated based on sequences with highest probabilities of previous edges multiplied with the ConfMat entry with the highest score value (largest emission probability of a symbol at time t). Thereby, we have to consider, that we do not construct any path emitting the same label at time t−1 and time t, except when the same edge is used. For the same reason, a sequence can spread the emission of symbols over several time steps and stay in the same arc as shown below. 
         [0055]    For the exemplary ConfMat shown in  FIG. 1 , the following table for the path with the highest probability results: 
         [0000]    
       
         
               
               
               
               
               
               
               
               
               
               
               
             
               
               
               
               
               
               
               
               
               
               
               
             
           
               
                   
               
               
                 Time 
                 1 
                 2 
                 3 
                 4 
                 5 
                 6 
                 7 
                 8 
                 9 
                 10 
               
               
                   
               
             
             
               
                   
               
             
          
           
               
                 State 
                 1 
                 1 
                 2 
                 4 
                 5 
                 6 
                 8 
                 10 
                 11 
                 11 
               
               
                 Prob- 
                 1.0 
                 0.8 
                 0.48 
                 0.432 
                 0.347 
                 0.31 
                 0.249 
                 0.2 
                 0.16 
                 0.16 
               
               
                 abil- 
               
               
                 ity 
               
               
                   
               
             
          
         
       
     
         [0056]    For example, the probability of state 1 at time 2 as probability that NaC (edge (0, 1)) is active by 2 time steps. In this case, the system is using the same edge and therefore has to emit the same label. 
         [0057]    The largest probability of the edge (2,4) at time t is calculated as: 
         [0000]    
       
         
           
             
                 
             
              
             
               
                 
                   WK 
                   
                     ( 
                     
                       2 
                       , 
                       4 
                     
                     ) 
                   
                 
                  
                 
                   ( 
                   t 
                   ) 
                 
               
               = 
               
                 
                   max 
                   
                     a 
                     ∈ 
                     
                       { 
                       
                         0 
                         , 
                         … 
                         , 
                         9 
                       
                       } 
                     
                   
                 
                  
                 
                   
                     WK 
                     
                       ( 
                       
                         2 
                         , 
                         4 
                       
                       ) 
                     
                     a 
                   
                    
                   
                     ( 
                     t 
                     ) 
                   
                 
               
             
           
         
       
       
         
           
             
               
                 
                   WK 
                   
                     ( 
                     
                       2 
                       , 
                       4 
                     
                     ) 
                   
                 
                  
                 
                   ( 
                   t 
                   ) 
                 
               
               = 
               
                 max 
                 ( 
                 
                   
                     
                       max 
                       
                         e 
                         ∈ 
                         
                           { 
                           
                             
                               ( 
                               
                                 0 
                                 , 
                                 2 
                               
                               ) 
                             
                             , 
                             
                               ( 
                               
                                 1 
                                 , 
                                 2 
                               
                               ) 
                             
                           
                           } 
                         
                       
                     
                      
                     
                       
                         max 
                         
                           a 
                           ∈ 
                           
                             { 
                             
                               0 
                               , 
                               … 
                               , 
                               9 
                             
                             } 
                           
                         
                       
                        
                       
                         
                           
                             WK 
                             e 
                             a 
                           
                            
                           
                             ( 
                             
                               t 
                               - 
                               1 
                             
                             ) 
                           
                         
                         · 
                         
                           
                             max 
                             
                               
                                 l 
                                 ∈ 
                                 
                                   { 
                                   
                                     0 
                                     , 
                                     … 
                                     , 
                                     9 
                                   
                                   } 
                                 
                               
                               , 
                               
                                 l 
                                 ≠ 
                                 a 
                               
                             
                           
                            
                           
                             y 
                             
                               l 
                               , 
                               t 
                             
                           
                         
                       
                     
                   
                   , 
                   
                     
                       max 
                       
                         a 
                         ∈ 
                         
                           { 
                           
                             0 
                             , 
                             … 
                             , 
                             9 
                           
                           } 
                         
                       
                     
                      
                     
                       ( 
                       
                         
                           
                             WK 
                             
                               ( 
                               
                                 2 
                                 , 
                                 4 
                               
                               ) 
                             
                             a 
                           
                            
                           
                             ( 
                             
                               t 
                               - 
                               1 
                             
                             ) 
                           
                         
                         · 
                         
                           y 
                           
                             a 
                             , 
                             t 
                           
                         
                       
                       ) 
                     
                   
                 
                 ) 
               
             
             , 
           
         
       
     
         [0058]    at which WK (i,j) (t) equals the probability of the most likely path via (i,j) at time t, WK (i,j)   a (t) equals the probability of the most likely path via (i,j) at time t emitting symbol a at last, and l (i,j) (t) represents the most likely emitted label at time t via (i,j). It is not sufficient for reaching the evidential optimum (see above) to calculate only the path with the highest probability. The probabilities WK (i,j)   a (t) of next likely paths also have to be considered at each time step, although restricting to the best two paths may be a reasonable approximation in practice. 
         [0059]    In the following, an example for a complex regular expression is provided and features of the regular expression are discussed: 
         [0000]      RegEx=“(?&lt;glabel1&gt;[A-Za-zÄÖÜäöüβ]+)(|,)(?&lt;glabel2&gt;[[:dictID1:]])?((|,|;)(?&lt;glabel3&gt;[0-9]+)){5,8}[K-S]{3,5}?(foo|bar).*”;
 
         [0060]    This RegEx consists of 7 groups or in other words, it is made up by 7 pairs of brackets, where 3 pairs are labelled. The syntax for labelling a group is: (?&lt;name&gt;). 
         [0061]    The group named glabel1 describes strings constructed from upper and lower case letters and special characters from the German alphabet—expressed by “[A-Za-zÄÖÜäöüβ]”, which can occur several times—expressed by “+”. In case one likes to limit the number of repetitions this can for example be expressed by [K-S] {3,5}, this represents a string of 3 to 5 characters between K and S. 
         [0062]    The group glabel2 contains a dictionary with the ID dictID1. A dictionary is a predefined list of words given to the decoder in advance. 
         [0063]    Arbitrary characters can be expressed by the character “.”, in case of an arbitrary number of repetitions the “.” is followed by a “*”, “.*” describes a completely arbitrary string (also an empty string). 
         [0064]    In  FIG. 5  a workflow for creating a confidence matrix is shown. An input sequence  20  (e.g. written text or spoken text) will by transformed by a sequence processing module  21  into a sequence of confidence vectors (e.g. containing pseudo probabilities). Each matrix column (confidence vector) contains the confidences for all symbol channels (and if necessary the additional NaC-channel) for a specific position of the input sequence. The specific NaC-channel is always active if at a certain position occurs an unknown symbol or a transition between symbols. 
         [0065]    The ConfMat  22  is the result of this fully automatic coding process. The ConfMat is very compact (up to 50 times in comparison to the input sequence) and can be stored as an abstract representation of the content of the input sequence. 
         [0066]    For training purposes a training target  23  can be provided, e.g. a string representation of the input sequence. The training target  23  can be transmitted to a training module  24  which can interact with the sequence processing module  21 . 
         [0067]    A confidence matrix can be created by the following steps: Construction of an input sequence by means of pre-processing and normalization of the original sequence (e.g. mean-variance normalization, Gabor Filtering). This results in a 2 dimensional input matrix. The input sequence is processed using a Convolutional Neural Network (CNN) containing one specific output neuron for each corresponding symbol channel. The output of the CNN will be collapsed (by summing up all values of the same channel) in y-dimension (orthogonal to sequence direction), the N channel neurons are the “new” y-dimension of the output. By means of a softmax activation function all activations of the output neurons at a certain sequence position will be normalized. The result is the ConfMat. 
         [0068]    In training mode the following additional steps can be performed: calculation of an error gradient, based on a string representation of the expected output for the given sequence by means of the CTC algorithm (Connectionist Temporal Classification), the CNN will be trained using stochastic gradient descent algorithm based on the calculated error gradient. 
         [0069]    The above described implementation is one embodiment to create a ConfMat from digital sequences. There are other classifiers in place able to perform similar steps (e.g. Support Vector Machines, recurrent neural networks (RNN)), but all of them need to perform the described operation to map a digital input sequence of feature vectors to a corresponding output sequence of confidence vectors. 
         [0070]    The features disclosed in the specification, the claims and the figures can be relevant either alone or in any combination with each other for implementing embodiments.