A method using a recognizer program structure is used in a program that is learned over training data. The method includes (a) for each vector in an input tuple of vectors, (i) mapping the vector to one of a domain index; (ii) using the domain index to select one or more corresponding linear transformations; (iii) applying one or more of the selected linear transformations on the vector to obtain a resulting vector in a first intermediate space; and (iv) applying a predetermined function on each element of the resulting vector to obtain an output vector in a second intermediate space; and (b) mapping the resulting vectors of the second intermediate space by linear transformation to obtain an output tuple of vectors in RN space.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. In a recognizer program structure of a program that is learned over training data, the recognizer program structure receiving an input tuple of vectors in RN space, N being an integer, a method comprising: for each vector in the input tuple of vectors: mapping the vector to one of a domain index; using the domain index to select a corresponding linear transformation; applying the selected linear transformation on the vector to obtain a resulting vector in a first intermediate space; and applying a predetermined function on each element of the resulting vector to obtain an output vector in a second intermediate space; and mapping the resulting vectors of the second intermediate space by linear transformation to obtain an output tuple of vectors in RN space. 2. The method of claim 1, wherein the domain index is represented as one of a predetermined number of values which is a power of two. 3. The method of claim 1, wherein the corresponding linear transformation is selected from a predetermined number of linear transformations. 4. The method of claim 3, wherein each of the linear transformations is expressed in the form of a matrix. 5. The method of claim 3, wherein the linear transformations are presented in the form of a single matrix. 6. The method of claim 1, wherein a vector in the second intermediate space has twice the number of elements as a vector of the first intermediate space. 7. The method of claim 6, wherein the predetermined function provides, when an i-th element of a vector in the first intermediate space has a positive value x, values 0 and x at the (2*i)-th and the (2*+1)-th positions of the resulting vector in the second intermediate space, respectively, and the values x and 0 in those positions otherwise. 8. The method of claim 7, wherein the predetermined function represents a threshold function. 9. The method of claim 1, wherein the first intermediate space and the second intermediate space are the same. 10. The method of claim 1, mapping the resulting vectors in the second intermediate space comprises selecting a second corresponding linear transformation using the domain index.