Trie based method for indexing handwritten databases
US5528701A · kind A · utility
Assignee
Inventor
Key dates
| Filing date | Sep 2, 1994 |
| Grant date | Jun 18, 1996 |
| Priority date | — |
| Expiry date | Sep 2, 2014 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06V30/2276
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method is disclosed for matching input data representing a continuous combination of input objects to a plurality of objects in a trie database structure. This data structure has a plurality of nodes partitioned into a plurality of levels. Each node in the Trie includes a plurality of elements where each element corresponds to a respective one of the component objects. In addition, a hidden Markov model corresponding to the component object is associated with the element in the database. According to the method, the input object is applied to each of the hidden Markov models associated with the respective plurality of elements of a node to generate a respective plurality of acceptance values. The element which generates the largest acceptance value is identified with a segment of the input data. The component object for this element is recorded and the identified segment is deleted from the input data string. These steps are repeated at successive levels of the Trie data structure until each segment of the input data has been identified with an element of a node of the Trie data structure. The input data is matched with the objects stored in the database by concatenating the comp…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.