← Back to Patent Explorer
US5634121A Expired / Lapsed US ⏱️ 0.0 years remaining

System for identifying and linking domain information using a parsing process to identify keywords and phrases

Assignee: Lockheed Martin Corp
•
Filing: 1995-05-30
•
Granted: 1997-05-27
•
Expires: 2015-05-30
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A hypertext editor captures general textual descriptions of various aspects of applications in a domain. A reference requirements editor lists (optional and required) input and output parameters for program functions in the domain. A "thing" editor lists services provided and required by "things" in the domain. A scenario editor lists high-level steps and a description of those steps to be performed by an application program in the domain. A domain dictionary records definitions of key terms and phrases used in the lists and descriptions of the reference requirements, "thing", and scenario editors.

Inventors

  • 👤 William J. Tracz
  • 👤 Eric C. Newton

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 04:03
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/93; G06F16/94; Y; Y10; Y10S; Y10S707/00; Y10S707/912; Y10S707/917; Y10S707/99931; Y10S707/99932

Claims Analysis

Total Claims: 9
Claim 1
Independent Claim 172 words
A method to identify and link together information in a computer domain comprising the steps of: storing into a first database requirements for application programs in a domain; storing into a second database definitions of key terms and key phrases relating to said domain; storing into a third database program steps and step definitions for application programs in said domain; storing into a fourth database objects, devices and program modules required by said program steps in said domain; storing into a fifth database textual documentation describing the application programs in said domain; invoking a parsing process to parse any or all of the first, second, third, fourth, and fifth databases in order to identify key words and phrases; using said parsing process to establish links between said key words, said phrases and selected said first, second, third, fourth, or fifth databases; using said links to traverse from any one of the said first, second, third, fourth, or fifth databases to any of the other said first, second, third, fourth, or fifth databases.
Claim 2
Independent Claim 172 words
A method to identify and link together information in a computer domain comprising the steps of: storing into a first database requirements for application programs in a domain; storing into a second database definitions of key terms and key phrases relating to said domain; storing into a third database program steps and step definitions for application programs in said domain; storing into a fourth database objects, devices and program modules required by said program steps in said domain; storing into a fifth database textual documentation describing the application programs in said domain; invoking a parsing process to parse any or all of the first, second, third, fourth, and fifth databases in order to identify key words and phrases; using said parsing process to establish links between said key words, said phrases and selected said first, second, third, fourth, or fifth databases; using said links to traverse from any one of the said first, second, third, fourth, or fifth databases to any of the other said first, second, third, fourth, or fifth databases.
Claim 3
Dependent Claim 24 words
The method according to claim 1, wherein said parsing process parses said requirements, dictionary, scenario, hypertext, and thing databases for recurring words or phrases.
Claim 4
Dependent Claim 102 words
The method according to claim 1, further comprising the steps of: accessing said third database to determine said program steps for a particular program; identifying words that occur in both said third database and also in said first database, said second database, said fourth database, or said fifth database; linking said third database to any of said first database, said second database, said fourth database or said fifth that contain said words; and using said first database, said second database, said third database, said fourth database, and said fifth database to write a program implementing said program steps of said third database.
Claim 5
Dependent Claim 22 words
The method according to claim 1, further comprising the step of highlighting said key words and phrases identified by said parsing process.
Claim 6
Dependent Claim 28 words
The method according to claim 1, further comprising the step of deleting words from said words located by said parsing process before said parsing process establishes said links.
Claim 7
Dependent Claim 26 words
The method according to claim 1, further comprising the step of placing words occurring two or more times in said computer domain into said second database.
Claim 8
Dependent Claim 165 words
A computer system to identify and link together information in a computer domain comprising: means for storing into a first database requirements for application programs in a domain; means for storing into a second database definitions of key terms and key phrases relating to said domain; means for storing into a third database program steps and step definitions for application programs in said domain; means for storing into a fourth database objects, devices and program modules required by said program steps in said domain; means for storing into a fifth database general textual information describing applications in said domain; means for parsing said first, second, third, fourth and fifth databases in order to identify key words and phrases; means for establishing links between said key words, said phrases and said first, second, third, fourth, and fifth databases; means for traversing from any one of the said first, second, third, fourth, or fifth databases to any of the other first, second, third, fourth, or fifth databases.
Claim 9
Dependent Claim 165 words
A computer system to identify and link together information in a computer domain comprising: means for storing into a first database requirements for application programs in a domain; means for storing into a second database definitions of key terms and key phrases relating to said domain; means for storing into a third database program steps and step definitions for application programs in said domain; means for storing into a fourth database objects, devices and program modules required by said program steps in said domain; means for storing into a fifth database general textual information describing applications in said domain; means for parsing said first, second, third, fourth and fifth databases in order to identify key words and phrases; means for establishing links between said key words, said phrases and said first, second, third, fourth, and fifth databases; means for traversing from any one of the said first, second, third, fourth, or fifth databases to any of the other first, second, third, fourth, or fifth databases.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2000-05-26 2000-11-25 2001-05-27 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2004-05-26 2004-11-25 2005-05-27 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2008-05-26 2008-11-25 2009-05-27 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag