# US 2014/0156273 A1 · Method and System for Information Recognition > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2014/0156273 A1 - Document ID: US20140156273A1 - Status: Published application - Kind: A1 - Application number: 13/913,434 - Filed: 2013-06-08 - Published: 2014-06-05 - Earliest claimed: 2011-01-31 - Assignees: Walter Steven Rosenbaum - Inventors: Walter Steven Rosenbaum; Joern Bach - Web page: https://patentgrep.com/patent/US20140156273A1 ## CPC - G10L 15/06: Creation of reference templates; Training of speech recognition systems, e.g. adaptation to the characteristics of the speaker's voice (G10L15/14 takes precedence) - G06F 16/211: {Schema design and management} - G06F 16/60: of audio data - G06F 16/61: Indexing; Data structures therefor; Storage structures - G06F 16/901: Indexing; Data structures therefor; Storage structures (for retrieval from the web G06F16/951) - G10L 15/26: Speech to text systems (G10L15/08 takes precedence) - G10L 15/32: Multiple recognisers used in sequence or in parallel; Score combination systems therefor, e.g. voting systems - G10L 2015/228: {of application context} - G10L: SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract A system and a method perform information recognition. The method arranges data base information in a data base information structure. The method matches input information to the data base information using at least one matching algorithm and using a matching information structure. In accordance with the system and the method, the matching information structure differs from the data base information structure. ## Claims ### Claim 1 A method for information recognition, wherein input information is matched to data base information stored in a data base by at least one matching algorithm, before the match the data base information being arranged in the data base in a data base information structure, the method comprising: rearranging the data base information from the data base information structure into a matching information structure which differs from the data base information structure; and applying the at least one matching algorithm to the data base information and matching the input information to the rearranged data base information. ### Claim 2 (depends on 1) The method according to claim 1, wherein the data base information structure is an order of entries of the data base information in the data base, the matching information structure being achieved by rearranging the entries in the data base. ### Claim 3 (depends on 1) The method according to claim 1, wherein the data base information structure is an order of entries of the data base information in the data base, the matching information structure being achieved by accessing the entries, for the purpose of matching, in a matching order. ### Claim 4 (depends on 1) The method according to claim 1, wherein the input information is information in at least one of voice information, optical pattern information, written information, and numeric information. ### Claim 5 (depends on 1) The method according to claim 1, wherein: the data base information is rearranged into a plurality of information subsets; the input information is matched with each subset; and each information subset match results in a candidate set of match candidates. ### Claim 6 (depends on 5) The method according to claim 5, wherein the data base information is divided into the subsets, only the sum of all subsets comprising the complete data base information. ### Claim 7 (depends on 5) The method according to claim 5, wherein the data base information is rearranged from the data base information structure into the subsets, each subset containing the complete data base information in the a matching information structure. ### Claim 8 (depends on 5) The method according to claim 5, wherein: the input information is matched in a first match with each information subset, each subset match resulting in a candidate set of match candidates; and the input information is matched in a second match with some or all of the match candidates retrieved in the first match. ### Claim 9 (depends on 8) The method according to claim 8, wherein the input information being matched in one or more further matches with the match candidates of the respective preceding step. ### Claim 10 (depends on 1) The method according to claim 1, wherein after rearranging the data base information from the data base information structure into the matching information structure the rearranged data base information is distributed into a plurality of information subsets, the input information being matched with each subset, each information subset match resulting in a candidate set of match candidates. ### Claim 11 (depends on 1) The method according to claim 1, wherein after the matching which results in a candidate set of match candidates, the method further comprises: determining whether one of the candidates resulting from the matching is acceptable as a final result; and if no candidate is acceptable as a final result, repeating the step of matching the input information to the rearranged data base information with at least one of the found candidates used as new data base information. ### Claim 12 (depends on 1) The method according to claim 1, wherein: the step of rearranging performs an algorithm that addresses the relationship between entries of the data base information by quantifying a degree of similarity between the entries and rearranging the entries in a way that is a function of the degree of similarity. ### Claim 13 (depends on 1) The method according to claim 1, wherein: the step of rearranging performs an algorithm that addresses the relationship between entries of the data base information, which are elements in a word list, by quantifying a degree of similarity between the entries by measuring the relevant phonetic distance between the entries and rearranging the entries in a way that is a function of the degree of similarity. ### Claim 14 A system for information recognition with a data base containing data base information being stored in the data base in a data base information structure comprising: at least one matching means containing at least one matching algorithm as computer program; and a rearranging means to rearrange the data base information into a matching information structure ### Claim 15 (depends on 14) The system according to claim 14, wherein: the rearranging means is prepared to restructure the data base information into information subsets and to feed the subsets to the at least one matching means for matching the input information with each information subset, each subset match resulting in a candidate set of match candidates. ### Claim 16 (depends on 14) The system according to claim 14, wherein: the rearranging means comprises an algorithm for addressing the relationship between entries of the data base information by quantifying a degree of similarity between the entries and for rearranging the entries in a way that is a function of the degree of similarity. ### Claim 17 (depends on 14) The system according to claim 14, wherein: the rearranging means comprises an algorithm for addressing the relationship between entries of the data base information, which are elements in a word list, by quantifying a degree of similarity between the entries by measuring the relevant phonetic distance between the entries and for rearranging the entries in a way that is a function of the degree of similarity.