Identifying a group of words using modified query words obtained from successive suffix relationships
US6430557B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 16, 1998 |
| Grant date | Aug 6, 2002 |
| Priority date | — |
| Expiry date | Dec 16, 2018 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99936
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A query word is used to identify one of a number of word groups, by first determining whether the query word is in any of the word groups. If not, attempts to modify the query word are made in accordance with successive suffix relationships in a sequence until a modified query word is obtained that is in one of the word groups. The sequence of suffix relationships, which can be pairwise relationships, can be defined by a list ordered according to the frequencies of occurrence of the suffix relationships in a natural language. If a modified query word is obtained that is in one of the word groups, information identifying the word group can be provided, such as a representative of the group or a list of words in the group.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.