Method and System for Automatic Management of Reputation of Translators

Abstract

The present invention provides a method that includes receiving a result word set in a target language representing a translation of a test word set in a source language. When the result word set is not in a set of acceptable translations, the method includes measuring a minimum number of edits to transform the result word set into a transform word set. The transform word set is in the set of acceptable translations. A system is provided that includes a receiver to receive a result word set and a counter to measure a minimum number of edits to transform the result word set into a transform word set. A method is provided that includes automatically determining a translation ability of a human translator based on a test result. The method also includes adjusting the translation ability of the human translator based on historical data of translations performed by the human translator.

Description

FIELD OF THE INVENTION

The present invention relates generally to managing an electronic marketplace for translation services, and more specifically, to a method and system for determining an initial reputation of a translator using testing and adjusting the reputation based on service factors.

BACKGROUND

Translation of written materials from one language into another are required more often and are becoming more important as information moves globally and trade moves worldwide. Translation is often expensive and subject to high variability depending on the translator, whether human or machine.

Translations are difficult to evaluate since each sentence may be translated in more than one way.

Marketplaces are used to drive down costs for consumers, but typically require a level of trust by a user. Reputation of a seller may be communicated in any number of ways, including word of mouth and online reviews, and may help instill trust in a buyer for a seller.

SUMMARY OF THE INVENTION

According to exemplary embodiments, the present invention provides a method that includes receiving a result word set in a target language representing a translation of a test word set in a source language. When the result word set is not in a set of acceptable translations, the method includes measuring a minimum number of edits to transform the result word set into a transform word set. The transform word set is one of the set of acceptable translations.

A system is provided that includes a receiver to receive a result word set in a target language representing a translation of a test word set in a source language. The system also includes a counter to measure a minimum number of edits to transform the result word set into a transform word set when the result word set is not in a set of acceptable translations. The transform word set is one of the set of acceptable translations.

A method is provided that includes determining a translation ability of a human translator based on a test result. The method also includes adjusting the translation ability of the human translator based on historical data of translations performed by the human translator.

These and other advantages of the present invention will be apparent when reference is made to the accompanying drawings and the following description.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A illustrates an exemplary system for practicing aspects of the present technology.

FIG. 1B is a schematic diagram illustrating an exemplary process flow through an exemplary system;

FIG. 2 is a schematic diagram illustrating an exemplary method for constructing a set of acceptable translations;

FIG. 3A is a schematic diagram illustrating an exemplary method for developing a search space;

FIGS. 3B-3D collectively illustrate three partial views that form the single complete view of FIG. 3A.

FIG. 4 illustrates an exemplary computing device that may be used to implement an embodiment of the present technology;

FIG. 5 is a flow chart illustrating an exemplary method;

FIGS. 6A to 6D are tables illustrating various aspects of the exemplary method;

FIG. 7 compares rankings of five machine translation systems according to several widely used metrics; and

FIG. 8 illustrates a graphical user interface for building large networks of meaning equivalents.

DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS

While this invention is susceptible of embodiment in many different forms, there is shown in the drawings and will herein be described in detail several specific embodiments with the understanding that the present disclosure is to be considered as an exemplification of the principles of the invention and is not intended to limit the invention to the embodiments illustrated. According to exemplary embodiments, the present technology relates generally to translations services. More specifically, the present invention provides a system and method for evaluating the translation ability of a human or machine translator, and for ongoing reputation management of a human translator.

FIG. 1A illustrates an exemplary system 100 for practicing aspects of the present technology. The system 100 may include a translation evaluation system 105 that may be implemented in a cloud-based computing environment. A cloud-based computing environment is a resource that typically combines the computational power of a large grouping of processors and/or that combines the storage capacity of a large grouping of computer memories or storage devices. For example, systems that provide a cloud resource may be utilized exclusively by their owners; or such systems may be accessible to outside users who deploy applications within the computing infrastructure to obtain the benefit of large computational or storage resources.

The cloud may be formed, for example, by a network of web servers, with each web server (or at least a plurality thereof) providing processor and/or storage resources. These servers may manage workloads provided by multiple users (e.g., cloud resource customers or other users). Typically, each user places workload demands upon the cloud that vary in real-time, sometimes dramatically. The nature and extent of these variations typically depend on the type of business associated with the user.

In other embodiments, the translation evaluation system 105 may include a distributed group of computing devices such as web servers that do not share computing resources or workload. Additionally, the translation evaluation system 105 may include a single computing system that has been provisioned with a plurality of programs that each produces instances of event data.

Users offering translation services and/or users requiring translation services may interact with the translation evaluation system 105 via a client device 110, such as an end user computing system or a graphical user interface. The translation evaluation system 105 may communicatively couple with the client device 110 via a network connection 115. The network connection 115 may include any one of a number of private and public communications mediums such as the Internet.

In some embodiments, the client device 110 may communicate with the translation evaluation system 105 using a secure application programming interface or API. An API allows various types of programs to communicate with one another in a language (e.g., code) dependent or language agnostic manner.

FIG. 1B is a schematic diagram illustrating an exemplary process flow through translation evaluation system 150. Translation evaluation system 150 is used to evaluate translation 170, which is a translation of a source language test word set by a human translator or a machine translator. Translation 170 is input into comparator 182 of evaluator 180. Comparator 182 accesses acceptable translation database 160, which includes a set of acceptable translations of the source language test word set, and determines if there is an identity relationship between translation 170 and one of the acceptable translations. If there is an identity relationship, then score 190 is output as a perfect score, which may be a “0”. Otherwise, the flow in the system proceeds to transformer 184, which also accesses acceptable translation database 160. Acceptable translation database 160 may be populated by human translators or machine translators, or some combination of the two. The techniques described herein may be used to populate acceptable translation database 160 based on outputs of multiple translators. Transformer 184 determines the minimum number of edits required to change translation 170 into one of the acceptable translations. An edit may be a substitution, a deletion, an insertion, and/or a move of a word in translation 170. After the minimum number of edits is determined, the flow proceeds to counter 186, which counts the minimum number of edits and other translation characteristics such as n-gram overlap between the two translations. The number of edits need to transform translation 170 into one of the acceptable translations is then output from evaluator 180 as score 190.

During the last decade, automatic evaluation metrics have helped researchers accelerate the pace at which they improve machine translation (MT) systems. Human-assisted metrics have enabled and supported large-scale U.S. government sponsored programs. However, these metrics have started to show signs of wear and tear.

Automatic metrics are often criticized for providing non-intuitive scores—for example, few researchers can explain to casual users what a BLEU score of 27.9 means. And researchers have grown increasingly concerned that automatic metrics have a strong bias towards preferring statistical translation outputs; the NIST (2008, 2010), MATR (Gao et al., 2010) and WMT (Callison-Burch et al., 2011) evaluations held during the last five years have provided ample evidence that automatic metrics yield results that are inconsistent with human evaluations when comparing statistical, rule-based, and human outputs.

In contrast, human-informed metrics have other deficiencies: they have large variance across human judges (Bojar et al., 2011) and produce unstable results from one evaluation to another (Przybocki et al., 2011). Because evaluation scores are not computed automatically, systems developers cannot automatically tune to human-based metrics.

FIG. 6A is table 600 illustrating properties of evaluation metrics including an automatic metric, a human metric, and a proposed metric. FIG. 6A summarizes the dimensions along which evaluation metrics should do well and the strengths and weaknesses of the automatic and human-informed metrics proposed to date. One goal is to develop metrics that do well along all these dimensions. The failures of current automatic metrics are not algorithmic: BLEU, Meteor, TER (Translation Edit Rate), and other metrics efficiently and correctly compute informative distance functions between a translation and one or more human references. These metrics fail simply because they have access to sets of human references that are too small. Access to the set of all correct translations of a given sentence would enable measurement of the minimum distance between a translation and the set. When a translation is perfect, it can be found in the set, so it requires no editing to produce a perfect translation. Therefore, its score should be zero. If the translation has errors, the minimum number of edits (substitutions, deletions, insertions, moves) needed to rewrite the translation into the “closest” reference in the set can be efficiently computed. Current automatic evaluation metrics do not assign their best scores to most perfect translations because the set of references they use is too small; their scores can therefore be perceived as less intuitive.

Following these considerations, an annotation tool is provided that enables one to efficiently create an exponential number of correct translations for a given sentence, and present a new evaluation metric, HyTER, which efficiently exploits these massive reference networks. The following description describes an annotation environment, process, and meaning-equivalent representations. A new metric, the HyTER metric, is presented. This new metric provides better support than current metrics for machine translation evaluation and human translation proficiency assessment. A web-based annotation tool can be used to create a representation encoding an exponential number of meaning equivalents for a given sentence. The meaning equivalents are constructed in a bottom-up fashion by typing translation equivalents for larger and larger phrases. For example, when building the meaning equivalents for the Spanish phrase “el primer ministro italiano Silvio Berlusconi”, the annotator may first type in the meaning equivalents for “primer ministro”—prime-minister; PM; prime minister; head of government; premier; etc.; “italiano”—Italiani; and “Silvio Berlusconi”—Silvio Berlusconi; Berlusconi. The tool creates a card that stores all the alternative meanings for a phrase as a determined finite-state acceptor (FSA) and gives it a name in the target language that is representative of the underlying meaning-equivalent set: [PRIME-MINISTER], [ITALIAN], and [SILVIO-BERLUSCONI]. Each base card can be thought of as expressing a semantic concept. A combination of existing cards and additional words can be subsequently used to create larger meaning equivalents that cover increasingly larger source sentence segments. For example, to create the meaning equivalents for “el primer ministro italiano” one can drag-and-drop existing cards or type in new words: the [ITALIAN] [PRIME-MINISTER]; the [PRIME-MINISTER] of Italy; to create the meaning equivalents for “el primer ministro italiano Silvio Berlusconi”, one can drag-and-drop and type: [SILVIO-BERLUSCONI], [THE-ITALIAN-PRIME-MINISTER]; [THE-ITALIAN-PRIME-MINISTER], [SILVIO-BERLUSCONI]; [THE-ITALIAN-PRIME-MINISTER] [SILVIO-BERLUSCONI]. All meaning equivalents associated with a given card are expanded and used when that card is re-used to create larger meaning equivalent sets.

FIG. 8 illustrates graphical user interface (GUI) 800 for building large networks of meaning equivalents. Source sentence 810 is displayed within GUI 800, and includes several strings of words. One string of words in source sentence 810 has been translated in two different ways. The two acceptable translations of the string are displayed in acceptable translation area 820. All possible acceptable translations are produced by the interface software by combining hierarchically the elements of several possible acceptable translations for sub-strings of the source string of source sentence 810. The resulting lattice 830 of acceptable sub-string translations illustrates all acceptable alternative translations that correspond to a given text segment.

The annotation tool supports, but does not enforce, re-use of annotations created by other annotators. The resulting meaning equivalents are stored as recursive transition networks (RTNs), where each card is a subnetwork; if needed, these non-cyclic RTNs can be automatically expanded into finite-state acceptors (FSAs). Using the annotation tool, meaning-equivalent annotations for 102 Arabic and 102 Chinese sentences have been created—a subset of the “progress set” used in the 2010 Open MT NIST evaluation (the average sentence length was 24 words). For each sentence, four human reference translations produced by LDC and five MT system outputs were accessed, which were selected by NIST to cover a variety of system architectures (statistical, rule-based, hybrid) and performances. For each MT output, sentence-level HTER scores (Snover et al., 2006) were accessed, which were produced by experienced LDC annotators.

Three annotation protocols may be used: 1) Ara-A2E and Chi-C2E: Foreign language natives built English networks starting from foreign language sentences; 2) Eng-A2E and Eng-C2E: English natives built English networks starting from “the best translation” of a foreign language sentence, as identified by NIST; and 3) Eng*-A2E and Eng*-C2E: English natives built English networks starting from “the best translation”. Additional, independently produced human translations may be used and/or accessed to boost creativity.

Each protocol may be implemented independently by at least three annotators. In general, annotators may need to be fluent in the target language, familiar with the annotation tool provided, and careful not to generate incorrect paths, but they may not need to be linguists.

Multiple annotations may be exploited by merging annotations produced by various annotators, using procedures such as those described below. For each sentence, all networks that were created by the different annotators are combined. Two different combination methods are evaluated, each of which combines networks N1 and N2 of two annotators (see, for example, FIG. 2). First, the standard union U(N1;N2) operation combines N1 and N2 on the whole-network level. When traversing U(N1;N2), one can follow a path that comes from either N1 or N2. Second, source-phrase-level union SPU(N1;N2) may be used. As an alternative, SPU is a more fine-grained union which operates on sub-sentence segments. Each annotator explicitly aligns each of the various subnetworks for a given sentence to a source span of that sentence. Now for each pair of subnetworks (S1; S2) from N1 and N2, their union is built if they are compatible. Two subnetworks S1; S2 are defined to be compatible if they are aligned to the same source span and have at least one path in common.

FIG. 2 is a schematic diagram illustrating exemplary method 200 for constructing a set of acceptable translations. First deconstructed translation set 210 represents a deconstructed translation of a source word set, in this case a sentence, made by a first translator. First deconstructed translation set 210 is a sentence divided into four parts, subject clause 240, verb 245, adverbial clause 250, and object 255. Subject clause 240 is translated by the first translator in one of two ways, either “the level of approval” or “the approval rate”. Likewise, adverbial clause 250 is translated by the first translator in one of two ways, either “close to” or “practically”. Both verb 245 and object 255 are translated by the first translator in only one way, namely “was” and “zero”, respectively. First deconstructed translation set 210 generates four (due to the multiplication of the different possibilities, namely two times one times two times one) acceptable translations.

A second translator translates the same source word set to arrive at second deconstructed translation set 220, which includes overlapping but not identical translations, and also generates four acceptable translations. One of the translations generated by second deconstructed translation set 220 is identical to one of the translations generated by first deconstructed translation set 210, namely “the approval rate was close to zero”. Therefore, the union of the outputs of first deconstructed translation set 210 and second deconstructed translation set 220 yields seven acceptable translations. This is one possible method of populating a set of acceptable translations.

However, a larger, more complete set of acceptable translations may result from combining elements of subject clause 240, verb 245, adverbial clause 250, and object 255 for both first deconstructed translation set 210 and second deconstructed translation set 220 to yield third deconstructed translation set 230. Third deconstructed translation set 230 generates nine (due to the multiplication of the different possibilities, namely three times one times three times one) acceptable translations. Third deconstructed translation set 230 generates two additional translations that do not result from the union of the outputs of first deconstructed translation set 210 and second deconstructed translation set 220 yields. In particular, third deconstructed translation set 230 generates additional translation “the approval level was practically zero” and “the level of approval was about equal to zero”. In this manner, a large set of acceptable translations can be generated from the output of two translators.

The purpose of source-phrase-level union (SPU) is to create new paths by mixing paths from N1 and N2. In FIG. 2, for example, the path “the approval level was practically zero” is contained in the SPU, but not in the standard union. SPUs are built using a dynamic programming algorithm that builds subnetworks bottom-up, thereby building unions of intermediate results. Two larger subnetworks can be compatible only if their recursive smaller subnetworks are compatible. Each SPU contains at least all paths from the standard union.

Some empirical findings may characterize the annotation process and the created networks. When comparing the productivity of the three annotation protocols in terms of the number of reference translations that they enable, the target language natives that have access to multiple human references produce the largest networks. The median number of paths produced by one annotator under the three protocols varies from 7.7 times 10 to the 5th power paths for Ara-A2E, to 1.4 times 10 to the 8th power paths for Eng-A2E, to 5.9 times 10 to the 8th power paths for Eng*-A2E. In Chinese, the medians vary from 1.0 times 10 to the 5th power for Chi-C2E, to 1.7 times 10 to the 8th power for Eng-C2E, to 7.8 times 10 to the 9th power for Eng*-C2E.

Referring now collectively to FIGS. 3A-3D, a metric for measuring translation quality with large reference networks of meaning equivalents is provided, and is entitled HyTER (Hybrid Translation Edit Rate). HyTER is an automatically computed version of HTER (Snover et al., 2006). HyTER computes the minimum number of edits between a translation x (hypothesis x 310 of FIG. 3A) and an exponentially sized reference set Y, which may be encoded as a Recursive Transition Network (Reference RTN Y 340 of FIG. 3A). Perfect translations may have a HyTER score of 0.

FIG. 3A is a schematic diagram illustrating a model 300 for developing a search space. The model 300 includes a hypothesis-x 310, a reordered hypothesis Πx 320, a Levenshtein transducer 330, and a reference RTN Y 340. The model 300 illustrates a lazy composition H(x;Y) of the reordered hypothesis Πx 320, the Levenshtein transducer 330, and the reference RTN Y 340. An unnormalized HyTER score may be defined and normalized by the number of words in the found closest path. This minimization problem may be treated as graph-based search. The search space over which we minimize is implicitly represented as the Recursive Transition Network H, where gamma-x is encoded as a weighted FSA that represents the set of permutations of x (e.g., “Reordered hypotheses Πx 320” in FIG. 3A that represents permutations of Hypothesis x 310) with their associated distance costs, and LS is the one-state Levenshtein transducer 330 whose output weight for a string pair (x,y) is the Levenshtein distance between x and y, and symbol H(x,Y)[[y]] denotes a lazy composition of the Reordered hypotheses Πx 320, the Levenshtein transducer 330, and the reference RTN Y 340, as illustrated in FIG. 3A. The model 300 is depicted in FIGS. 3A-3D, which is a schematic diagram illustrating an exemplary method for developing a search space H(x,Y).

An FSA gamma-x-allows permutations (Πx 320) according to certain constraints. Allowing all permutations of the hypothesis x 310 would increase the search space to factorial size and make inference NP-complete (Cormode and Muthukrishnan, 2007). Local-window constraints (see, e.g., Kanthak et al. (2005)) are used, where words may move within a fixed window of size k. These constraints are of size O(n) with a constant factor k, where n is the length of the translation hypothesis x 310. For efficiency, lazy evaluation may be used when defining the search space H(x;Y). Gamma-x may never be explicitly composed, and parts of the composition that the inference algorithm does not explore may not be constructed, saving computation time and memory. Permutation paths IIx 320 in gamma-x may be constructed on demand. Similarly, the reference set Y 340 may be expanded on demand, and large parts of the reference set Y 340 may remain unexpanded.

These on-demand operations are supported by the OpenFst library (Allauzen et al., 2007). Specifically, to expand the RTNs into FSAs, the Replace operation may be used. To compute some data, any shortest path search algorithm may be applied. Computing the HyTER score may take 30 ms per sentence on networks by single annotators (combined all-annotator networks: 285 ms) if no reordering is used. These numbers increase to 143 ms (1.5 secs) for local reordering with window size 3, and 533 ms (8 secs) for window size 5. Many speedups for computing the score with reorderings are possible. However using reordering does not give consistent improvements.

As a by-product of computing the HyTER score, one can obtain the closest path itself, for error analysis. It can be useful to separately count the numbers of insertions, deletions, etc., and inspect the types of error. For example, one may find that a particular system output tends to be missing the finite verb of the sentence or that certain word choices were incorrect.

Meaning-equivalent networks may be used for machine translation evaluation. Experiments were designed to measure how well HyTER performs, compared to other evaluation metrics. For these experiments, 82 of the 102 available sentences were sampled, and 20 sentences were held out for future use in optimizing the metric.

Differentiating human from machine translation outputs may be achieved by scoring the set of human translations and machine translations separately, using several popular metrics, with the goal of determining which metric performs better at separating machine translations from human translations. To ease comparisons across different metrics, all scores may be normalized to a number between 0 (best) and 100 (worst). FIG. 6B shows the normalized mean scores for the machine translations and human translations under multiple automatic and one human evaluation metric (Likert). FIG. 6B is table 610 illustrating scores assigned to human versus machine translations under various metrics. Each score is normalized to range from 100 (worst) to 0 (perfect translation). The quotient of interest, m=h, is the mean score for machine translations divided by the mean score for the human translations. The higher this number, the better a metric separates machine from human produced outputs.

Under HyTER, m=h is about 1.9, which shows that the HyTER scores for machine translations are, on average, almost twice as high as for human translations. Under Likert (a score assigned by human annotators who compare pairs of sentences at a time), the quotient is higher, suggesting that human raters make stronger distinctions between human and machine translations. The quotient is lower under the automatic metrics Meteor (Version 1.3, (Denkowski and Lavie, 2011)), BLEU and TERp (Snover et al., 2009). These results show that HyTER separates machine from human translations better than alternative metrics.

The five machine translation systems are ranked according to several widely used metrics (see FIG. 7). The results show that BLEU, Meteor and TERp do not rank the systems in the same way as HTER and humans do, while the HyTER metric may yield a better ranking. Also, separation between the quality of the five systems is higher under HyTER, HTER, and Likert than under alternative metrics.

The current metrics (e.g., BLEU, Meteor, TER) correlate well with HTER and human judgments on large test corpora (Papineni et al., 2002; Snover et al., 2006; Lavie and Denkowski, 2009). However, the field of MT may be better served if researchers have access to metrics that provide high correlation at the sentence level as well. To this end, the correlation of various metrics with the Human TER (HTER) metric for corpora of increasingly larger sizes is estimated.

Language Testing units assess the translation proficiency of thousands of applicants interested in performing language translation work for the US Government and Commercial Language Service Organizations. Job candidates may typically take a written test in which they are asked to translate four passages (i.e., paragraphs) of increasing difficulty into English. The passages are at difficulty levels 2, 2+, 3, and 4 on the Interagency Language Roundable (ILR) scale. The translations produced by each candidate are manually reviewed to identify mistranslation, word choice, omission, addition, spelling, grammar, register/tone, and meaning distortion errors. Each passage is then assigned one of five labels: Successfully Matches the definition of a successful translation (SM); Mostly Matches the definition (MM); Intermittently Matches (IM); Hardly Matches (HM); Not Translated (NT) for anything where less than 50% of a passage is translated. There are a set of more than 100 rules that agencies practically use to assign each candidate an ILR translation proficiency level: 0, 0+, 1, 1+, 2, 2+, 3, and 3+. For example, a candidate who produces passages labeled as SM, SM, MM, IM for difficulty levels 2, 2+, 3, and 4, respectively, is assigned an ILR level of 2+.

The assessment process described above can be automated. To this end, the exam results of 195 candidates were obtained, where each exam result consists of three passages translated into English by a candidate, as well as the manual rating for each passage translation (i.e., the gold labels SM, MM, IM, HM, or NT). 49 exam results are from a Chinese exam, 71 from a Russian exam and 75 from a Spanish exam. The three passages in each exam are of difficulty levels 2, 2+, and 3; level 4 is not available in the data set. In each exam result, the translations produced by each candidate are sentence-aligned to their respective foreign sentences. The passage-to-ILR mapping rules described above are applied to automatically create a gold overall ILR assessment for each exam submission. Since the languages used here have only 3 passages each, some rules map to several different ILR ratings. FIG. 6C shows the label distribution at the ILR assessment level across all languages. FIG. 6C is table 620 illustrating the percentage of exams with ILR levels 0, 0+, . . . , 3+ as gold labels. Multiple levels per exam are possible.

The proficiency of candidates who take a translation exam may be automatically assessed. This may be a classification task where, for each translation of the three passages, the three passage assessment labels, as well as one overall ILR rating, may be predicted. In support of the assessment, annotators created an English HyTER network for each foreign sentence in the exams. These HyTER networks then serve as English references for the candidate translations. The median number of paths in these HyTER networks is 1.6 times 10 to the 6th paths/network.

A set of submitted exam translations, each of which is annotated with three passage-level ratings and one overall ILR rating, is used. Features are developed that describe each passage translation in its relation to the HyTER networks for the passage. A classifier is trained to predict passage-level ratings given the passage-level features that describe the candidate translation. As a classifier, a multi-class support-vector machine (SVM, Krammer and Singer (2001)) may be used. In decoding, a set of exams without their ratings may be observed, the features derived, and the trained SVM used to predict ratings of the passage translations. An overall ILR rating based on the predicted passage-level ratings may be derived. A 10-fold cross-validation may be run to compensate for the small dataset.

Features describing a candidate's translation with respect to the corresponding HyTER reference networks may be defined. Each of the feature values is computed based on a passage translation as a whole, rather than sentence-by-sentence. As features, the HyTER score is used, as well as the number of insertions, deletions, substitutions, and insertions-or-deletions. These numbers are used when normalized by the length of the passage, as well as when unnormalized. N-gram precisions (for n=1, . . . , 20) are also used as features. The actual assignment of reputation may additionally be based on one or more of several other test-related factors.

Predicting the ILR score for a human translator, is not a requirement for performing the exemplary method described herein. Rather, it is one possible way to grade human translation proficiency. Reputation assignment according to the present technology can be done consistent with ILR, the American Translation Association (ATA) certification, and/or several other non-test related factors (for example price, response time, etc). The exemplary method shown herein utilizes ILR, but the same process may be applied for the ATA certification. The non-test specific factors pertain to creating a market space and enable the adjustment of a previous reputation based on market participation data.

The accuracy in predicting the overall ILR rating of the 195 exams is shown in table 630 of FIG. 6D. The results in two or better show how well a performance level of 2, 2+, 3 or 3+ can be predicted. It is important to retrieve such relatively good exams with high recall, so that a manual review QA process can confirm the choices while avoid discarding qualified candidates. The results show that high recall is reached while preserving good precision. Several possible gold labels per exam are available, and therefore precision and recall are computed similar to precision and recall in the NLP task of word alignment. As a baseline method, the most frequent label per language may be assigned. These are 1+ for Chinese, and 2 for Russian and Spanish. The results in FIG. 6D suggest that the process of assigning a proficiency level to human translators can be automated.

The present application introduces an annotation tool and process that can be used to create meaning-equivalent networks that encode an exponential number of translations for a given sentence. These networks can be used as foundation for developing improved machine translation evaluation metrics and automating the evaluation of human translation proficiency. Meaning-equivalent networks can be used to support interesting research programs in semantics, paraphrase generation, natural language understanding, generation, and machine translation.

FIG. 4 illustrates exemplary computing device 400 that may be used to implement an embodiment of the present technology. The computing device 400 of FIG. 4 includes one or more processors 410 and main memory 420. Main memory 420 stores, in part, instructions and data for execution by the one or more processors 410. Main memory 420 may store the executable code when in operation. The computing device 400 of FIG. 4 further includes a mass storage device 430, portable storage medium drive(s) 440, output devices 450, user input devices 460, a display system 470, and peripheral device(s) 480.

The components shown in FIG. 4 are depicted as being connected via a single bus 490. The components may be connected through one or more data transport means. The one or more processors 410 and main memory 420 may be connected via a local microprocessor bus, and the mass storage device 430, peripheral device(s) 480, portable storage medium drive(s) 440, and display system 470 may be connected via one or more input/output (I/O) buses.

Mass storage device 430, which may be implemented with a magnetic disk drive or an optical disk drive, is a non-volatile storage device for storing data and instructions for use by the one or more processors 410. Mass storage device 430 may store the system software for implementing embodiments of the present invention for purposes of loading that software into main memory 420.

Portable storage medium drive(s) 440 operates in conjunction with a portable non-volatile storage medium, such as a floppy disk, compact disk, digital video disc, or USB storage device, to input and output data and code to and from the computing device 400 of FIG. 4. The system software for implementing embodiments of the present invention may be stored on such a portable medium and input to the computing device 400 via the portable storage medium drive(s) 440.

User input devices 460 provide a portion of a user interface. Input devices 460 may include an alphanumeric keypad, such as a keyboard, for inputting alpha-numeric and other information, or a pointing device, such as a mouse, a trackball, stylus, or cursor direction keys. Additionally, the system 400 as shown in FIG. 4 includes output devices 450. Suitable output devices include speakers, printers, network interfaces, and monitors.

Display system 470 may include a liquid crystal display (LCD) or other suitable display device. Display system 470 receives textual and graphical information, and processes the information for output to the display device.

Peripheral device(s) 480 may include any type of computer support device to add additional functionality to the computer system. Peripheral device(s) 480 may include a modem or a router.

The components provided in the computing device 400 of FIG. 4 are those typically found in computer systems that may be suitable for use with embodiments of the present invention and are intended to represent a broad category of such computer components that are well known in the art. Thus, the computing device 400 of FIG. 4 may be a personal computer, hand held computing device, telephone, mobile computing device, workstation, server, minicomputer, mainframe computer, or any other computing device. The computer may also include different bus configurations, networked platforms, multi-processor platforms, etc. Various operating systems may be used including Unix, Linux, Windows, Macintosh OS, Palm OS, Android, iPhone OS and other suitable operating systems.

It is noteworthy that any hardware platform suitable for performing the processing described herein is suitable for use with the technology. Computer-readable storage media refer to any medium or media that participate in providing instructions to a central processing unit (CPU), a processor, a microcontroller, or the like. Such media may take forms including, but not limited to, non-volatile and volatile media such as optical or magnetic disks and dynamic memory, respectively. Common forms of computer-readable storage media include a floppy disk, a flexible disk, a hard disk, magnetic tape, any other magnetic storage medium, a CD-ROM disk, digital video disk (DVD), any other optical storage medium, RAM, PROM, EPROM, a FLASHEPROM, any other memory chip or cartridge.

FIG. 5 illustrates method 500 for evaluating the translation accuracy of a translator. Method 500 starts at start oval 510 and proceeds to operation 520, which indicates to receive a result word set in a target language representing a translation of a test word set in a source language. From operation 520, the flow proceeds to operation 530, which indicates, when the result word set is not in a set of acceptable translations, to measure a minimum number of edits to transform the result word set into a transform word set, the transform word set being one of the set of acceptable translations. From operation 530, the flow proceeds to operation 540, which indicates to, optionally, determine a translation ability of the human translator based on at least the test result and an evaluation of a source language word set and a translated target language word set provided by the human translator. From operation 540, the flow proceeds to operation 550, which indicates to, optionally, determine a normalized minimum number of edits by dividing the minimum number of edits by a number of words in the transform word set. From operation 550, the flow proceeds to end oval 560.

A human translator may provide the result word set, and the method may further include determining a test result of the human translator based on the minimum number of edits.

The method may include determining a translation ability of the human translator based on at least the test result and an evaluation of a source language word set and a translated target language word set provided by the human translator. The method may also include adjusting the translation ability of the human translator based on: 1) price data related to at least one translation completed by the human translator, 2) an average time to complete translations by the human translator, 3) a customer satisfaction rating of the human translator, 4) a number of translations completed by the human translator, and/or 5) a percentage of projects completed on-time by the human translator. In one implementation, the translation ability of a human translator may be decreased/increased proportionally to the 1) price a translator is willing to complete the work—higher prices lead to a decrease in ability while lower prices lead to an increase in ability, 2) average time to complete translations—shorter times lead to higher ability, 3) customer satisfaction—higher customer satisfaction leads to higher ability, 4) number of translations completed—higher throughput lead to higher ability, and/or 5) percentage of projects completed on time—higher percent leads to higher ability. Several mathematical formulas can be used for this computation.

The result word set may be provided by a machine translator, and the method may further include evaluating a quality of the machine translator based on the minimum number of edits.

When the result word set is in the set of acceptable translations, the result word set may be given a perfect score. The minimum number of edits may be determined by counting a number of substitutions, deletions, insertions, and moves required to transform the result word set into a transform word set.

The method may include determining a normalized minimum number of edits by dividing the minimum number of edits by a number of words in the transform word set.

The method may include forming the set of acceptable translations by combining at least a first subset of acceptable translations of the test word set provided by a first translator with a second subset of acceptable translations of the test word set provided by a second translator. The method may also include identifying at least first and second sub-parts of the test word set and/or combining a first subset of acceptable translations of the first sub-part of the test word set provided by the first translator with a second subset of acceptable translations of the first sub-part of the test word set provided by the second translator. The method may further includes combining a first subset of acceptable translations of the second sub-part of the test word set provided by the first translator with a second subset of acceptable translations of the second sub-part of the test word set provided by the second translator and/or combining each one of the first and second subsets of acceptable translations of the first sub-part of the test word set with each one of the first and second subsets of acceptable translations of the second sub-part of the test word set to form a third subset of acceptable translations of the word set. The method may include adding the third subset of acceptable translations to the set of acceptable translations.

The test result may be based on a translation, received from the human translator, of a test word set in a source language into a result word set in a target language. The test result may also be based on a measure of a minimum number of edits to transform the result word set into a transform word set when the result word set is not in a set of acceptable translations, the transform word set being one of the set of acceptable translations.

The above description is illustrative and not restrictive. Many variations of the invention will become apparent to those of skill in the art upon review of this disclosure. The scope of the invention should, therefore, be determined not with reference to the above description, but instead should be determined with reference to the appended claims along with their full scope of equivalents.

Claims

1. A method, comprising receiving a result word set in a target language representing a translation of a test word set in a source language and an exponentially sized reference set;generating a translation hypothesis for the result word set;developing a search space for automated computation of a HyTER score for the translation hypothesis using a Levenshtein distance calculation between pairs of the search space comprising allowed permutations of the translation hypothesis and parts of the exponentially sized reference set, the search space comprising a lazy composition; andwherein the Levenshtein distance calculation is performed so as to save processor computation time and computer memory used for automated calculations of the HyTER score.

2. The method according to claim 1, further comprising developing the search space for automated computation of the HyTER score, wherein the lazy composition is a weighted finite-state acceptor that represents a set of allowed permutations of the translation hypothesis and associated distance costs.

3. The method according to claim 1, further comprising calculating the HyTER score for the pairs in the search space to identify a pair in the search space having a minimum edit distance.

4. The method according to claim 1, further comprising reducing a number of pairs for the lazy composition for which the Levenshtein distance.

5. The method of claim 1, wherein calculating the HyTER score for each of the pairs in the search space further comprises saving computation time and memory by not explicitly constructing parts of the lazy composition.

6. The method according to claim 1, wherein the Levenshtein distance is calculated so as to save processor computation time and computer memory used for automated calculations of the HyTER score by constraining a number of paths constructed by the processor on demand by a weighted finite-state acceptor using a fixed window size, and not constructing permutation paths of the composition outside a window.

7. The method of claim 1, wherein the result word set is generated by a machine translation system.

8. The method of claim 7, wherein the translation hypothesis is provided by a machine translation system, and further comprising evaluating a quality of the machine translation system based on the minimum number of edits.

9. The method of claim 1, wherein when the translation hypothesis is in a set of acceptable translations of the exponentially sized reference set, the translation hypothesis is given a perfect score.

10. The method according to claim 1, wherein the exponentially sized reference set is encoded as a Recursive Transition Network stored in memory of the computing environment and expanded by the processor of the computing environment on demand.

11. The method of claim 10, wherein the minimum number of edits is determined by counting a number of substitutions, deletions, insertions, and moves required to transform the translation hypothesis into each encoded acceptable translation of the exponentially sized reference set of meaning equivalents expanded on demand from the Recursive Transition Network.

12. The method of claim 11, further comprising determining a normalized minimum number of edits by dividing the minimum number of edits by a number of words in the transformed word set.

13. The method of claim 1, further comprising forming a set of acceptable translations by combining at least a first subset of acceptable translations of the test word set provided by a first translator with a second subset of acceptable translations of the test word set provided by a second translator.

14. The method of claim 13, further comprising: identifying at least first and second sub-parts of the test word set;combining a first subset of acceptable translations of the first sub-part of the test word set provided by the first translator with a second subset of acceptable translations of the first sub-part of the test word set provided by the second translator;combining a first subset of acceptable translations of the second sub-part of the test word set provided by the first translator with a second subset of acceptable translations of the second sub-part of the test word set provided by the second translator;combining each one of the first and second subsets of acceptable translations of the first sub-part of the test word set with each one of the first and second subsets of acceptable translations of the second sub-part of the test word set to form a third subset of acceptable translations of the word set;and adding the third subset of acceptable translations to the set of acceptable translations.

15. A system, comprising: a memory for storing executable instructions; anda processor for executing the instructions stored in the memory, the executable instructions comprising: a comparator executable by the processor to receive a result word set in a target language representing a translation of a test word set in a source language; anda counter executable by the processor to measure a minimum number of edits to transform the result word set into a transform word set when the result word set is not in a set of acceptable translations, the transform word set being one of the set of acceptable translations.

16. The system of claim 15, wherein the result word set is received from a human translator, and wherein the counter outputs a translation ability of the human translator based on the minimum number of edits.

17. The system of claim 16, wherein a test result is stored in the memory as an indicator of a translation ability of the human translator, and wherein the translation ability of the human translator is adjusted based on at least one of: price data related to at least one translation completed by the human translator;an average time to complete translations by the human translator;a customer satisfaction rating of the human translator;a number of translations completed by the human translator; anda percentage of projects completed on-time by the human translator.

18. The system of claim 17, further comprising a machine translator interface for receiving the result word set from a machine translator, wherein a quality of the machine translator is evaluated based on the minimum number of edits.

19. The system of claim 18, wherein when the counter measures zero, the result word set is given a perfect score.

20. The system of claim 19, wherein the minimum number of edits to transform the result word set into the transform word set comprises a minimum number of substitutions, deletions, insertions, and moves, and further comprising a transformer to identify the minimum number of substitutions, deletions, insertions, and moves, the transformer being coupled to the counter.