Patent US3141012A successfully refreshed from Google Patents.
Patent US5587903A successfully refreshed from Google Patents.
US5587903A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Artificial intelligence language program
Assignee: Individual
•
Filing: 1994-06-22
•
Granted: 1996-12-24
•
Expires: 2014-06-22
Abstract
Abstract A sentence entered by a user is translated into Esperanto. The translated sentence is then parsed and a series of propositions are generated. Each proposition consist of a subject, verb, and an optional object such as an adjective, noun, or prepositional phrase, if present. A series of propositional databases are used to relate the various propositions as to their function within the sentence, thereby mapping the thought of the sentence in a form recognizable by a machine.
Inventors
- 👤 Thomas W. Yale
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-07 15:25
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/40; G06F40/55
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
103 words
A method for translating a sentence entered by a user into machine recognizable thought patterns, said method comprising: receiving the sentence entered by the user; translating the user's sentence to a universal language; parsing the translated sentence; deriving propositions from the parsed translated sentence of the user; sequentially storing the derived propositions into a knowledge database; and, generating a set of peripheral database linkages for the sets of derived propositions representing the user's sentence, wherein each peripheral database linkage includes a peripheral database representing a function of speech selectively linked to one or more of the other peripheral databases and the knowledge database.
Claim 2
Independent Claim
103 words
A method for translating a sentence entered by a user into machine recognizable thought patterns, said method comprising: receiving the sentence entered by the user; translating the user's sentence to a universal language; parsing the translated sentence; deriving propositions from the parsed translated sentence of the user; sequentially storing the derived propositions into a knowledge database; and, generating a set of peripheral database linkages for the sets of derived propositions representing the user's sentence, wherein each peripheral database linkage includes a peripheral database representing a function of speech selectively linked to one or more of the other peripheral databases and the knowledge database.
Claim 3
Dependent Claim
22 words
A method as claimed in claim 1, wherein said step of translating includes the steps of resolving any semantic and syntactic ambiguities.
Claim 4
Dependent Claim
24 words
A method as claimed in claim 2, further comprising the step of resolving any pronoun ambiguities after said step of parsing the translated sentence.
Claim 5
Dependent Claim
50 words
A method as claimed in claim 1, further comprising the steps of storing each noun present in each derived proposition into a noun database listing in conjunction with the identification of the proposition the noun first appears respective to the sequential order of the propositions stored in the knowledge database.
Claim 6
Dependent Claim
34 words
A method as claimed in claim 1, further comprising the steps of storing in a logic database the identification of a pair of propositions stored in the knowledge database having a common subject noun.
Claim 7
Dependent Claim
51 words
A method as claimed in claim 1, further comprising the steps of storing in an object database the identification of a pair of propositions, wherein a first proposition of the pair of propositions includes an object noun used as a subject noun in a second proposition of the pair of propositions.
Claim 8
Dependent Claim
104 words
A method as claimed in claim 1, wherein said step of generating a set of peripheral database linkages include the steps of: storing in a first number database all database linkages having the same subject, wherein the subject is a number; storing in a second number database all database linkages having the same object, wherein the object is a number; storing in an adverb database adverbs found in the knowledge database; and, storing in a date database any dates found in the knowledge database; wherein each listing within any of the peripheral databases includes linking data identifying each database that listing can be found.
Claim 9
Independent Claim
117 words
A system for translating a sentence entered by a user into machine recognizable thought patterns, said method comprising: means for receiving the sentence entered by the user; means for translating the user's sentence to a universal language; means for parsing the translated sentence; means for deriving propositions from the parsed translated sentence of the user; means for sequentially storing the derived propositions into a knowledge database; and, means for generating a set of peripheral database linkages for said sets of derived propositions representing the user's sentence, wherein each of said peripheral database linkages include a peripheral database representing a function of speech selectively linked to one or more of the other peripheral databases and the knowledge database.
Claim 10
Independent Claim
117 words
A system for translating a sentence entered by a user into machine recognizable thought patterns, said method comprising: means for receiving the sentence entered by the user; means for translating the user's sentence to a universal language; means for parsing the translated sentence; means for deriving propositions from the parsed translated sentence of the user; means for sequentially storing the derived propositions into a knowledge database; and, means for generating a set of peripheral database linkages for said sets of derived propositions representing the user's sentence, wherein each of said peripheral database linkages include a peripheral database representing a function of speech selectively linked to one or more of the other peripheral databases and the knowledge database.
Claim 11
Dependent Claim
21 words
A system as claimed in claim 8, wherein said translation means includes the means for resolving any semantic and syntactic ambiguities.
Claim 12
Dependent Claim
15 words
A system as claimed in claim 8, further includes means for resolving any pronoun ambiguities.
Claim 13
Dependent Claim
47 words
A system as claimed in claim 8, means for storing each noun present in each derived proposition into a noun database listing in conjunction with the identification of the proposition the noun first appears respective to the sequential order of the propositions stored in the knowledge database.
Claim 14
Dependent Claim
33 words
A system as claimed in claim 8, further comprising means for storing in a logic database the identification of a pair of propositions stored in the knowledge database having a common subject noun.
Claim 15
Dependent Claim
50 words
A system as claimed in claim 8, further comprising means for storing in an object database the identification of a pair of propositions, wherein a first proposition of the pair of propositions includes an object noun used as a subject noun in a second proposition of the pair of propositions.
Claim 16
Dependent Claim
102 words
A system as claimed in claim 8, wherein generating means further includes: means for storing in a first number database all database linkages having the same subject, wherein the subject is a number; means for storing in a second number database all database linkages having the same object, wherein the object is a number; means for storing in an adverb database adverbs found in the knowledge database; and, means for storing in a date database any dates found in the knowledge database; wherein each listing within any of said peripheral databases includes linking data identifying each database that listing can be found.
References Cited (Backward Citations)
US4779208A
Cited
WO1986000445A1
Cited
US4730270A
Cited
US4887212A
Cited
US4864503A
Cited
US4912648A
Cited
US5251129A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-12-24 | 2000-06-24 | 2000-12-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-12-24 | 2004-06-24 | 2004-12-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-12-24 | 2008-06-24 | 2008-12-24 | $7700.00 | Window Closed / Lapsed |