← Back to Patent Explorer
EP0568319A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Machine translation system

Assignee: Sharp Corp
•
Filing: 1993-04-27
•
Granted: —
•
Expires: 2013-04-27
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A machine translation system which operates by reading a text from an input source, then entering that text into an analysis module, which processes the text by drawing on information from source language grammars, dictionaries and other knowledge sources provided in the system to deduce information about the usage and meaning of the words of the source language text as they occur in context. This information is collected in repositories which are associated with the individual morphemes of the input text. The information repositories which have been constructed and stored in the buffer of the analysis module are then passed to an equivalencing module, which matches them against the source language sides of a set of bilingual equivalence statements provided within the system. The matching of the source language side of the equivalence statements causes the equivalence module to produce as output a set of information repositories describing words of the target language. The target language information repositories are then passed to a generation module which will construct either a single target language text or a plurality of target language texts, such that these texts are possible translations of the source language text. The generation module has internal structure, consisting of a constraint checking module and a tree construction module. In the preferred embodiment the target language information repositories are simultaneously fed to both the constraint checker and the tree building module, which operate in parallel to produce a set of candidate translations of the original text. The translated texts are then made available to the user by conveying them to an accessible location, such as a screen, a printer or a second computer file, and optionally by initiating a structured interaction during which the user can explore the alternative translations which the system has produced.

Inventors

  • 👤 Christopher Hardie Brew

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-04 15:11
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/20; G06F40/253; G06F40/40; G06F40/42; G06F40/45; G06F40/55; G06F40/56

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 226 words
A machine translation system which operates by reading a text from an input source, then entering that text into an analysis module which processes the text by drawing on information from source language grammars, dictionaries and other knowledge sources provided in the system to deduce source word information about the usage and meaning of the words of the source language text as they occur in context, then matching the source language words against the source language sides of a set of bilingual equivalence statements provided within a word dictionary of the system and forwarding target word information obtained by said matching procedure about the corresponding target language words and comprising complex lexical signs to a generation module which constructs one or more candidate target language texts corresponding to the source language text, characterised in that the generation module is split into first and second separate functional components, the first of which is dedicated to the processing of information which does not depend on the eventual order of words in the target language text or on the details of associations between the component parts of the complex lexical signs, and the second of which is dedicated to the construction of structures which do respect constraints of word order and intra-sign association, and in that the second component communicates with the first component in order to synchronise analyses.
Claim 2
Dependent Claim 36 words
A machine translation system according to claim 1, further characterised in that the first component is operable to implement a constraint propagation algorithm to assist in the direction of the operation of the second functional component.
Claim 3
Dependent Claim 45 words
A machine translation system according to claim 1, further characterised in that the first component uses standard graph algorithms to test for the existence of spanning trees containing the edges already proposed by the second component, failing when no such spanning tree can be constructed.
Claim 4
Dependent Claim 32 words
A machine translation system according to claim 1 characterized in that the complex lexical signs for target language adjectives are annotated in such a way that illegal target word ordering is outlawed.
Claim 5
Dependent Claim 32 words
A machine translation system according to claim 4 wherein the annotations to the complex lexical signs for the target language adjectives are finite state descriptions of the order requirements of said adjectives.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag