Indicating and correcting errors in machine translation systems

Information

  • Patent Grant
  • 9772998
  • Patent Number
    9,772,998
  • Date Filed
    Thursday, May 22, 2014
    10 years ago
  • Date Issued
    Tuesday, September 26, 2017
    6 years ago
Abstract
The preferred embodiments provide an automated machine translation from one language to another. The source language may contain expressions or words that are not readily handled by the translation system. Such problematic words or word combinations may, for example, include the words not found in the dictionary of the translation system, as well as text fragments corresponding to structures with low ratings. To improve translation quality, such potentially erroneous words or questionable word combinations are identified by the translation system and displayed to a user by distinctive display styles in the display of a document in the source language and in its translation to a target language. A user is provided with a capability to correct erroneous or questionable words so as to improve the quality of translation.
Description
BACKGROUND OF THE INVENTION

Field of Disclosure


The preferred embodiments generally relate to the field of automated translation of natural languages and related user interfaces.


Related Art


Machine translation (MT) systems are capable of recognizing complex language constructs and producing translations of texts from one language into another. However, in the process such a system may encounter words that it is unable to identify, words that have no translations in a dictionary, language construction that cannot be parsed, and simply errors, misprints, and the like. Some of systems break down in these situations, other systems transfer the errors into the translation text, sometimes transliterating unknown words if the input and output alphabets are different. A user is incapable of providing a meaningful input into the system to alleviate such problems, which are not highlighted by the system. Since the user does not see potentially erroneous points in the source text, he/she cannot estimate the quality of its translation (the target text), especially if he/she does not know the target language sufficiently well.


SUMMARY OF THE INVENTION

The preferred embodiments generally relate to methods, computer-readable media, devices and systems for translating text from an input (source) language into an output (target) language. In one embodiment, the method and system of translating includes analyzing a source sentence using linguistic descriptions of the source language, constructing a language-independent semantic structure to represent the meaning of the source sentence, and generating an output sentence to represent the meaning of the source sentence in the output language using linguistic descriptions of the output language. To improve the accuracy of translation, the analysis and/or synthesis stage may include ratings and statistics obtained by analyzing a corpus of parallel texts.


To translate a text from one natural language to another one, a translation program analyzes the syntax and the semantics of a sentence. A translation program may employ diverse linguistic descriptions (e.g., morphological, syntactic, semantic and pragmatic descriptions) to “understand” the meaning of the sentence, to represent it in language-independent terms, and then to generate a corresponding sentence in the output language. During translation, a program may encounter the problem of disambiguation. One way to resolve the problem of disambiguation is to use different ratings to estimate variants of parsing and variants of synthesized structures, such that erroneous and incorrect structures would have low rating. The system can then bring such erroneous or incorrect structures to the attention of the user, who, in response, may improve the source text or correct the text of the translation.


Various ratings may be used both at an analysis stage and at a synthesis stage. Examples of generating a rating includes the use of statistics, a priori assessments of lexical meanings and various syntactical and lexical constructs which may be assigned manually, automatically or as a combination of manual and automatic assignment by means of applying special rules. Certain statistics may be obtained through analysis of a tagged corpus of parallel texts in a process known as statistical analysis.


In one preferred embodiment, as part of machine translation process, the system identifies one or more potentially erroneous words in the source text and the corresponding words in the target text. These potentially erroneous words are displayed to a user and indicated by one or more distinctive display styles. The user may change the potentially erroneous words in the source text and, in response, the system modifies the target text consistently with the changed source text.


One preferred embodiment performs lexical-morphological analysis of a source sentence so as to generate a lexical-morphological structure of the source sentence. If the lexical-morphological analysis identifies words which are not found in dictionaries or which have no morphological or lexical descriptions, the system displays at least one such word in a distinctive manner as potentially erroneous. The system also performs syntactic analysis of the lexical-morphological structure of the source sentence so as to generate a language-independent semantic structure. If during syntactic analysis, a hypothesis with a low rating is selected as a preferred syntactic structure, the system displays in a distinctive manner a fragment of the source sentence corresponding to the selected syntactic structure so as to indicate that the fragment is potentially erroneous. The system also performs syntactic synthesis so as to generate the target sentence in the target language. If during syntactic synthesis, a hypothesis with a low rating or a default structure is selected, the system displays in a distinctive manner a fragment of the source sentence, which corresponds to the hypothesis with a low rating or the default structure, so as to indicate that the fragment is potentially erroneous.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is an example of an interface for machine translation.



FIG. 2 illustrates an embodiment of translating the source sentence from a source language into the target sentence in a target language.



FIG. 3 illustrates an example of a computer system in accordance with one embodiment.





DETAILED DESCRIPTION

The preferred embodiments provide a computer method and a computer system configured for translating a document in an input language into an output language. It is to be understood that a document may be a sentence, sentence fragment, phrase, expression, page of text, Web page, sign, menu, label, and any other text.


A document may be translated using various MT systems. Some of such MT systems can analyze each sentence and recognize its linguistic structure and semantics in order to “understand” its meaning. If the system uses exhaustive linguistic descriptions to analyze a sentence in the input language, it can recognize the meaning of the sentence and subsequently generate an output sentence in the output language. Nevertheless, the problem of syntactical and semantic ambiguities may appear during several steps of translation process.


During automated translation process, different options may have different ratings. The ratings may be assigned to lexical selection options, for example, to word translation options and word combinations, and to syntactic parsing options, such as, parsing sentences, clauses and their fragments. Also, ratings may be assigned to applying rules of semantic interpretation or to other operations of semantic analysis. Each structure created in a given step, such as a syntactic tree and a semantic structure, may be estimated by means of evaluating its overall rating.


The text to be translated is not always carefully written and stylistically smooth. It may contain, for example, colloquial terms, abbreviations, which are absent in the dictionary of an MT system, slang words, internet slang, professional jargon, and the like, as well as simply errors and misprints. The source text also sometimes may contain incorrect syntactical constructions, ambiguous expressions, constructions which may have different variants of parsing. Typical MT systems break down in such cases, or transfer the errors and unknown words into the translation text, or produce a default translation, for example, word-by-word translation, without identifying the points where the system encountered problems.


Consequently, a user of such a typical system cannot estimate adequately the quality of the produced translation, and he/she is not provided with a mechanism to respond in time to the difficulties of the MT system. In the preferred embodiments, however, a user receives visual information concerning source words and constructions that are unknown to the MT system, as well as the information about ambiguous or incorrect expressions in the source text. As a result, when using the preferred system, a user can correct such problems so as to receive a quality translation into another language.


The errors in the source or/and target text may be displayed to a user. For example, the errors may be highlighted, underlined, distinguished by special font, color, italicizing, or distinguished by any other visual representation. After the user has corrected the source text, the system may repeat the translating process for the fragment at issue, which may be a word, a sentence, a paragraph, or the entire text.



FIG. 1 is an example of an interface 100 of for the machine translation process. It shows the original text in Russian in the left window (110) and its machine translation into English in the right window (120). A word, or fragment in the source text 110 or in translation text 120, may be underlined, highlighted or otherwise identified by the system and then corrected or replaced by the user. Errors of different types (lexical and syntactical) may be selected by different colors or other indications. For example, the error 132 is a lexical error, it is a misprint; the error 134 is also lexical because the system is not aware of the proper name; the error 136 is syntactical because the selected clause has an incorrect structure, and the system is unable to parse it successfully.


In the right window 120, the corresponding errors arising during translation are likewise indicated: the error 142 is a transliteration of the “unknown to the system” word, the error 144 is a transliteration of the unknown to the system proper name, 146 is a syntactical construction assigned a low rating during the synthesis because the corresponding source fragment was insufficiently recognized (parsed), Such insufficiently recognized structures have low rating during the analysis.


Since more frequent errors are typos, the system may suggest resembling substitution alternatives for separate words and collocations that have been identified as potentially erroneous. If a user selects, for example by a click, a word, which is potentially erroneous, in the source text or in the output text, the selected word may be displayed, for example, in a special window 140, and possible alternatives for substitution may be presented in the list box 150 where the user has an option to select an appropriate alternative 160. In FIG. 1, word 132 has been selected and appears in box 140. Suggested corrections of this word are displayed in box 150.


Additionally, box 165, entitled “Subject” allows a user to specify the subject of the translated text, for example, Business, Law, Patents, Medicine, Biology, etc. The box 165 allows a user to narrow the list of options to a particular subject or field of study in which the word at issue may have a particular or special meaning. For example, the word “class” to a computer programmer may have a particular meaning (e.g., a computing construction with certain features, characteristics or functionalities). If “Subject” is not selected, the default automatic detection (“Autodetect”) is used, so that the subject area may be defined automatically, for example, by means of a text classifier, or by means of a syntactic and/or semantic analysis of the fragment or the whole text.


After the word is replaced, the text may be translated again. The button 170 initializes the process of translating the fragment or the entire file. The syntactical model of the word chosen by the user may be taken into account during this translation. The user may choose to replace a particular occurrence of the word in a given sentence or all such words found throughout the entire text.


This interface is useful for most MT systems. In one embodiment, even a simple statistical MT system may benefit from a user interface such as in FIG. 1, because in the process of translating, fragments and words of the source text are compared with patterns from data bases, a translation memory, or dictionaries. So, fragments and words of the source text that are not found in these resources may be selected as potentially erroneous, or the rating of syntactical constructions may depend on their frequency. These unidentified fragments or words are indicated in the above-described interface and the user has a capability to correct them thereby possibly improving the translation.


In another preferred embodiment, the above-described interface of FIG. 1 is provided to an MT system, which executes syntactical and semantic analysis of the source text. Such systems and corresponding methods for translating text from one language into another language are disclosed in U.S. Pat. No. 8,078,450 (U.S. patent application Ser. No. 11/548,214) titled “Method And System For Analyzing Various Languages And Constructing Language-Independent Semantic Structures”, filed on Oct. 10, 2006, and its continuations-in-part: U.S. patent application Ser. No. 11/690,099 now abandoned), Ser. No. 11/690,102 know U.S. Pat. No. 8,195,447 issued Jun. 5, 2012), Ser. No. 11/690,104 now U.S. Pat. No. 8,214,199 issued Jul. 3, 2012) all initially titled “Method And System For Translating Sentences Between Languages”, filed on Mar. 22, 2007, U.S. patent application Ser. No. 12/187,131 titled “Method For Translating Documents From One Language Into Another Using A Database Of Translations, A Terminology Dictionary, A Translation Dictionary, And A Machine Translation System”, and U.S. patent application Ser. No. 12/388,219 now U.S. Pat. No. 8,145,473 issued Mar. 27, 2012) titled “Deep Model Statistics Method For Machine Translation.” The above-referenced patent and patent applications are incorporated herein by reference to the extent that they are not inconsistent herewith.


More specifically, FIG. 2 illustrates a computer method and system 200 for translating a source/input sentence 206 in a source language into an output sentence 208 in an output language, which make exhaustive syntactical and semantic analysis of the source sentence and transfers its meaning into the output sentence via a language-independent semantic structure. As shown in FIG. 2, the computer method and system 200 includes using linguistic descriptions adapted to perform various steps of analysis and synthesis. The linguistic descriptions may include morphological descriptions 201, syntactic descriptions 202, lexical descriptions 203, and semantic descriptions 204.


At 210, a lexical analysis is performed on the source sentence 206 in a source/input language. At 220, a lexical-morphological analysis is performed on the source sentence 206 to generate a lexical-morphological structure of the source sentence 206 using information from the morphological descriptions 201 and the lexical descriptions 203 of the source language. At this step, the words which are not found in dictionaries are detected. In addition, at this step, the system detects words which have no corresponding morphological descriptions 201 or the lexical descriptions 203.


Then, a syntactic analysis is performed on the lexical-morphological structure of the source sentence. In one embodiment, the syntactic analysis includes a first syntactic analysis and a second syntactic analysis, referred to, respectively, as a “rough syntactic analysis” and a “precise syntactic analysis.” The two-step analysis algorithm (rough syntactic analysis and precise syntactic analysis) uses linguistic models and knowledge at various levels to calculate probability ratings and to generate essentially the most probable syntactic structure, which may be considered the best syntactic structure. Accordingly, at step 230, a rough syntactic analysis is performed on the source sentence to generate a graph of generalized constituents for further processing by the precise syntactic analysis. The graph of generalized constituents is the structure that reflects essentially all potentially possible relationships in the source sentence.


During rough syntactic analysis, the number of different constituents which may have been built and the syntactic relationships among them are considerably large. Therefore, some of the surface models of the constituents are chosen to be filtered through the process of filtering prior to and after the building the constituents in order to greatly reduce the number of different constituents to be considered. Thus, at the early stage of the rough syntactic analysis, the most suitable surface models and syntactic forms are selected on the basis of a priori rating. Such prior rough ratings include ratings of lexical meanings, ratings of fillers, and ratings of the correspondence to semantic descriptions, among others.


At step 240, a precise syntactic analysis is performed on the graph of generalized constituents to generate one or more syntactic trees to represent the source sentence from the graph of generalized constituents. This two-step syntactic analysis approach ensures accurately representing the meaning of the source sentence into a best syntactic structure which is chosen from one or more syntactic trees. In addition, hypotheses for a portion of a sentence, which are used for analyzing its meaning and generating an appropriate language structure using available linguistic descriptions, are verified within the hypotheses about the language structure for the entire sentence. In order to select the best syntactic structure, the system rates each syntactic tree representing the whole sentence. This approach avoids analyzing numerous parsing variants, which are known to be invalid.


The best syntactic tree is obtained on the basis of calculating ratings using a priori ratings from the graph of the generalized constituents. The a priori ratings may include ratings of the lexical meanings, such as frequency (or probability), ratings of each of the syntactic constructions (e.g., idioms, collocations, etc.) for each element of the sentence, and the degree of correspondence of the selected syntactic constructions to the semantic descriptions of the deep slots.


At this step 240 of precise syntactic analysis, at first, the syntactic tree with the best rating is selected. Then non-tree links on the selected tree are established to obtain the best syntactic structure. If the system cannot establish the non-tree links, the hypothesis may be rejected, and the next by rating hypothesis is chosen as illustrated by the return arrow 244 on the FIG. 2. As a result, if the hypothesis with low rating is selected as the “best” syntactic structure, the corresponding fragment of the source sentence may be shown to the user as underlined, highlighted, or the like on interface of FIG. 1 indicating that it is incorrect, low rating, or ambiguous.


At step 250, semantic analysis constructs a language-independent semantic structure, representing the meaning and all syntactic parameters of the source sentence in semantic language-independent terms. After the language-independent semantic structure has been built, the next step 260 is syntactic synthesis, which generates the output sentence in the output language. This step includes, but not limited to, generating a surface syntactic structure of the sentence in the output language and lexical selection. Various ratings may influence lexical selection, such as, ratings of the lexical meanings, ratings of the deep slots fillings, ratings of identifying word-combinations, ratings of deep slots correspondences, ratings of the correspondence to the local and global pragmatic contexts, ratings of the correspondence to the terminological sphere, and ratings of the correspondence to the previous selection. Since there may be many lexical meanings meeting the conditions of lexical selection, lexical meanings with the best ratings are selected at first.


But, there are cases when the rules of lexical selection and structure correction should be used. These rules are used when the semantic structure needs correction in order to overcome the asymmetries between the universal semantic description and the language-specific syntactic structure. The surface structure is built by means of a top-down traversal of the semantic structure. During this traversal, semantic, lexical and syntactic properties of each constituent are specified more accurately, and, first of all, the surface slots corresponding to the deep slots are determined, the linear order is defined, movements are restored, structural and referential control is checked. If some of these steps has ended in failure, the next by rating hypothesis (surface structure or lexical selection) is chosen. At the worst, a “default” structure may be chosen. As result, if the hypothesis with low rating or the default structure is selected, the corresponding fragment of the source sentence may be indicated to user on the interface of FIG. 1 (for example, as underlined or highlighted) so as to identify it as incorrect, having a low rating, or ambiguous. The last step 270 is the morphology synthesis of the output sentence in the output language.



FIG. 3 illustrates an example of a computer system in accordance with one embodiment. Hardware of the system in FIG. 3 typically includes at least one processor 302 coupled to a memory 304. The processor 302 may represent one or more processors (e.g. microprocessors), and the memory 304 may represent random access memory (RAM) devices comprising a main storage of the hardware 300, as well as any supplemental levels of memory, e.g., cache memories, non-volatile or back-up memories (e.g., programmable or flash memories), read-only memories, and the like. In addition, the memory 304 may include memory storage physically located elsewhere in the hardware 300, e.g. any cache memory in the processor 302 as well as any storage capacity used as a virtual memory, e.g., as stored on a mass storage device 310.


The hardware of FIG. 3 also typically receives a number of inputs and outputs for communicating information externally. For interfacing with a user or operator, the hardware of FIG. 3 may include one or more user input devices 306 (e.g., a keyboard, a mouse, imaging device, scanner) and a one or more output devices 308 (e.g., a Liquid Crystal Display (LCD) panel, a sound playback device (speaker)). At least one display and a user input device are provided to the user of the preferred embodiments. Optionally, the display and input device may be integrated into a single device such as a touch screen. For additional storage, the hardware 300 may also include one or more mass storage devices 310, e.g., a removable disk drive, a hard disk drive, a Direct Access Storage Device (DASD), an optical drive (e.g. a Compact Disk (CD) drive, a Digital Versatile Disk (DVD) drive, etc.) and/or a tape drive, among others. Furthermore, the hardware 300 may include an interface with one or more networks 312 (e.g., a local area network (LAN), a wide area network (WAN), a wireless network, and/or the Internet among others) to permit the communication of information with other computers coupled to the networks. It should be appreciated that the hardware of FIG. 3 typically includes suitable analog and/or digital interfaces between the processor 302 and each of the components 304, 306, 308, and 312 as is well known in the art.


The hardware of FIG. 3 operates under the control of an operating system 314, and executes various computer software applications, components, programs, objects, modules, and the like to implement the techniques described above. Moreover, various applications, components, programs, objects, etc., collectively indicated by reference 316 in FIG. 3, may also execute on one or more processors in another computer coupled to the hardware via a network 312, e.g. in a distributed computing environment, whereby the processing required to implement the functions of a computer program may be allocated to multiple computers over a network.


In general, the routines executed to implement the embodiments of the invention may be implemented as part of an operating system or as a specific application, component, program, object, module or sequence of instructions referred to as “computer programs.” The computer programs typically comprise one or more computer instructions stored in memory and other storage devices in a computer, and that, when read and executed by one or more processors in a computer, cause the computer to perform operations necessary to execute elements involving the various aspects of the preferred embodiment. Moreover, while the preferred embodiments have been described in the context of fully functioning computers and computer systems, those skilled in the art will appreciate that the various embodiments of the invention are capable of being distributed as a program product in a variety of forms, and that the invention applies equally regardless of the particular type of computer-readable media used to actually effect the distribution. Examples of computer-readable media include but are not limited to recordable type media such as volatile and non-volatile memory devices, removable disks, hard disk drives, optical disks (e.g., Compact Disk Read-Only Memory (CD-ROMs), Digital Versatile Disks (DVDs)) and flash memory, among others. Programs may be downloaded over the Internet to a computer device, which may be a personal computer, handheld device, workstation, distributed computer system, or another computer device.


While certain exemplary embodiments have been described and shown in the accompanying drawings, it is to be understood that such embodiments are merely illustrative and not restrictive of the broad invention and that this invention is not limited to the specific constructions and arrangements shown and described, since various other modifications may occur to those ordinarily skilled in the art upon studying this disclosure. In an area of technology such as this, where growth is fast, the disclosed embodiments may be readily modifiable in arrangement and detail as facilitated by enabling technological advancements without departing from the principles of the present disclosure. It is intended that the appended claims be construed to include alternate implementations to the extent permitted.

Claims
  • 1. A method comprising: electronically translating, by at least one processor during an automated translation process, a first plurality of words in a source language so as to obtain a second plurality of words in a target language, wherein electronically translating comprises: performing lexical-morphological analysis of the first plurality of words to generate a lexical-morphological structure of at least one sentence in the first plurality of words,performing syntactic analysis using the lexical-morphological structure of the at least one sentence to generate a language-independent semantic structure,performing syntactic synthesis based on the language-independent semantic structure to generate the second plurality of words;identifying first one or more likely erroneous words in the first plurality of words and corresponding second one or more likely erroneous words in the second plurality of words;displaying, on a display device, the first plurality of words in the source language;displaying, on the display device, the second plurality of words in the target language;automatically indicating, on the display device as part of the automated translation process, the first one or more likely erroneous words within the displayed first plurality of words in the source language;automatically indicating, on the display device as part of the automated translation process, the second one or more likely erroneous words within the displayed second plurality of words in the target language;receiving a change to the first one or more likely erroneous words; andmodifying the second plurality of words to provide another translation in the target language based on the change in the first one or more likely erroneous words.
  • 2. The method of claim 1, wherein the first one or more likely erroneous words comprise a word with a lexical error.
  • 3. The method of claim 1, wherein the first one or more likely erroneous words comprise a plurality of words with a syntactical error.
  • 4. The method of claim 1, further comprising displaying two adjacent windows comprising one window for words in the source language and another window for translated words in the target language.
  • 5. The method of claim 1, wherein receiving the change comprises displaying alternatives for substitution with the first one or more likely erroneous words that resemble the first one or more likely erroneous words and providing a capability to select at least one of the alternatives.
  • 6. The method of claim 5, further comprising providing a capability to specify a subject of the first plurality of words and adjusting the alternatives to be consistent with the subject.
  • 7. The method of claim 1, wherein automatically indicating the first one or more likely erroneous words comprises indicating different lexical errors or syntactical errors associated with the first one or more likely erroneous words by different distinctive display styles.
  • 8. The method of claim 7, wherein the lexical errors are identified differently from the syntactical errors.
  • 9. The method of claim 1, wherein identifying the first one or more likely erroneous words comprises identifying one or more words that are not stored in connection with electronically translating the first plurality of words.
  • 10. The method of claim 1, wherein electronically translating comprises computing ratings for syntactic constructions, and wherein identifying the first one or more likely erroneous words comprises identifying one or more words corresponding to the syntactic constructions that have low ones of the ratings.
  • 11. A system comprising: a display device; andat least one processor configured to: electronically translate, during an automated translation process, a first plurality of words in a source language so as to obtain a second plurality of words in a target language, wherein, to electronically translate, the processor is to: perform lexical-morphological analysis of the first plurality of words to generate a lexical-morphological structure of at least one sentence in the first plurality of words,perform syntactic analysis using the lexical-morphological structure of the at least one sentence to generate a language-independent semantic structure,perform syntactic synthesis based on the language-independent semantic structure to generate the second plurality of words, andidentify first one or more potentially erroneous words in the first plurality of words and corresponding second one or more potentially erroneous words in the second plurality of words;display, on the display device, the first plurality of words in the source language;display, on the display device, the second plurality of words in the target language;automatically indicate, on the display device as part of the automated translation process, the first one or more potentially erroneous words within the displayed first plurality of words in the source language;automatically indicate, on the display device as part of the automated translation process, the second one or more potentially erroneous words within the displayed second plurality of words in the target language;receive a change to the first one or more potentially erroneous words; andmodify the second plurality of words to provide another translation in the target language based on the change in the first one or more potentially erroneous words.
  • 12. The system of claim 11, wherein the first one or more potentially erroneous words comprise a word with a lexical error.
  • 13. The system of claim 11, wherein the first one or more potentially erroneous words comprise a plurality of words with a syntactical error.
  • 14. The system of claim 11, wherein, to receive the change, the processor is further to display alternatives for substitution with the first one or more potentially erroneous words that resemble the first one or more potentially erroneous words and to provide a capability to select at least one of the alternatives.
  • 15. A non-transitory computer-readable medium having instructions stored therein that, when executed by at least one processor, cause the processor to: electronically translate, by the processor during an automated translation process, a first plurality of words in a source language so as to obtain a second plurality of words in a target language, wherein, to electronically translate, the processor is to: perform lexical-morphological analysis of the first plurality of words to generate a lexical-morphological structure of at least one sentence in the first plurality of words,perform syntactic analysis using the lexical-morphological structure of the at least one sentence to generate a language-independent semantic structure,perform syntactic synthesis based on the language-independent semantic structure to generate the second plurality of words, andidentify first one or more likely erroneous words in the first plurality of words and corresponding second one or more likely erroneous words in the second plurality of words;display, on a display device, the first plurality of words in the source language;display, on the display device, the second plurality of words in the target language;automatically indicate, on the display device as part of the automated translation process, the first one or more likely erroneous words within the displayed first plurality of words in the source language;automatically indicate, on the display device as part of the automated translation process, the second one or more likely erroneous words within the displayed second plurality of words in the target language;receive a change to the first one or more likely erroneous words; andmodify the second plurality of words to provide another translation in the target language based on the change in the first one or more likely erroneous words.
  • 16. The computer-readable medium of claim 15, wherein, to receive the change, the processor is further to display alternatives for substitution with the first one or more likely erroneous words that resemble the first one or more likely erroneous words and to provide a capability to select at least one of the alternatives.
  • 17. The computer-readable medium of claim 16, wherein the instructions further cause the processor to provide a capability to specify a subject of the first plurality of words and to adjust the alternatives to be consistent with the subject.
  • 18. The computer-readable medium of claim 15, wherein, to automatically indicate the first one or more likely erroneous words, the processor is further to indicate different lexical errors or syntactical errors associated with the first one or more likely erroneous words by different distinctive display styles.
  • 19. The computer-readable medium of claim 15, wherein, to electronically translate, the processor is further to compute ratings for syntactic constructions, and wherein, to identify the first one or more likely erroneous words, the processor is further to identify one or more words corresponding to the syntactic constructions that have low ones of the ratings.
CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation of U.S. patent application Ser. No. 13/359,392 filed on Jan. 26, 2012, now U.S. Pat. No. 8,959,011 issued Feb. 17, 2015, which is a continuation-in-part of U.S. patent application Ser. No. 11/690,102 titled “Translating Sentences Between Languages Using Language-Independent Semantic Structures and Ratings of Syntactic Constructions,” filed on Mar. 22, 2007, now issued U.S. Pat. No. 8,195,447 (with issue date of Jun. 5, 2012). All subject matter of the U.S. patent application Ser. No. 13/359,392 and of all its parent, grandparent, great-grandparent, etc. applications is incorporated herein by reference to the extent such subject matter is not inconsistent herewith.

US Referenced Citations (194)
Number Name Date Kind
4599612 Kaji Jul 1986 A
4706212 Toma Nov 1987 A
5068789 Van Vliembergen Nov 1991 A
5128865 Sadler Jul 1992 A
5146405 Church Sep 1992 A
5175684 Chong Dec 1992 A
5268839 Kaji Dec 1993 A
5301109 Landauer et al. Apr 1994 A
5386556 Hedin et al. Jan 1995 A
5418717 Su et al. May 1995 A
5426583 Uribe-Echebarria Diaz De Mendibil Jun 1995 A
5475587 Anick et al. Dec 1995 A
5477451 Brown et al. Dec 1995 A
5490061 Tolin et al. Feb 1996 A
5497319 Chong et al. Mar 1996 A
5510981 Berger et al. Apr 1996 A
5535120 Chong et al. Jul 1996 A
5550934 Van Vliembergen et al. Aug 1996 A
5559693 Anick et al. Sep 1996 A
5677835 Carbonell et al. Oct 1997 A
5678051 Aoyama Oct 1997 A
5687383 Nakayama et al. Nov 1997 A
5696980 Brew Dec 1997 A
5715468 Budzinski Feb 1998 A
5721938 Stuckey Feb 1998 A
5724593 Hargrave et al. Mar 1998 A
5737617 Bernth et al. Apr 1998 A
5752051 Cohen May 1998 A
5768603 Brown et al. Jun 1998 A
5784489 Van Vliembergen et al. Jul 1998 A
5787410 McMahon Jul 1998 A
5794050 Dahlgren et al. Aug 1998 A
5794177 Carus et al. Aug 1998 A
5799268 Boguraev Aug 1998 A
5826219 Kutsumi Oct 1998 A
5826220 Takeda et al. Oct 1998 A
5848385 Poznanski et al. Dec 1998 A
5867811 O'Donoghue Feb 1999 A
5873056 Liddy et al. Feb 1999 A
5884247 Christy Mar 1999 A
6006221 Liddy et al. Dec 1999 A
6016467 Newsted et al. Jan 2000 A
6055528 Evans Apr 2000 A
6076051 Messerly et al. Jun 2000 A
6081774 de Hita et al. Jun 2000 A
6182028 Karaali et al. Jan 2001 B1
6223150 Duan et al. Apr 2001 B1
6233544 Alshawi May 2001 B1
6243669 Horiguchi et al. Jun 2001 B1
6243670 Bessho et al. Jun 2001 B1
6243689 Norton Jun 2001 B1
6246977 Messerly et al. Jun 2001 B1
6260008 Sanfilippo Jul 2001 B1
6266642 Franz et al. Jul 2001 B1
6275789 Moser et al. Aug 2001 B1
6278967 Akers et al. Aug 2001 B1
6282507 Horiguchi et al. Aug 2001 B1
6285978 Bernth et al. Sep 2001 B1
6330530 Horiguchi et al. Dec 2001 B1
6356864 Foltz et al. Mar 2002 B1
6356865 Franz et al. Mar 2002 B1
6381598 Williamowski et al. Apr 2002 B1
6393389 Chanod et al. May 2002 B1
6463404 Appleby Oct 2002 B1
6470306 Pringle et al. Oct 2002 B1
6529865 Duan et al. Mar 2003 B1
6601026 Appelt et al. Jul 2003 B2
6604101 Chan et al. Aug 2003 B1
6622123 Chanod et al. Sep 2003 B1
6658627 Gallup et al. Dec 2003 B1
6721697 Duan et al. Apr 2004 B1
6760695 Kuno et al. Jul 2004 B1
6778949 Duan et al. Aug 2004 B2
6871174 Dolan et al. Mar 2005 B1
6871199 Binnig et al. Mar 2005 B1
6901399 Corston et al. May 2005 B1
6901402 Corston-Oliver et al. May 2005 B1
6928448 Franz et al. Aug 2005 B1
6937974 D'Agostini Aug 2005 B1
6947923 Cha et al. Sep 2005 B2
6965857 Decary Nov 2005 B1
6983240 Ait-Mokhtar et al. Jan 2006 B2
6986104 Green et al. Jan 2006 B2
7013264 Dolan et al. Mar 2006 B2
7020601 Hummel et al. Mar 2006 B1
7027974 Busch et al. Apr 2006 B1
7050964 Menzes et al. May 2006 B2
7085708 Manson Aug 2006 B2
7146358 Gravano et al. Dec 2006 B1
7167824 Kallulli Jan 2007 B2
7191115 Moore Mar 2007 B2
7200550 Menezes et al. Apr 2007 B2
7236932 Grajski Jun 2007 B1
7263488 Chu et al. Aug 2007 B2
7269594 Corston-Oliver et al. Sep 2007 B2
7346493 Ringger et al. Mar 2008 B2
7356457 Pinkham et al. Apr 2008 B2
7475015 Epstein et al. Jan 2009 B2
7620539 Gaussier et al. Nov 2009 B2
7672831 Todhunter et al. Mar 2010 B2
7739102 Bender Jun 2010 B2
8078450 Anisimovich et al. Dec 2011 B2
8078551 Bar Dec 2011 B2
8145473 Anisimovich et al. Mar 2012 B2
8214199 Anismovich et al. Jul 2012 B2
8229730 Van Den Berg et al. Jul 2012 B2
8229944 Latzina et al. Jul 2012 B2
8271453 Pasca et al. Sep 2012 B1
8285728 Rubin Oct 2012 B1
8296124 Holsztynska et al. Oct 2012 B1
8301633 Cheslow Oct 2012 B2
8402036 Blair-Goldensohn et al. Mar 2013 B2
8412513 Anisimovich et al. Apr 2013 B2
8533188 Yan et al. Sep 2013 B2
8548795 Anisimovich et al. Oct 2013 B2
8548951 Solmer et al. Oct 2013 B2
8554558 McCarley et al. Oct 2013 B2
8577907 Singhal et al. Nov 2013 B1
8918309 Tuganbaev Dec 2014 B2
8959011 Anisimovich et al. Feb 2015 B2
9047275 Parfentieva Jun 2015 B2
9053090 Anisimovich Jun 2015 B2
9069750 Zuev Jun 2015 B2
9075864 Zuev Jul 2015 B2
D746312 Danielyan Dec 2015 S
9262409 Anisimovich Feb 2016 B2
9323747 Anisimovich Apr 2016 B2
9471562 Anisimovich Oct 2016 B2
20010014902 Hu et al. Aug 2001 A1
20010029455 Chin et al. Oct 2001 A1
20020040292 Marcu Apr 2002 A1
20020065647 Hatori et al. May 2002 A1
20030145285 Miyahira et al. Jul 2003 A1
20030158723 Masuichi et al. Aug 2003 A1
20030176999 Calcagno et al. Sep 2003 A1
20030182102 Corston-Oliver et al. Sep 2003 A1
20030204392 Finnigan et al. Oct 2003 A1
20040002848 Zhou et al. Jan 2004 A1
20040098247 Moore May 2004 A1
20040122656 Abir Jun 2004 A1
20040172235 Pinkham et al. Sep 2004 A1
20040193401 Ringger et al. Sep 2004 A1
20040254781 Appleby Dec 2004 A1
20050010421 Watanabe et al. Jan 2005 A1
20050015240 Appleby Jan 2005 A1
20050080613 Colledge et al. Apr 2005 A1
20050086047 Uchimoto et al. Apr 2005 A1
20050137853 Appleby et al. Jun 2005 A1
20050155017 Berstis et al. Jul 2005 A1
20050171757 Appleby Aug 2005 A1
20050171758 Palmquist Aug 2005 A1
20050209844 Wu et al. Sep 2005 A1
20050240392 Munro et al. Oct 2005 A1
20060004563 Campbell et al. Jan 2006 A1
20060004653 Strongin Jan 2006 A1
20060080079 Yamabana Apr 2006 A1
20060095250 Chen et al. May 2006 A1
20060217964 Kamatani et al. Sep 2006 A1
20060224378 Chino et al. Oct 2006 A1
20060293876 Kamatani et al. Dec 2006 A1
20070010990 Woo Jan 2007 A1
20070016398 Buchholz Jan 2007 A1
20070083359 Bender Apr 2007 A1
20070100601 Kimura May 2007 A1
20070130563 Elgazzar Jun 2007 A1
20080133218 Zhou et al. Jun 2008 A1
20080228464 Al-Onaizan et al. Sep 2008 A1
20090070094 Best et al. Mar 2009 A1
20090083023 Foster et al. Mar 2009 A1
20100082324 Itagaki et al. Apr 2010 A1
20110055188 Gras Mar 2011 A1
20110246173 Li et al. Oct 2011 A1
20110301941 De Vocht Dec 2011 A1
20120023104 Johnson et al. Jan 2012 A1
20120030226 Holt et al. Feb 2012 A1
20120131060 Heidasch May 2012 A1
20120197628 Best et al. Aug 2012 A1
20120197885 Patterson Aug 2012 A1
20120203777 Laroco, Jr. et al. Aug 2012 A1
20120221553 Wittmer et al. Aug 2012 A1
20120246153 Pehle Sep 2012 A1
20120271627 Danielyan Oct 2012 A1
20120296897 Xin-Jing et al. Nov 2012 A1
20130013291 Bullock et al. Jan 2013 A1
20130054589 Cheslow Feb 2013 A1
20130091113 Gras Apr 2013 A1
20130132065 Danielyan May 2013 A1
20130138696 Turdakov et al. May 2013 A1
20130144592 Och et al. Jun 2013 A1
20130144594 Bangalore et al. Jun 2013 A1
20130185307 El-Yaniv et al. Jul 2013 A1
20130254209 Kang Sep 2013 A1
20140012842 Yan et al. Jan 2014 A1
20140114649 Zuev et al. Apr 2014 A1
Foreign Referenced Citations (2)
Number Date Country
2400400 Dec 2011 EP
2011160204 Dec 2011 WO
Non-Patent Literature Citations (3)
Entry
Bolshakov, “Co-Ordinative Ellipsis in Russian Texts: Problems of Description and Restoration”, Published in: Proceeding COLING '88 Proceedings of the 12th conference on Computational linguistics—vol. 1 doi>10.3115/991635.991649, 1988, 65-67.
Hutchins, “Machine Translation: past, present, future”, (Ellis Horwood Series in Computers and their Applications) Ellis Horwood: Chichester, 1986, 382 pp. ISBN 0-85312-788-3, $49.95 (hb).
Mitamura, et al., “An Efficient Interlingua Translation System for Multi-Lingual Document Production”, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.5702, Jul. 1, 1991.
Related Publications (1)
Number Date Country
20140257786 A1 Sep 2014 US
Continuations (1)
Number Date Country
Parent 13359392 Jan 2012 US
Child 14284833 US
Continuation in Parts (1)
Number Date Country
Parent 11690102 Mar 2007 US
Child 13359392 US