Method and System for Information Recognition

• US 20140156273A1
• Filed: 06/08/2013
• Published: 06/05/2014
• Est. Priority Date: 01/31/2011
• Status: Active Grant

• Current Assignee: Walter Steven Rosenbaum
• Original Assignee: Walter Steven Rosenbaum
• Inventors: Rosenbaum, Walter Steven, Bach, Joern
• Granted Patent: US 9,058,809 B2
• Time in Patent Office: Days
• US Class Current: 704/243
• CPC Class Codes: G06F 16/211 Schema design and management
• CPC Class Codes: G06F 16/60 of audio data
• CPC Class Codes: G06F 16/61 Indexing; Data structures therefor; Storage structures
• CPC Class Codes: G06F 16/901 Indexing; Data structures therefor; Storage structures for retrieval from the web G06F16/951
• CPC Class Codes: 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
• CPC Class Codes: G10L 15/26 Speech to text systems G10L15/08 takes precedence
• CPC Class Codes: G10L 15/32 Multiple recognisers used in sequence or in parallel; Score combination systems therefor, e.g. voting systems
• CPC Class Codes: G10L 2015/228 of application context

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

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.

2. 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.

3. 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.

4. 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.

5. 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.

6. 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.

7. 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.

8. 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.

9. 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.

10. 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.

11. 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.

12. 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.

13. 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.

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

15. 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.

16. 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.

17. 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.