Patent US3662745A successfully refreshed from Google Patents.
Patent US6233545B1 successfully refreshed from Google Patents.
US6233545B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Universal machine translator of arbitrary languages utilizing epistemic moments
Assignee: Individual
•
Filing: 1998-03-03
•
Granted: 2001-05-15
•
Expires: 2018-03-03
Abstract
Abstract A universal machine translator of arbitrary languages enables the semantic, or meaningful, translation of arbitrary languages with zero loss of meaning of the source language in the target language translation, which loss is typical in prior art human and machine translations. The universal machine translator embodies universal transformations itself and comprises the means for identifying high-level grammatical constructions of a source language word stream, constructing a grammatical world model of the syntax of the source language high-level word stream, decomposing source and target languages into universal moments of meaning, or epistemic instances, translating the epistemic moments of source and target languages with substantially no loss in meaning, constructing a grammatical world model of the syntax of the target language high-level word stream, optionally adjusting the target language syntax to comply with a preferred target language grammar, and generating the translated target language word stream. The universal machine translator also comprises the means to embody arbitrary sensory/motor receptions and transmissions of arbitrary word streams, which allows universally translated communications to occur among human beings and machines.
Inventors
- 👤 William E. Datig
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 12:43
CPC Classifications
G; G06; G06N; G06N3/00; G06N3/004
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
111 words
A method for performing universal translations of arbitrary languages, in a computational system, which method comprises: converting a semantically arranged syntactical source language word stream into grammatical forms; parsing the converted word stream into epistemic semantic moments of the source language; mapping the epistemic moments of the source language to semantically equivalent epistemic moments of a target language; and constructing a syntactical target language word stream from the epistemic moments of the target language; wherein each of the epistemic moments consists of a triplet further consisting of a pair of objects of transformation in the source language's or the target language's word stream, and a transformer of the pair of objects.
Claim 2
Independent Claim
111 words
A method for performing universal translations of arbitrary languages, in a computational system, which method comprises: converting a semantically arranged syntactical source language word stream into grammatical forms; parsing the converted word stream into epistemic semantic moments of the source language; mapping the epistemic moments of the source language to semantically equivalent epistemic moments of a target language; and constructing a syntactical target language word stream from the epistemic moments of the target language; wherein each of the epistemic moments consists of a triplet further consisting of a pair of objects of transformation in the source language's or the target language's word stream, and a transformer of the pair of objects.
Claim 3
Dependent Claim
18 words
The method of claim 1 , wherein the source language and the target language are natural human languages.
Claim 4
Dependent Claim
22 words
The method of claim 1 , wherein the source language and the target language are source code or object code computer languages.
Claim 5
Dependent Claim
24 words
The method of claim 1 , wherein source language and the target language are arbitrary mathematical languages, scientific languages, logical languages, or engineering languages.
Claim 6
Dependent Claim
58 words
The method of claim 1 , comprising providing the translations in at least one of wireless and wireline telephone systems and networks, multimedia communications systems, modems, facsimile machines, computer systems and networks, pagers, radio and television systems, radar, sonar, infared and optical communications systems, photocopiers, hand-held, lap-top, and body-worn communications devices, and machine communications devices for machine control.
Claim 7
Dependent Claim
127 words
A computer readable medium having stored thereon sequences of instructions for performing universal translations of arbitrary languages, in a computational system, said sequences of instructions including instructions for performing the steps of converting a semantically arranged syntactical source language word stream into grammatical forms; parsing the converted word stream into epistemic semantic moments of the source language; mapping the epistemic moments of the source language to semantically equivalent epistemic moments of a target language; and constructing a syntactical target language word stream from the epistemic moments of the target language; wherein each of the epistemic moments consists of a triplet further consisting of a pair of objects of transformation in the source language's or the target language's word stream, and a transformer of the pair of objects.
Claim 8
Dependent Claim
127 words
A computer readable medium having stored thereon sequences of instructions for performing universal translations of arbitrary languages, in a computational system, said sequences of instructions including instructions for performing the steps of converting a semantically arranged syntactical source language word stream into grammatical forms; parsing the converted word stream into epistemic semantic moments of the source language; mapping the epistemic moments of the source language to semantically equivalent epistemic moments of a target language; and constructing a syntactical target language word stream from the epistemic moments of the target language; wherein each of the epistemic moments consists of a triplet further consisting of a pair of objects of transformation in the source language's or the target language's word stream, and a transformer of the pair of objects.
Claim 9
Dependent Claim
20 words
The computer readable medium of claim 6 , wherein the source language and the target language are natural human languages.
Claim 10
Dependent Claim
24 words
The computer readable medium of claim 6 , wherein the source language and the target language are source code or object code computer languages.
Claim 11
Dependent Claim
26 words
The computer readable medium of claim 6 , wherein source language and the target language are arbitrary mathematical languages, scientific languages, logical languages, or engineering languages.
Claim 12
Dependent Claim
61 words
The computer readable medium of claim 6 , wherein the translations are performed at least one of in wireless and wireline telephone systems and networks, multimedia communications systems, modems, facsimile machines, computer systems and networks, pagers, radio and television systems, radar, sonar, infared and optical communications systems, photocopiers, hand-held, lap-top, and body-worn communications devices, and machine communications devices for machine control.
References Cited (Backward Citations)
US4829423A
Cited
US4688195A
Cited
US4905138A
Cited
US4773039A
Cited
US4852003A
Cited
US5193144A
Cited
US5323311A
Cited
US5495413A
Cited
US5844798A
Cited
US5510981A
Cited
US5659765A
Cited
US5612872A
Cited
US5706406A
Cited
US5806021A
Cited
US5907821A
Cited
WO1998049629A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-05-14 | 2004-11-13 | 2005-05-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-05-14 | 2008-11-13 | 2009-05-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-05-14 | 2012-11-13 | 2013-05-15 | $7700.00 | Window Closed / Lapsed |