Universal epistemological machine (a.k.a. android)

• US 20020198697A1
• Filed: 05/21/2001
• Published: 12/26/2002
• Est. Priority Date: 05/01/1997
• Status: Abandoned Application

• Current Assignee: William E. Datig
• Original Assignee: William E. Datig
• Inventors: Datig, William E.
• Application Number:
  US09/860,638
• Publication Number:
  US 20020198697A1
• Time in Patent Office: Days
• US Class Current: 704/1
• 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 the universal machine translation of arbitrary languages, comprising the steps of:

identifying high-level grammatical constructions of an arbitrary source language word stream.

constructing a grammatical world model of the syntax of the high-level grammatical construction arbitrary source language word stream.

decomposing the arbitrary source language and an arbitrary target language into universal epistemic instances.

translating the epistemic instances of the source and the target languages with substantially no loss in meaning.

constructing a grammatical world model of the syntax of a target language high-level word stream.

generating a translated target language word stream.

2. The method according to claim 1, further comprising the step of adjusting a target language syntax to comply with a preferred target language grammar.

3. A universal machine translator of arbitrary languages, comprising:

means for identifying high-level grammatical constructions of an arbitrary source language word stream.

means for constructing a grammatical world model of the syntax of the high-level grammatical construction arbitrary source language word stream.

means for decomposing the arbitrary source language and an arbitrary target language into universal epistemic instances.

means for translating the epistemic instances of the source and the target languages with substantially no loss in meaning.

means for constructing a grammatical world model of the syntax of a target language high-level word stream.

means for generating a translated target language word stream.

5. A universal machine translator of arbitrary languages according to claim 3, wherein said means for identifying high-level grammatical constructions of an arbitrary source language word stream, constructing a grammatical world model of the syntax of the high-level grammatical construction arbitrary source language word stream, decomposing the arbitrary source language and an arbitrary target language into universal epistemic instances, translating the epistemic instances of the source and the target languages with substantially no loss in meaning, constructing a grammatical world model of the syntax of a target language high-level word stream, and generating a translated target language word stream comprise at least one of discrete automations, continuous time systems, electronic devices, electromechnical devices, biological devices, and chemical devices.

6. The universal machine translator of arbitrary languages of claim 3, wherein said universal machine translator is integral with arbitrary sensory/motor communications media including computers, microprocessors, photocopy machines, facsimile machines, telex machines, satellite systems, electromagnetic cable systems, fiber optic cable systems, electromagnetic cableless communications systems, telephone and pager (beeper) systems, radar/sonar and infrared communications systems, local area networks, computer networks, field programmable gate array systems, oscilloscopes, instrumentation, morse code machines, radio systems, speaker/microphone/earphone systems, vision systems, voice and character recognition and synthesis systems and robotic systems.

4. A universal machine translator of arbitrary languages comprising means for adjusting a target language syntax to comply with a preferred target language grammar.