Lossless switching between search grammars
US11200227B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 31, 2019 |
| Grant date | Dec 14, 2021 |
| Priority date | — |
| Expiry date | Mar 11, 2040 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F40/284
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Lossless switching between search grammars is described herein. A method may include generating a first resolved-request using a relational search grammar in response to receiving a request for data, where the first resolved-request includes an ordered sequence of tokens, and in response to receiving a request for data indicating the first resolved-request and indicating a request to use a natural language search grammar, generating a second resolved-request in accordance with the natural language search grammar by identifying tokens and token binding data associated with the relational search grammar resolved-request as query refinements, generating the second resolved-request consistent with the first resolved-request by tokenizing the request for data associated with the natural language search grammar in accordance with the natural language search grammar using the query refinements, and outputting search results obtained using the request for data associated with the natural language search grammar using the natural language search grammar.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.