Patent · US Expired

Method of optimizing an N-gram memory structure

US5966709A · kind A · utility

34Cited by
8References
10Claims
0Family size

Assignee

Inventors

Key dates

Filing dateSep 26, 1997
Grant dateOct 12, 1999
Priority date
Expiry dateSep 26, 2017

Classification

  • Technology area (CPC Y)Emerging Cross-Sectional Technologies
  • CPC primaryY10S707/99942
  • WIPO fieldBasic communication processes
  • WIPO sectorElectrical engineering

Abstract

By placing a low cardinality node or a leaf in a lower level, and a high cardinality node or a leaf at a higher level, an optimal memory structure is automatically generated which yields the best compression within N-gram technology. After making an initial list of parallel streams or fields, the streams are ordered in accordance with increasing cardinality. Adjacent streams (fields), or nodes, are paired, and the children of the resulting node are eliminated from the list, while a new parent node is added to the list. The resulting new list is re-arranged from right to left as a function of increasing cardinality, and the pairing steps are repeated until a single root node is remains for the final memory structure.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.