Patent US2366886A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5511213A Expired / Lapsed US ⏱️ 0.0 years remaining

Associative memory processor architecture for the efficient execution of parsing algorithms for natural language processing and pattern recognition

Assignee: Individual
•
Filing: 1992-05-08
•
Granted: 1996-04-23
•
Expires: 2012-05-08
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An associative memory processor architecture is disclosed for the fast and efficient execution of parsing algorithms for natural language processing and pattern recognition applications. The architecture consists of an associative memory unit for the storage of parsing state representations, a random access memory unit for the storage of the grammatical rules and other tables according to which the parsing is done, a finite state parsing control unit which embodies the chosen parsing algorithm, and a communications unit for communication with a host processor or external interface. The use of associative memory for the storage of parsing state representations allows the architecture to reduce the algorithmic time complexity of parsing algorithms both with respect to grammar size and input string length, when compared to standard software implementations on general purpose computers. The disclosed architecture provides for a fast and compact computer peripheral or system, particularly when physically realized in one or a small number of integrated circuit chips, and thus contributes to the technical feasibility of real time applications in speech recognition, machine translation, and syntactic pattern recognition.

Inventors

  • 👤 Nelson Correa

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-23 13:01
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/20; G06F40/205; G06F40/211; G06F40/253

Claims Analysis

Total Claims: 8
Claim 1
Independent Claim 177 words
An associative memory processing system for executing parsing algorithms and real time context-free language processing and pattern recognition of an input symbol string, said system comprising: an associative memory unit logically arranged as an array of words for storing parsing state representations, each associative memory word being compared, in parallel with all other words, to an input search pattern corresponding to a parsing state representation; a random access memory unit for storing parsing data including context-free language grammatical rules according to which parsing is done for the context-free language of the input symbol string; a parsing control unit, connected to said associative memory unit and said random access memory unit, for accessing said associative memory unit to store and retrieve parsing state representations according to an input symbol string said parsing control unit being a finite state machine that executes a parsing algorithm, corresponding to the context-free language of the input symbol string, for syntactically recognizing the input symbol string; and a communications unit for providing communication between said associative memory processing system and an external device.
Claim 2
Dependent Claim 177 words
An associative memory processing system for executing parsing algorithms and real time context-free language processing and pattern recognition of an input symbol string, said system comprising: an associative memory unit logically arranged as an array of words for storing parsing state representations, each associative memory word being compared, in parallel with all other words, to an input search pattern corresponding to a parsing state representation; a random access memory unit for storing parsing data including context-free language grammatical rules according to which parsing is done for the context-free language of the input symbol string; a parsing control unit, connected to said associative memory unit and said random access memory unit, for accessing said associative memory unit to store and retrieve parsing state representations according to an input symbol string said parsing control unit being a finite state machine that executes a parsing algorithm, corresponding to the context-free language of the input symbol string, for syntactically recognizing the input symbol string; and a communications unit for providing communication between said associative memory processing system and an external device.
Claim 3
Dependent Claim 26 words
An associative memory processing system as claimed in claim 1 wherein said parsing control unit executes parsing algorithms for natural language processing and pattern recognition applications.
Claim 4
Dependent Claim 27 words
An associative memory processing system as claimed in claim 1 wherein said associative memory unit is formed of one or more banks of integrated circuit semiconductor chips.
Claim 5
Dependent Claim 46 words
An associative memory processing system as claimed in claim 1 wherein said associative memory unit is formed of one or more banks of associative memory chips, and said random access memory unit and said parsing control unit are formed on a separate integrated circuit semiconductor chip.
Claim 6
Dependent Claim 23 words
An associative memory processing system as claimed in claim 1 wherein all system components are formed on a single integrated circuit semiconductor chip.
Claim 7
Dependent Claim 42 words
An associative memory processing system as claimed in claim 1, wherein said parsing control unit accesses said associative memory unit in an amount of time that is constant and independent of an amount of parsing data stored in said associative memory unit.
Claim 8
Dependent Claim 18 words
An associative memory processing system as claimed in claim 1, wherein said parsing control unit performs post-processing actions.

References Cited (Backward Citations)

US4686623A Cited
US5239663A Cited
US5105353A Cited
US4994966A Cited
US4914590A Cited
US5239298A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-04-23 1999-10-23 2000-04-23 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-04-23 2003-10-23 2004-04-23 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-04-23 2007-10-23 2008-04-23 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag