Finite state automation text search apparatus having two-level m

Details Finite state automation text search apparatus having two-level m Finite state automation text search apparatus having two-level m

1993-06-17

1995-02-07

Lall, Parshotam S.

Boots, shoes, and leggings

395600, 3649560, 3649555, 364DIG1, 364DIG2, G06F 1130

Patent

active

053882342

ABSTRACT:
A finite state automaton (FSA) text search apparatus converts each of successively received binary code numbers, representing successive characters of a text to be searched, into two portions. Two portions are extracted from a state number which is currently being read out from a first table memory, with one portion being combined with one of the input character portions and the combination used to select one of a set of 1st displacement numbers from a second table memory, while a second portion of the current state number and the other portion of the input character number similarly select one of a set of 2nd displacement numbers from a third table memory, and the entire current state number selects one of a set of base numbers from a fourth table memory. The selected 1st and 2nd displacement numbers are combined with the selected base number, and the result used to select the next state number from the first table memory. The overall memory capacity required is minimized, while achieving a high search speed.

REFERENCES:
patent: 4241402 (1980-12-01), Mayper, Jr. et al.
patent: 4285049 (1981-08-01), Bird et al.
patent: 4764863 (1988-08-01), Silverthorn, III et al.
patent: 4985863 (1991-01-01), Fujisawa et al.
patent: 5051886 (1991-09-01), Kawaguchi et al.
patent: 5212697 (1993-05-01), Morita
Searching for a Minimal Finite State Automation (FSA), IEEE 1991 publication pp. 416-423.
"ACCESS METHODS FOR TEXT" by C. Faloutsos; Computing Surveys, vol. 17, No. 1, Mar 1985.
"TEST SEARCHING PROCESSOR"; Dec. 1991 (w/ partial English translation).

Affiliated with

Also associated with

Rating

Finite state automation text search apparatus having two-level m does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Finite state automation text search apparatus having two-level m, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite state automation text search apparatus having two-level m will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1117044