Finite-state machine augmented for multiple evaluations of text
US7672965B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Feb 9, 2004 |
| Grant date | Mar 2, 2010 |
| Priority date | — |
| Expiry date | Sep 6, 2025 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99943
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A process performs multiple evaluations of text simultaneously. There are multiple counters, each with pattern-amount pairs. The pattern-amount pairs are accumulated into a single finite-state machine, with each state having a list of (counter, value) pairs instead of a single value. While the finite-state machine is applied to text, a score for each counter is accumulated by summing values for the counter from value lists of visited states. With one state transition per character, evaluating text using one finite-state machine for multiple counters is more efficient than using separate finite-state machines for counters or patterns.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.