US6102969A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system using information written in a wrapper description language to execute query on a network
Assignee: Netbot Inc
•
Filing: 1999-05-12
•
Granted: 2000-08-15
•
Expires: 2019-05-12
Abstract
Abstract This invention provides assistance to a user in accessing network attached information sources. In one aspect, the invention is a method for intelligently routing a user query to information sources relevant to that query, extracting relevant data fields from received responses, and intelligently presenting the extracted data in order of estimated relevance. The system of this invention implements one or more steps of the method in a centralized or distributed manner on one or more network attached computers. Further, this invention provides a novel language and implementation that facilitates easily written and maintained descriptions of information source query and response formats.
Inventors
- 👤 David Christianson
- 👤 Robert B. Doorenbos
- 👤 Oren Etzioni
- 👤 Chung Kwok
- 👤 Gregory Lauckhart
- 👤 Erik Selberg
- 👤 Daniel S. Weld
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 19:14
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/95; G06F16/951; G06F16/953; G06F16/9532; G06F16/9538; H; H04; H04L; H04L67/00; H04L67/01; H04L67/02; H04L67/50; H04L67/56; H04L67/563; H04L67/564; H04L67/565; H04L69/00; H04L69/30; H04L69/32; H04L69/322; H04L69/329; H04L9/00; H04L9/40; H04L67/51; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99932; Y10S707/99933; Y10S707/99935; Y10S707/99941; Y10S707/99944
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
86 words
A wrapper description language method comprising recognizing a string by scanning the string as a regular expression written in a regular expression language, the regular expression language capable of specifying an entire regular expression in terns of component regular expressions such that, upon recognition of one component regular expression of the entire regular expression, actions can be executed with variables bound as of the time of recognition of the component regular expression, the actions actually being executed only if the entire regular expression is also recognized.
Claim 2
Dependent Claim
86 words
A wrapper description language method comprising recognizing a string by scanning the string as a regular expression written in a regular expression language, the regular expression language capable of specifying an entire regular expression in terns of component regular expressions such that, upon recognition of one component regular expression of the entire regular expression, actions can be executed with variables bound as of the time of recognition of the component regular expression, the actions actually being executed only if the entire regular expression is also recognized.
Claim 3
Dependent Claim
77 words
The wrapper description language method of claim 1 further comprising the step of executing one or more statements written in an action language, the action language capable of specifying the actions of operators on variables, the actions of functions on variables, and of the sequence of statements the statements of the action language being further capable of being embedded in the regular expression language for specifying the actions occurring on the recognition of the component regular expressions.
Claim 4
Dependent Claim
102 words
A computer readable medium containing computer executable instructions for causing one or mote computers to perform a wrapper description language method comprising recognizing a string by scanning the string as a regular expression written in a regular expression language, the regular expression language capable of specifying an entire regular expression in terms of component regular expressions such that, upon recognition of one component regular expression of the entire regular expression, actions can be executed with variables bound as of the time of recognition of the component regular expression, the actions actually being executed only if the entire regular expression is also recognized.
Claim 5
Dependent Claim
102 words
A computer readable medium containing computer executable instructions for causing one or mote computers to perform a wrapper description language method comprising recognizing a string by scanning the string as a regular expression written in a regular expression language, the regular expression language capable of specifying an entire regular expression in terms of component regular expressions such that, upon recognition of one component regular expression of the entire regular expression, actions can be executed with variables bound as of the time of recognition of the component regular expression, the actions actually being executed only if the entire regular expression is also recognized.
Claim 6
Dependent Claim
100 words
A computer program product stored on a computer readable medium, and including computer executable instructions for causing one or more computers to interpret strings written in a regular expression language by, performing the steps of: receiving a string written in the regular expression language; scanning the string to recognize a plurality of component regular expressions; binding variables defined in thc component regular expressions as the component regular expressions are recognized: and upon recognition of an entire regular expression containing the plurality of recognized component regular expressions, executing at least one action using the bound variables from the component regular expressions.
Claim 7
Dependent Claim
100 words
A computer program product stored on a computer readable medium, and including computer executable instructions for causing one or more computers to interpret strings written in a regular expression language by, performing the steps of: receiving a string written in the regular expression language; scanning the string to recognize a plurality of component regular expressions; binding variables defined in thc component regular expressions as the component regular expressions are recognized: and upon recognition of an entire regular expression containing the plurality of recognized component regular expressions, executing at least one action using the bound variables from the component regular expressions.
References Cited (Backward Citations)
US5495409A
Cited
US5600831A
Cited
US5768578A
Cited
US5724567A
Cited
US5680619A
Cited
US5721908A
Cited
US5801689A
Cited
US5889992A
Cited
US5913214A
Cited
US5761436A
Cited
US5826258A
Cited
US6006224A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-08-15 | 2004-02-14 | 2004-08-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-08-15 | 2008-02-14 | 2008-08-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-08-15 | 2012-02-14 | 2012-08-15 | $7700.00 | Window Closed / Lapsed |