Universal machine translator of arbitrary languages utilizing epistemic moments

• US 6,233,545 B1
• Filed: 03/03/1998
• Issued: 05/15/2001
• Est. Priority Date: 05/01/1997
• Status: Expired due to Fees

• Current Assignee: William E. Datig
• Original Assignee: William E. Datig
• Inventors: Datig, William E.
• Primary Examiner(s): Thomas, Joseph
• Application Number:
  US09/033,676
• Time in Patent Office: 1,169 Days
• Field of Search: 704/1, 704/2, 704/3, 704/7, 704/4, 704/8, 704/9, 704/10, 707/536, 395/707, 395/708, 706/11, 706/14, 706/45, 706/46, 706/62, 706/909, 706/922
• US Class Current: 704/2
• CPC Class Codes: G06N 3/004 Artificial life, i.e. computing arrangements simulating life

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.

Claims

1. 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.

2. The method of claim 1, wherein the source language and the target language are natural human languages.

3. The method of claim 1, wherein the source language and the target language are source code or object code computer languages.

4. The method of claim 1, wherein source language and the target language are arbitrary mathematical languages, scientific languages, logical languages, or engineering languages.

5. 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.

6. 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.

7. The computer readable medium of claim 6, wherein the source language and the target language are natural human languages.

8. The computer readable medium of claim 6, wherein the source language and the target language are source code or object code computer languages.

9. 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.

10. 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.