Recognition system using lexical trees
US7035802B1 · kind B1 · utility
20Cited by
6References
22Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jul 31, 2000 |
| Grant date | Apr 25, 2006 |
| Priority date | — |
| Expiry date | May 25, 2022 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG10L15/08
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The dynamic programming technique employs a lexical tree that is encoded in computer memory as a flat representation in which the nodes of each generation occupy contiguous memory locations. The traversal algorithm employs a set of traversal rules whereby nodes of a given generation are processed before the parent nodes of that generation. The deepest child generation is processed first and traversal among nodes of each generation proceeds in the same topological direction.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.