The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Sep. 27, 2011

Filed:

Jun. 26, 2008
Applicants:

Stelios Paparizos, San Jose, CA (US);

Christopher Walter Anderson, Redmond, WA (US);

Wei Liu, Bellevue, WA (US);

Ajay Nair, Redmond, WA (US);

Alexandros Ntoulas, Mountain View, CA (US);

Naga Srinivas Vemuri, Redmond, WA (US);

Inventors:

Stelios Paparizos, San Jose, CA (US);

Christopher Walter Anderson, Redmond, WA (US);

Wei Liu, Bellevue, WA (US);

Ajay Nair, Redmond, WA (US);

Alexandros Ntoulas, Mountain View, CA (US);

Naga Srinivas Vemuri, Redmond, WA (US);

Assignee:

Microsoft Corporation, Redmond, WA (US);

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06F 7/00 (2006.01); G06F 17/00 (2006.01); G06F 13/14 (2006.01);
U.S. Cl.
CPC ...
Abstract

Compression of extensive, rule-based grammars used to facilitate search queries is provided herein. Rule-based grammars includes a list of rules that each comprise a sequence of token classes. Each token class is a logical grouping of tokens, and each token is a string of characters. A grammar is parsed to identify rules and token classes. Unimportant token classes are identified and sets of unimportant token classes are merged to generated merged token classes. A compressed grammar is generated by substituting the merged token classes into the grammar for corresponding unimportant token classes used to generate the merged token classes.


Find Patent Forward Citations

Loading…