E-services translation utilizing machine translation and translation memory

Information

  • Patent Grant
  • 10216731
  • Patent Number
    10,216,731
  • Date Filed
    Thursday, January 19, 2017
    8 years ago
  • Date Issued
    Tuesday, February 26, 2019
    5 years ago
Abstract
A system and method for translating data from a source language to a target language is provided wherein machine generated target translation of a source sentence is compared to a database of human generated target sentences. If a matching human generated target sentence is found, the human generated target sentence may be used instead of the machine generated sentence, since the human generated target sentence is more likely to be a well-formed sentence than the machine generated sentence. The system and method does not rely on a translation memory containing pairs of sentences in both source and target languages, and minimizes the reliance on a human translator to correct a translation generated by machine translation.
Description
BACKGROUND OF THE INVENTION

The present invention is directed to a system and method for at least partially translating data and facilitating the completion of the translation process. More in particular, the present invention is directed to a system and method for translating data which includes a source of data to be translated, a network connected to the source of data, a translation source connected to the network, and a portal system connected to the network for retrieving the data to be translated, and at least partially translating that data.


The system and method translates data by combining translation memory and machine translation, and in particular example based machine translation (EBMT).


Still further, the system and method stores source language sentences and target language sentences in the translation memory regardless of whether the sentences are matched to corresponding sentences in the other language.


Currently, there exist individual translation memory tools for use on a translator's workstation. Such translation aids analyze documents on a word-by-word basis, treating each new document as a totally new project. Such systems suffer from reduced efficiency in that they fail to take into account redundancies found in a document, similarities of one document to a previously translated document, and provide no means to enable team collaboration or involve the customer in the translation process.


There is therefore a need to provide a centralized translation database from which prior translations can be utilized to at least partially translate new documents to be translated. There is further a need to involve the translation customer in an iterative process, with intermediate approvals of translation work being obtained as a translation project progresses.


In an era where businesses are able to take advantage of a worldwide marketplace utilizing a global computer network (Internet) it is important that such businesses are able to easily solicit business in multiple languages. Therefore, many businesses desire to have their Web pages translated into multiple languages, so that they are able to solicit business in many different markets. Therefore, a system, which can upload a Web page and duplicate it in multiple languages, is highly desirable. Further, as much multiple languages is highly desirable. Further, as much of the language of anyone Web page is similar to that of other Web pages, it is further desirable to make use of the translations of previously translated Web pages to aid in the translation of other Web pages. By such an arrangement, the present invention reduces the workload of translators, whether it is translation of Web pages or other documents.


Further, it would be advantageous if a system and method could be devised that did not rely on a translation memory containing pairs of sentences in both source and target languages. It would also be advantageous to have a translation system and method minimized the reliance on a human translator to correct a translation generated by machine translation (MT).


While reducing the workload of translators by making use of translations of previously translated documents and materials is advantageous, it is desirable to further reduce the workload of translators by implementing a system whereby machine generated translation, in a target language, of a source sentence is compared to a database of human generated target sentences. In this manner if a human generated target sentence is found, the human generated target sentence can be used instead of the machine generated sentence, since the human generated target sentence is more likely to be a well-formed sentence than the machine generated sentence.


Example based machine translation (EBMT) is a more language independent approach than machine translation. Example based machine translation works on units of data smaller than the sentences utilized in machine translation. Example based machine translation uses a bilingual corpus to align not only sentences, but also phrases or even words from source language to target language. If a target sentence match a source sentence is not found, a target sentence might be built from phrases that have been already translated in different sentences stored in the translation memory. While a well defined domain example based machine translation can retrieve correct terms and phrases, it has a trouble generating well formed sentences.


SUMMARY OF THE INVENTION

A system for translating data is provided. The translating system includes a source of data to be translated, and a network connected to the source of data. The system further includes a translation source connected to the network and a portal system connected to the network for retrieving the data to be translated. The portal system includes a system for at least partially translating the data and a system for transmitting the at least partially translated data to the translation source for completing the translation of the data.


From another aspect, a system for translating data transmitted electronically through a global computer network is provided. The system includes at least one user terminal coupled to the global computer network for transmitting and receiving user related data therethrough. The system also includes at least one vendor terminal coupled to the global computer network for transmitting and receiving vendor related data therethrough. The system includes a first computer coupled to the global computer network for exchanging user related data with the at least one user terminal and vendor related data with the at least one vendor terminal through the global computer network. A file storage memory is provided which is coupled to the first computer for storing user related current document data representing documents to be transmitted from the at least one user terminal. A second computer is provided that is coupled to the first computer and the file storage memory for at least partially translating the current document data. The system also includes a database of previously entered document data and associated translated document data coupled to the second computer. The second computer compares the current document data with the previously entered document data to match the current document data with corresponding translated document data in the database to form the at least partial translation of the current document data. The at least partial translation is sent to the first computer and transmitted therefrom to the at least one vendor terminal for completing translation of the current document data and uploading the completed translation to the first computer. The first computer includes a system for transmitting the completed translation to the at least one user terminal and the second computer. The second computer includes a system for adding the current document data and the completed translation to the database.


In order to overcome the limitations of example based machine translation, the present system and method can store source and target language sentences in the translation memory regardless of whether the sentences are in matched pairs. In an extreme situation, the translation memory contains only a huge collection of source and target language sentences, where none of the sentences are paired together. Upon receiving source data, the system and method of the present invention will search the translation memory. If no match is found in the translation memory, the machine translation is accessed. The machine translation will then produce a target sentence. This target sentence may have correct terms and phrases, but it is very likely that the target sentence will be poorly constructed. Instead of presenting the target sentence to a human translator for correction, the system and method makes use of the matching capability of the translation memory to find a similar target sentence. This search can be executed over all the available target sentences in the translation memory, even if the sentences are not paired up with corresponding source language sentences. If a good match is found, the system and method will select that sentence instead of the machine generated sentence. The sentence could then be sent to a human translator for a final check.





BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing summary of the invention, as well as the following detailed description of preferred embodiments, is better understood when read in conjunction with the accompanying drawings, which are included by way of example, and not by way of limitation with regard to the claimed invention.



FIG. 1 is art architectural overview diagram of the present invention;



FIG. 2 is a block diagram illustrating the present invention;



FIG. 3 is a block diagram illustrating the translation and management architecture of the present invention;



FIG. 4 is an illustration of the translation memory architecture of the present invention;



FIG. 5 is a flow chart representing the translation process of the present invention;



FIG. 6 is a flow chart illustrating the order process of the present invention;



FIG. 7 is a flow diagram illustrating the glossary translation process of the present invention;



FIG. 8 is a flow chart illustrating the document translation process of the present invention;



FIG. 9 is a flow chart illustrating the redundant translation process of the present invention;



FIG. 10 is an illustration of the order of submission process of the present invention;



FIG. 11 is an illustration of the translation order assignment process of the present invention;



FIG. 12 is an illustration of the order completion flow of the present invention;



FIG. 13 is a flow chart illustrating the glossary creation process;



FIG. 14 is an illustration of the text comparison process of the present invention; and



FIG. 15 is a flow chart illustrating the method of the combined machine translation and translation memory according to another embodiment of the present invention.





DETAILED DESCRIPTION OF ILLUSTRATIVE EMBODIMENTS

The present invention is directed to a language translation system method that may be implemented as a portal on a global computer/communications network and combines advanced translation technologies with human translators for carrying out cost-efficient multilingual electronic commerce initiatives.


In FIGS. 1-4, system 1000 is illustrated. System 1000 provides a language portal implemented on the Internet. A plurality of customers 2 access the translation server network 8 through the global computer network (Internet) 6. As will be described further in following paragraphs, documents submitted by customers 2 to the translation server network 8 are translated at least partially automatically by the localization engines 18 utilizing the multilingual translation database 20, by offline translators 4 and/or online translators 26, through an intranet network.


Looking at the operation of system 1000, one or more users 2, using a Web browser or like type software access the Web server 10 through the global computer network 6. The E-services Translation Portal (ETP) 10 allows users 2 to establish translation projects and store ETP and flow data in the flow database 14 for establishing a workflow for the customer's documents to be translated, also providing reports to the administrator 22 and the flow designer 24. As the number of customers increases, additional servers 16 are brought online. Customer documents to be translated are stored in the file system memory 12. The documents stored in file system storage 12 are subsequently ‘processed by localization engines 18 wherein the documents are identified as to file type, i.e. HTML, GIF, anyone of a multiplicity of word processor, text, or spreadsheet file types. Next, the file is separated into translatable and non-translatable strings and stored in the translation database 20. Once the translatable strings of the file have been identified, they are then compared with previously translated strings to find similar strings which have’ already been translated. If a string matches more than one previously translated string, the customer's string to be translated at this time will be matched with the prior translation which has the highest frequency of use, or from the latest or user specified single or multiple previous translation versions. The partially translated document is also stored in the translation database 20.


The translation of the partially translated document is then completed by an online translator 26, or an offline translator 4, in accordance with the workflow design established for the particular customer 2. The workflow design may specify a particular translator 4, 26 that the customer 2 has engaged. The vendor (translator) assigns a price per unit for its work. This unit can be based on the number of words to be translated, a number of hours, etc. The customer selects a vendor based on a number of criteria including, but not limited to, resumes, references, customer ratings, volume, location, expertise and the like, which information is transferred to the customer 2 by the server 10.


Customers submit projects through the Internet to the translation server network, where the Web server/ETP 10 and database 14 are utilized to provide a measurement of the project. The size of the project is automatically estimated and broken down by some number of units. Then, based on the number of units and the vendor's cost per unit, a quote is provided to the customer through the server 10, which can also include a schedule and incremental costs. Alternately, the project may be entered for bid, where the customer submits its project to a selected list of vendors from which quotes are received.


After the customer receives and approves a quote, the customer transmits a contract to the vendor to perform the work. The selected vendor then executes the contract electronically to accept the project. The fact that the vendor receives the project from the translation server network 8, partially translated, reduces the costs of translation services. The customer, using their connection to the translation server network 8 through the Internet, can track the progress of the project, conduct interim reviews, provide interim approvals and, through the use of log files, has access to an audit trail.


Turning now to FIG. 2, such shows system 1000 from another perspective. Access to Web server/ETP 10 through the network 6 is accomplished by customers utilizing browsers for submitting translation jobs as part of HTML pages 28. Vendors access the documents to be translated through browser-based tools 30, 32 and 34. Web server/ETP 10 communicates with the multilingual application server 38, the Web server/ETP 10 receiving the files and transmitting the files to the customer, while the application server 38 creates the projects, creates orders, checks for the translatable strings and stores them in the translation database 20. The application server 38 embodies servers 16, database 14, localization engines 18, and the file system 12 of FIG. 1. The functions of servers 10 and 38 can be implemented on a single computer or a network of computers. Multilingual application server 38 communicates with the multilingual translation memory database 20 through the intranet 64, the network that is internal to the translation server network 8, shown in FIG. 1. The translatable strings that are stored in translation database 20 may also be processed by third party linguistic analysis utilities 48 which may access the database. The translation memory database 20 is also accessible by the online translators 26 through intranet 64.


Turning to FIG. 3, such shows the software architecture for accomplishing the translation of input documents. The files stored in the file system storage 12 may be in any of a plurality of different text documents or graphics formats 52a, 52b, and 52c. The localization engines 18 utilize utilities 54a to interpret those differently formatted documents, and utilize on-line manager and editor routines 54b for processing those documents. The processing of those documents is done in cooperation with an open system multilingual library 56 and the localization engines 18 communicate with the translation database 20 through an application program interface (API) 66 utilizing an open protocol.


Referring to FIG. 4, such illustrates the translation memory architecture. Translation database 20 stores multiple projects 100, 108 which each include respective strings 102, 104, 106 and 110, 112, 114, 116 to be translated. In the illustration, menus for use in a computer program are illustrated. The translated projects 130 and 138 are also stored in memory with the respective translated (French) strings 132, 134, 136 and 140, 142, 144, 146. A database text table 120 is provided which includes pointers for finding the text in the translation database 20. Each entry 120a-120n in the table 120 includes an ID which refers to the particular project, the language of the text, the text itself and a reference count, which indicates the number of different projects utilizing that same text. Thus, the text “open file” of strings 102 and 112 is referred to as a single entry 120a in the table 120. Similarly, the translated French text “ouvrir fichier” of strings 132 and 142 are similarly referred to in the single database entry 120b.


Where text incorporates a translated term in some other project n, such is considered a subset of the preceding entry. Thus, the text “open file” is considered a subset of the text “open file to load data” and thus the entry 120n will include a reference pointing to the Table entry 120a. By that arrangement, a portion of the string “open file to load data” can be obtained from the previously translated string “open file”. Thus, the translation process is simplified and the database overhead is reduced. By maintenance of the translation database 20, the automated translation system becomes more robust the more it is used, as every string which has been previously translated need not be duplicated by human translators. The translation database 20 can therefore be shared by multiple customers and vendors through the Internet. Localization engines 18 search the database for past translations. Translations which match, or just partially match are identified and added to the file that is provided to the translation vendor 4, 26.


The advantages provided by the system can be clearly seen when one considers a class of customers who would utilize the system. For instance, Web site owners who wish to duplicate their Web sites in multiple languages are customers who would benefit from system 1000. The text found in most Web sites is between 50% and 60% redundant. Therefore, at least 50% to 60% of the time and money required for translation would be saved, as the redundant text strings found in a given HTML file of a web site would be translated automatically, and not require the services of the vendor translator. Thus, over time, users of system 1000 would increasingly benefit by its expanded knowledge database.


An example of a translation process workflow which would be established by the flow designer 24 is shown in FIG. 5. The process starts at 200 and next goes to the, decision block 202, wherein it is determined whether a glossary is needed. A glossary is a collection of long phrases found in a document. In some cases, the customer may already have a glossary that is uploaded; in other cases it must be created. Glossaries are particularly useful where there are many translators working on a project. One translator translates the glossary and then after review and approval by the client, or a reviewer contracted by the client, it can be distributed to all the translators. The use of glossaries ensures that common terms are translated consistently across all files of a customer's single project or multiple projects. The instant invention provides for creation of both default and custom glossaries. When a default glossary is created, the strings are extracted automatically, and are therefore project specific. Custom glossaries can be created to standardize terminology across projects, corporate divisions, or entire corporations. The user can create as many glossaries as desired. The glossaries are not used to automatically translate a project, but are given to all translators working on a client's project or projects, to give all the translators the same verbiage for use within their respective translations. The use of the common verbiage of the glossary keeps the consistency at a high level.


If a glossary is needed, the flow passes to block 204 where the glossary generation process is initiated. From block 204, the flow passes to decision block 206 to determine whether there is redundant data. If there is redundant data, the flow passes to block 208 wherein redundant processing is initiated. Thus, the reference count for the text strings are scanned and only one string of a redundant group need be translated. From block 208, the actual document translation process is initiated in block 210 and the translated document is generated in block 212. From block 212, the flow passes to block 214, wherein alterations to the text document are made, such as changes to the font size and format of the document. From block 214, the flow passes to block 216, wherein the customer inspects the document. From there, the flow passes to block 218, wherein the customer's final approval is received. From block 218, the flow passes to decision block 220 where it is determined whether the document has been finally reviewed. If it has, then the flow passes to block 226 wherein the customer is billed. If the final review has not been completed, then the flow passes to block 222 wherein the document is checked, and if problems are found, the flow passes back to block 214 to cycle through the loop again. If there are no problems, or such have been fixed, the flow passes from block 222 to block 224 wherein the document is updated, as required. From block 224, the flow passes to block 226, wherein the customer is billed. From block 226, the flow passes to block 228, to indicate to the parent process, such as the order process shown in FIG. 6 that workflow is complete. The process then ends at stop block 230.


In FIG. 6, the order process is shown. Starting from the start block 250, the flow passes to block 252. In block 252, an account manager is assigned to the project that will be created in block 254. In block 254, the project and version (which language) is created by the customer and can include creation of the workflow design (FIG. 5). From block 254, the flow goes to decision block 256, wherein it is determined whether the project and version are created properly. If they are, the flow passes to block 260, otherwise, the flow passes to block 258, wherein the assigned account manager checks and fixes the project and/or version. From block 258, the flow passes to block 260. In block 260, the application programming interface 66 and the appropriate utility 54A based on the file format of the document are called to extract the translatable strings. From block 260, the flow passes to decision block 262, wherein it is determined whether the strings have been completely extracted from the document. If the strings have been completely extracted, the flow passes to block 266. If they have not, flow passes to block 264, wherein the account manager checks the document and fixes any problems therewith that are preventing the complete extraction of the translatable strings. From block 264, the flow passes to block 266, wherein it is determined how many target languages are to be provided for the client, so the proper number of copies of the original file can be made. From block 266, the flow passes to decision block 268 wherein it is determined whether there is a need for a glossary. If a glossary is not required, flow passes to block 278. If, on the other hand, a glossary is required, the flow passes to decision block 270 wherein it is determined whether the customer has provided a glossary. If the customer has provided a glossary, the flow passes to block 274 where the glossary is imported and then flow passes to block 278. However, if no glossary is provided, the flow passes to block 272 wherein a glossary is created. Subsequent to creation of the glossary, the flow passes to block 276 wherein the glossary is reviewed by the client. From block 276, the flow passes to block 278 wherein the client selects the translator and reviewer (usually two different persons) for each target file. Subsequent to selection of the vendors in block 278, the flow passes to block 280, wherein the customer confirms the order. From block 280, the flow passes to decision block 284, wherein it is determined whether the order has been confirmed. If it has not, the flow passes to block 282 wherein the account manager fixes the problem in obtaining an order confirmation. In some cases, a client may have desired translation of their project into a particular number of target languages, for instance ten, but the final cost for that quantity of translations may result in a quoted cost which exceeds the client's budget. Therefore, the client may then have to scale back the extent of their order or find new vendors offering lower costs. Once the problems are fixed in block 282, the flow passes back to block 280, to repeat the cycle in obtaining order confirmation. After the order has been confirmed, the flow passes from block 284 to block 286 wherein the translation process is initiated. The translation process is the flow diagram of FIG. 5, thus the process of FIG. 6 is the parent process of that disclosed in FIG. 5. Therefore, the notification provided in block 228 of FIG. 5, is provided in block 286 of FIG. 6. From block 286, the process ends at block 288.



FIG. 7 is a flow diagram of the glossary translation process which is initiated in block 204 of FIG. 5. From the start block 300, the flow passes to block 302, wherein a translator 4 downloads the glossary from the Web server 10. The selected vendor 4 is sent an E-mail message informing them that the glossary is ready to be downloaded and provides a hyperlink to the Web page identifying the site from which the glossary may be downloaded via Web based file transfer mechanisms including but not limited to File Transfer Protocol (FTP). From block 302, the flow passes to block 304, wherein the vendor provides the translation of the glossary into the desired target language or languages. From block 304, the flow passes to block 306, wherein the translated glossary is provided to the customer for the customer's review. To insure that the customer agrees with the translation, a loop is provided which begins with decision block 308 where it is determined whether or not the customer has approved the translated glossary. If the customer has not approved it, flow passes to block 310, wherein the vendor fixes the problems identified by the customer. From block 310, the flow passes back to block 306, to permit the customer to review the corrections made by the vendor. Once the customer has approved the glossary, the flow passes to block 312 wherein the translated glossary is attached (identified with) the document to be translated. From block 312, the flow passes to block 314, wherein the parent process, shown in FIG. 5, is notified that the glossary translation process has been completed. From block 314, the process terminates at block 316.


Block 210 of FIG. 5 initiates the document translation process. The flow chart for that process is illustrated in FIG. 8. From start block 320 in FIG. 8, the flow passes to block 322 wherein the vendor is sent an E-mail message describing the Web site location of the documents to be translated, so that the vendor can inspect the documents. Flow then passes to block 324, wherein the translator downloads the documents for offline translation. The flow then passes to block 326, wherein the translator performs the translation of the documents. Subsequently, upon completion of the translation, flow passes to block 328, wherein the translated documents are forwarded (uploaded) for review. The reviewer is sent an E-mail indicating that the translation is ready for review. Flow then passes to block 330 wherein the reviewer downloads the translated documents. Subsequent to downloading the documents, the flow passes to block 332 wherein the reviewer performs a review of all of the translated documents and makes any corrections necessary. From block 332, the flow passes to block 334, wherein the reviewed documents, and especially corrections, are checked. Such secondary review may be carried out by a second reviewer. From block 334, the flow then passes to block 336 wherein the reviewed translated documents are uploaded to the Web server 10. The flow then passes to block 338, wherein the parent process, block 210 of FIG. 5, is notified that the translation process is complete. The process then ends at stop block 340.


Turning now to FIG. 9, such shows the redundant string translation process which is initiated by block 208 of FIG. 5. From the start block 350, flow passes to block 352 wherein the redundant strings are downloaded by the translator. From block 352, the flow passes to block 354, wherein the translator translates the strings which have been identified as having multiple re-occurrences in the document. From block 354, the block passes to block 356, wherein a reviewer, usually a separate individual, reviews the translated strings. From block 356, flow passes to block 358, wherein the parent process is notified that the redundant string processing has been completed, such notification being provided in block 208 of FIG. 5. From block 358, the process terminates at block 360.


Referring now to FIG. 10, such shows the order submission process from another perspective. The customer 2 utilizing a Web browser submits an order to the Eservices translation portal embodied in the Web server 10 through the Internet 6. The server 10 stores the documents in a file system disposed within the memory 15. Memory 15 includes file system 12 and translation database 20 shown in FIG. 1. Server 10 also launches the workflow extraction process to extract the translatable strings which are stored in the translation memory database of memory 15, which is carried out by the workflow process 80. The workflow process 80 also includes the reuse of prior translations, where a search is made between the translatable strings of a current project and strings which have previously been processed, to provide a translation when a match is found.


In FIG. 11, the translation order assignment flow is shown. The workflow process 80 creates a project file and stores that in the file system of memory 15. The workflow process 80 then sends an E-mail 82 to the translator 4. The E-mail contains information about the order, the download location, a hyperlink to the ETP page having a link to the Internet site for downloading the file(s) via Web based file transfer mechanisms including but not limited to File Transfer Protocol (FTP). The translator 4 utilizing the Web browser browses the ETP Web page containing the Web download link to the project file (e.g. via FTP) by utilizing the hyperlink contained in the E-mail 82. Using the browser, the translator 4 downloads the project file from the Web download site and then invokes the local translation software and proceeds to then perform the translation task.


Upon completion of the translation task, the translator then uploads the translated document, which process is illustrated in FIG. 12. The translator 4 utilizing a Web browser uploads the translated project through the Internet 6 to the ETP server 10. The server 10 saves the project to the file system in memory 15 and notifies the workflow process 80 that the files are ready. The workflow process 80 handles the flow from reviewers to accept or reject the translation. If the reviewer accepts the project files then the workflow process 80 will store the translated document in the translation memory database, within memory 15. Finally, the translated files are provided to the customer. In order to complete that process, the workflow process 80 sends an E-mail to the customer which contains information about the order, the download location for the translated documents and a hyperlink to the ETP page with a Web download link to the project file (translated documents) via Web based file transfer mechanisms including but not limited to File Transfer Protocol (FTP). A customer, utilizing their browser, employs the hyperlink to access the Web download link to the project, and then utilizing that link, downloads the translated file.


The process for creating a default glossary, block 272 of FIG. 6, is shown in FIG. 13. In FIG. 13, the flow starts with a decision block 400 wherein it is determined whether a user interface and thus texts included in the user interface exists or whether there is seed data. Seed data is a list of terms which come with initial software installation or are related to and are usually peculiar to a particular industry. If there is text embedded in a user interface—or seed data, the flow passes to block 402 wherein text strings are extracted from that data or user interface to create what is termed a type 1 glossary. If no user interface or seed data is provided, or subsequent to creating the type 1 glossary in block 402, the flow passes to block 404 wherein a linguistic engine, such as use of an electronic dictionary is used to try and match up long phrases and create a type 2 glossary. From block 404, the flow passes to block 406, wherein redundant strings, strings with more than one reference count and having less than five words are further identified as a type 3 glossary. From block 406, the flow passes to block 408, wherein the three types of glossaries are merged together and redundancies removed. From block 408, the block passes to block 410 where a customer glossary, if provided, is imported into the system.


Flow then passes to block 412, wherein the merged glossary is compared against the customer's glossary to find any conflicts. If conflicts are found, the flow passes to block 414, wherein the customer is requested to review the conflicts and make additions or corrections to the generated glossary. Flow, of course, would then pass back to the parent process.


As previously discussed, the translation database of the present invention provides great efficiencies in reducing the translation workload required of vendors. As an example, FIG. 14 is provided to illustrate the comparison which is carried out utilizing the translation database. Thus, when a new project 108, having translatable strings 110, 112, 114 and 116, to be translated is entered into the system, it is compared with prior projects that have been provided. The match need not be exact, so that another project having the same or similar strings may be found. The comparison may then identify a prior project 100 having strings 102, 104 and 106 as being identified as being a close match. The difference between the project 100 and the new project 108 is a single string 110, thus the translation that was utilized for project 100 may be utilized again for project 108, with only the string 110 remaining to be translated. By that process, the translation workload, which must be contracted out, is minimized. In addition to the project level matching, system 1000 performs the translatable string level searching to further reduce the manual translation workload.


In the foregoing embodiments, the translator 4 plays a major role. As shown in FIG. 14, the foregoing embodiment improves the translation process by utilizing pairs of data strings and prior translations. Once the translation is constructed, the translator 4 has the task of reviewing the translation. When there is no corresponding target string for a source string, it is the translator's task to provide a translation of the source string. The embodiment shown in FIG. 15 illustrates a method that does not rely as heavily on the development of pairs of sentences in both source and target languages in the translation memory database 20 shown in FIGS. 2 and 3 and database in memory 15 shown in FIGS. 11 and 12. The embodiment shown in FIG. 15 illustrates the functioning of a translation system that minimizes the reliance on human translator 4 to correct a translation generated by machine translation (MT).


As discussed previously with regard to FIG. 5, the actual document translation process is initiated in block 210 and the translated document is generated in block 212. FIG. 15 illustrates an embodiment of this translation process. The translation process starts at block 500. A source data string for translation is input in block 502. The system then searches the translation memory for a similar source string having a corresponding translated target string in block 504. In block 506, if a match is found the target string is output for subsequent review by the translator 4 in block 520. If no match for the source string is found in decision block 504, the source string is sent to the machine translation in block 508.


In block 508, the machine translation produces a target string. This target string is produced by utilizing phrases that have already been translated in different sentences stored in the translation memory. The target string that is produced in this manner may contain the correct terms and phrases, but will likely be ill-formed. Instead of sending this target string to the translator 4 for correction, the system searches for a matching target string in the translation memory in block 510. This search performed in block 508 can be performed for all available target sentences, even if the sentences are not paired up with corresponding source language.


In performing the machine translation in block 508, example based machine translation may be used. Such example based machine translation is a more language independent approach than machine translation. Example based machine translation can work with units of data smaller than the sentences utilized in machine translation. Further, example based machine translation uses a bilingual corpus to align not only sentences, but also phrases or even words from source language to target language. If a target sentence corresponding to a source sentence is not found, a target sentence might be built from phrases that have been already translated in different sentences stored in the translation memory. However, while a well defined domain example based machine translation can retrieve correct terms and phrases, it has a trouble generating well formed sentences.


In decision block 512, if a target sentence is found that is a good match, the target sentence is sent for review by the translator 4 in block 520, since this sentence will most likely be a well formed, human created sentence. On the other hand, if a good match is not found in block 512, then the machine translation developed in block 508 is presented in block 514 for review by the translator 4 in block 520.


By the process illustrated in FIG. 15, the work of the human translator is reduced due to the fact the more well-formed sentences are output as opposed to machine translated sentences which have a higher likelihood of requiring editing. The system yields a fairly readable automatic translation without human translators. This is due in large part to the fact that sentences that have a match in block 506 are very likely to be well-formed human sentences, and instead of initially outputting the machine translation immediately from block 508, that sentence is compared to other target sentences in memory to try to locate a matching sentence, which in all likelihood will be a better-formed sentence than the machine derived one.


The method set forth in FIG. 15 can be implemented in the system shown in FIGS. 1-3, 10 and 12. Further, the method illustrated in FIG. 15 can be incorporated in the translation process shown in FIG. 5.


While illustrative systems and methods as described herein embodying various aspects of the present invention are shown by way of example, it will be understood, of course, that the invention is not limited to these embodiments. Modifications may be made by those skilled in the art, particularly in light of the foregoing teachings. For example, each of the elements of the aforementioned embodiments may be utilized alone or in combination with elements of the other embodiments. In addition, aspects of the invention have been pointed out in the appended claims; however these claims are illustrative in that the invention is intended to include the elements and steps described herein in any combination or sub combination. It will also be appreciated and understood that modifications may be made without departing from the true spirit and scope of the invention.

Claims
  • 1. A method for translating data from a source language to a target language, comprising: calling an application programming interface and utility based on a file format of a document to extract translatable strings from the document;machine translating an inputted source to produce a target string, the inputted source comprising one of the extracted translatable strings;comparing human generated target strings and the machine translated target string;locating a match between a human generated target string of the human generated target strings and the machine translated target string using a translation database, the translation database comprising a collection of source language sentences and target language sentences, where none of the source language sentences and target language sentences are paired together;when the match is not found, sending the machine translated target string for subsequent review by a human translator; andwhen the match is found, outputting the matching human generated target string for subsequent review by the human translator.
  • 2. The method of claim 1, wherein the machine translating comprises using units of data smaller than a sentence.
  • 3. The method of claim 1, wherein the translation database comprises strings of source data and non-matching strings of target data.
  • 4. A machine for translating data from a source language to a target language, comprising: a processor; anda memory for storing executable instructions, the processor executing the instructions to:call an application programming interface and utility based on a file format of a document;extract translatable strings from the document using the utility;machine translate an inputted source to produce a target string, the inputted source comprising one of the extracted translatable strings;compare human generated target strings and the machine translated target string;locate a match between a human generated target string of the human generated target strings and the machine translated target string using a translation database, the translation database comprising a collection of source language sentences and target language sentences, where none of the source language sentences and target language sentences are paired together;when the match is not found, transmit the machine translated target string for subsequent review by a human translator; andwhen the match is found, output the matching human generated target string for subsequent review by the human translator.
  • 5. The machine of claim 4, wherein the machine translating comprises using units of data smaller than a sentence.
  • 6. The machine of claim 4 wherein the translation database comprises strings of source data and non-matching strings of target data.
CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation and claims the priority benefit of U.S. patent application Ser. No. 14/311,213, filed Jun. 20, 2014, entitled “E-SERVICES TRANSLATION UTILIZING MACHINE TRANSLATION AND TRANSLATION MEMORY,” which is a continuation of U.S. patent application Ser. No. 13/052,041 filed Mar. 18, 2011, now U.S. Pat. No. 9,600,472, issued Mar. 21, 2017, entitled “E-SERVICES TRANSLATION UTILIZING MACHINE TRANSLATION AND TRANSLATION MEMORY,” which is a continuation of U.S. patent application Ser. No. 11/953,569, filed Dec. 10, 2007, now U.S. Pat. No. 7,925,494, issued Apr. 21, 2011, which is a continuation of U.S. patent application Ser. No. 11/735,763, filed Apr. 16, 2007, which is a continuation of U.S. patent application Ser. No. 11/515,398, filed Sep. 5, 2006, which is a continuation of U.S. patent application Ser. No. 11/123,071 filed May 6, 2005, all of which are incorporated and referenced herein as to their entirety.

US Referenced Citations (380)
Number Name Date Kind
4661924 Okamoto et al. Apr 1987 A
4674044 Kalmus et al. Jun 1987 A
4677552 Sibley, Jr. Jun 1987 A
4789928 Fujisaki Dec 1988 A
4845658 Gifford Jul 1989 A
4903201 Wagner Feb 1990 A
4916614 Kaji et al. Apr 1990 A
4920499 Skeirik Apr 1990 A
4962452 Nogami et al. Oct 1990 A
4992940 Dworkin Feb 1991 A
5005127 Kugimiya et al. Apr 1991 A
5020021 Kaji et al. May 1991 A
5075850 Asahioka et al. Dec 1991 A
5093788 Shiotani et al. Mar 1992 A
5111398 Nunberg et al. May 1992 A
5140522 Ito et al. Aug 1992 A
5146405 Church Sep 1992 A
5168446 Wiseman Dec 1992 A
5224040 Tou Jun 1993 A
5243515 Lee Sep 1993 A
5243520 Jacobs et al. Sep 1993 A
5283731 Lalonde et al. Feb 1994 A
5295068 Nishino et al. Mar 1994 A
5301109 Landauer et al. Apr 1994 A
5325298 Gallant Jun 1994 A
5349368 Takeda et al. Sep 1994 A
5351189 Doi Sep 1994 A
5408410 Kaji Apr 1995 A
5418717 Su et al. May 1995 A
5423032 Byrd et al. Jun 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
5541836 Church et al. Jul 1996 A
5548508 Nagami Aug 1996 A
5555343 Luther Sep 1996 A
5587902 Kugimiya Dec 1996 A
5640575 Maruyama et al. Jun 1997 A
5642522 Laenen et al. Jun 1997 A
5644775 Thompson et al. Jul 1997 A
5687384 Nagase Nov 1997 A
5708780 Levergood et al. Jan 1998 A
5708825 Sotomayor Jan 1998 A
5710562 Gormish et al. Jan 1998 A
5715314 Payne et al. Feb 1998 A
5715402 Popolo Feb 1998 A
5724424 Gifford Mar 1998 A
5724593 Hargrave, III et al. Mar 1998 A
5751957 Hiroya et al. May 1998 A
5764906 Edelstein et al. Jun 1998 A
5765138 Aycock et al. Jun 1998 A
5794219 Brown Aug 1998 A
5799269 Schabes et al. Aug 1998 A
5802502 Gell et al. Sep 1998 A
5802525 Rigoutsos Sep 1998 A
5812776 Gifford Sep 1998 A
5818914 Fujisaki Oct 1998 A
5819265 Ravin et al. Oct 1998 A
5826244 Huberman Oct 1998 A
5842204 Andrews et al. Nov 1998 A
5844798 Uramoto Dec 1998 A
5845143 Yamauchi et al. Dec 1998 A
5845306 Schabes et al. Dec 1998 A
5848386 Motoyama Dec 1998 A
5850442 Muftic Dec 1998 A
5850561 Church et al. Dec 1998 A
5864788 Kutsumi Jan 1999 A
5873056 Liddy Feb 1999 A
5884246 Boucher et al. Mar 1999 A
5895446 Takeda et al. Apr 1999 A
5909492 Payne et al. Jun 1999 A
5917484 Mullaney Jun 1999 A
5950194 Bennett et al. Sep 1999 A
5956711 Sullivan et al. Sep 1999 A
5956740 Nosohara Sep 1999 A
5960382 Steiner Sep 1999 A
5966685 Flanagan et al. Oct 1999 A
5974371 Hirai et al. Oct 1999 A
5974372 Barnes Oct 1999 A
5974413 Beauregard et al. Oct 1999 A
5987401 Trudeau Nov 1999 A
5987403 Sugimura Nov 1999 A
6044344 Kanevsky Mar 2000 A
6044363 Mori et al. Mar 2000 A
6047299 Kaijima Apr 2000 A
6049785 Gifford Apr 2000 A
6070138 Iwata May 2000 A
6085162 Cherny Jul 2000 A
6092034 McCarley et al. Jul 2000 A
6092035 Kurachi et al. Jul 2000 A
6131082 Hargrave, III et al. Oct 2000 A
6139201 Carbonell et al. Oct 2000 A
6154720 Onishi et al. Nov 2000 A
6161082 Goldberg et al. Dec 2000 A
6163785 Carbonell et al. Dec 2000 A
6195649 Gifford Feb 2001 B1
6199051 Gifford Mar 2001 B1
6205437 Gifford Mar 2001 B1
6212634 Geer et al. Apr 2001 B1
6260008 Sanfilippo Jul 2001 B1
6278969 King et al. Aug 2001 B1
6279112 O'toole, Jr. et al. Aug 2001 B1
6285978 Bemth et al. Sep 2001 B1
6301574 Thomas et al. Oct 2001 B1
6304846 George et al. Oct 2001 B1
6338033 Bourbonnais et al. Jan 2002 B1
6341372 Datig Jan 2002 B1
6345244 Clark Feb 2002 B1
6345245 Sugiyama et al. Feb 2002 B1
6347316 Redpath Feb 2002 B1
6353824 Boguraev et al. Mar 2002 B1
6356865 Franz et al. Mar 2002 B1
6385568 Brandon et al. May 2002 B1
6393389 Chanod et al. May 2002 B1
6401105 Carlin et al. Jun 2002 B1
6415257 Junqua Jul 2002 B1
6442524 Ecker et al. Aug 2002 B1
6449599 Payne et al. Sep 2002 B1
6470306 Pringle et al. Oct 2002 B1
6473729 Gastaldo et al. Oct 2002 B1
6477524 Taskiran Nov 2002 B1
6490358 Geer et al. Dec 2002 B1
6490563 Hon Dec 2002 B2
6526426 Lakritz Feb 2003 B1
6622121 Crepy et al. Sep 2003 B1
6623529 Lakritz Sep 2003 B1
6658627 Gallup et al. Dec 2003 B1
6687671 Gudorf et al. Feb 2004 B2
6731625 Eastep et al. May 2004 B1
6782384 Sloan et al. Aug 2004 B2
6865528 Huang Mar 2005 B1
6920419 Kitamura Jul 2005 B2
6952691 Drissi et al. Oct 2005 B2
6976207 Rujan Dec 2005 B1
6990439 Xun Jan 2006 B2
6993473 Cartus Jan 2006 B2
7013264 Dolan Mar 2006 B2
7020601 Hummel et al. Mar 2006 B1
7031908 Huang Apr 2006 B1
7050964 Menzes May 2006 B2
7089493 Hatori et al. Aug 2006 B2
7100117 Chwa et al. Aug 2006 B1
7110938 Cheng et al. Sep 2006 B1
7124092 O'toole, Jr. et al. Oct 2006 B2
7155440 Kronmiller et al. Dec 2006 B1
7177792 Knight Feb 2007 B2
7185276 Keswa Feb 2007 B2
7191447 Ellis et al. Mar 2007 B1
7194403 Okura et al. Mar 2007 B2
7207005 Laktritz Apr 2007 B2
7209875 Quirk et al. Apr 2007 B2
7249013 Al-Onaizan Jul 2007 B2
7266767 Parker Sep 2007 B2
7272639 Levergood et al. Sep 2007 B1
7295962 Marcu Nov 2007 B2
7295963 Richardson Nov 2007 B2
7333927 Lee Feb 2008 B2
7340388 Soricut Mar 2008 B2
7343551 Bourdev Mar 2008 B1
7353165 Zhou et al. Apr 2008 B2
7369984 Fairweather May 2008 B2
7389222 Langmead Jun 2008 B1
7389223 Atkin Jun 2008 B2
7448040 Ellis et al. Nov 2008 B2
7454326 Marcu Nov 2008 B2
7509313 Colledge Mar 2009 B2
7516062 Chen et al. Apr 2009 B2
7533013 Marcu May 2009 B2
7533338 Duncan et al. May 2009 B2
7580960 Travieso et al. Aug 2009 B2
7587307 Cancedda et al. Sep 2009 B2
7594176 English Sep 2009 B1
7596606 Codignollo Sep 2009 B2
7620538 Marcu Nov 2009 B2
7620549 Di Cristo Nov 2009 B2
7624005 Koehn Nov 2009 B2
7627479 Travieso et al. Dec 2009 B2
7640158 Detlef et al. Dec 2009 B2
7668782 Reistad et al. Feb 2010 B1
7680647 Moore Mar 2010 B2
7693717 Kahn et al. Apr 2010 B2
7698124 Menezes et al. Apr 2010 B2
7716037 Precoda May 2010 B2
7734459 Menezes Jun 2010 B2
7739102 Bender Jun 2010 B2
7739286 Sethy Jun 2010 B2
7788087 Corston-Oliver Aug 2010 B2
7813918 Muslea Oct 2010 B2
7865358 Green Jan 2011 B2
7925493 Watanabe Apr 2011 B2
7925494 Cheng et al. Apr 2011 B2
7945437 Mount et al. May 2011 B2
7983896 Ross et al. Jul 2011 B2
7983897 Chin Jul 2011 B2
7983903 Gao Jul 2011 B2
8003707 Holland Aug 2011 B2
8050906 Zimmerman et al. Nov 2011 B1
8078450 Anisimovich et al. Dec 2011 B2
8135575 Dean Mar 2012 B1
8195447 Anismovich Jun 2012 B2
8214196 Yamada Jul 2012 B2
8239186 Chin Aug 2012 B2
8239207 Seligman Aug 2012 B2
8249855 Zhou Aug 2012 B2
8275604 Jiang Sep 2012 B2
8286185 Ellis et al. Oct 2012 B2
8296127 Marcu Oct 2012 B2
8352244 Gao Jan 2013 B2
8364463 Miyamoto Jan 2013 B2
8386234 Uchimoto et al. Feb 2013 B2
8423346 Seo et al. Apr 2013 B2
8442812 Ehsani May 2013 B2
8521506 Lancaster et al. Aug 2013 B2
8527260 Best Sep 2013 B2
8548794 Koehn Oct 2013 B2
8554591 Reistad et al. Oct 2013 B2
8594992 Kuhn et al. Nov 2013 B2
8600728 Knight Dec 2013 B2
8606900 Levergood et al. Dec 2013 B1
8612203 Foster Dec 2013 B2
8615388 Li Dec 2013 B2
8620793 Knyphausen et al. Dec 2013 B2
8635327 Levergood et al. Jan 2014 B1
8635539 Young Jan 2014 B2
8666725 Och Mar 2014 B2
8688454 Zheng Apr 2014 B2
8725496 Zhao May 2014 B2
8768686 Sarikaya et al. Jul 2014 B2
8775154 Clinchant Jul 2014 B2
8818790 He et al. Aug 2014 B2
8843359 Lauder Sep 2014 B2
8862456 Krack et al. Oct 2014 B2
8874427 Ross et al. Oct 2014 B2
8898052 Waibel Nov 2014 B2
8930176 Li Jan 2015 B2
8935148 Christ Jan 2015 B2
8935149 Zhang Jan 2015 B2
8935150 Christ Jan 2015 B2
8935706 Ellis et al. Jan 2015 B2
8972268 Waibel Mar 2015 B2
9026425 Nikoulina May 2015 B2
9053202 Viswanadha Jun 2015 B2
9081762 Wu Jul 2015 B2
9128929 Albat Sep 2015 B2
9141606 Marciano Sep 2015 B2
9176952 Aikawa Nov 2015 B2
9183192 Ruby, Jr. Nov 2015 B1
9183198 Shen et al. Nov 2015 B2
9201870 Jurach Dec 2015 B2
9208144 Abdulnasyrov Dec 2015 B1
9262403 Christ Feb 2016 B2
9342506 Ross et al. May 2016 B2
9396184 Roy Jul 2016 B2
9400786 Lancaster et al. Jul 2016 B2
9465797 Ji Oct 2016 B2
9471563 Trese Oct 2016 B2
9519640 Perez Dec 2016 B2
9552355 Dymetman Jan 2017 B2
9600472 Cheng et al. Mar 2017 B2
9600473 Leydon Mar 2017 B2
9613026 Hodson Apr 2017 B2
20020002461 Tetsumoto Jan 2002 A1
20020046018 Marcu Apr 2002 A1
20020083103 Ballance Jun 2002 A1
20020093416 Goers et al. Jul 2002 A1
20020099547 Chu et al. Jul 2002 A1
20020103632 Dutta et al. Aug 2002 A1
20020107684 Gao Aug 2002 A1
20020110248 Kovales et al. Aug 2002 A1
20020111787 Knyphausen et al. Aug 2002 A1
20020124109 Brown Sep 2002 A1
20020138250 Okura et al. Sep 2002 A1
20020165708 Kumhyr Nov 2002 A1
20020169592 Aityan Nov 2002 A1
20020188439 Marcu Dec 2002 A1
20020198701 Moore Dec 2002 A1
20030004702 Higinbotham Jan 2003 A1
20030009320 Furuta Jan 2003 A1
20030016147 Evans Jan 2003 A1
20030040900 D'Agostini Feb 2003 A1
20030069879 Sloan et al. Apr 2003 A1
20030078766 Appelt et al. Apr 2003 A1
20030105621 Mercier Jun 2003 A1
20030120479 Parkinson et al. Jun 2003 A1
20030158723 Masuichi et al. Aug 2003 A1
20030182279 Willows Sep 2003 A1
20030194080 Michaelis et al. Oct 2003 A1
20030200094 Gupta Oct 2003 A1
20030229622 Middelfart Dec 2003 A1
20030233222 Soricut et al. Dec 2003 A1
20040024581 Koehn Feb 2004 A1
20040034520 Langkilde-Geary Feb 2004 A1
20040044517 Palmquist Mar 2004 A1
20040122656 Abir Jun 2004 A1
20040172235 Pinkham et al. Sep 2004 A1
20040255281 Imamura et al. Dec 2004 A1
20050021323 Li Jan 2005 A1
20050055212 Nagao Mar 2005 A1
20050075858 Poumasseh et al. Apr 2005 A1
20050076342 Levins Apr 2005 A1
20050094475 Naoi May 2005 A1
20050149316 Ushioda Jul 2005 A1
20050171758 Palmquist Aug 2005 A1
20050171944 Palmquist Aug 2005 A1
20050197827 Ross et al. Sep 2005 A1
20050222837 Deane Oct 2005 A1
20050222973 Kaiser Oct 2005 A1
20050273314 Chang et al. Dec 2005 A1
20060015320 Och Jan 2006 A1
20060095526 Levergood et al. May 2006 A1
20060095848 Naik May 2006 A1
20060136277 Perry Jun 2006 A1
20060256139 Gikandi Nov 2006 A1
20060282255 Lu Dec 2006 A1
20060287844 Rich Dec 2006 A1
20070043553 Dolan Feb 2007 A1
20070112553 Jacobson May 2007 A1
20070118378 Skuratovsky May 2007 A1
20070136470 Chikkareddy et al. Jun 2007 A1
20070150257 Cancedda et al. Jun 2007 A1
20070192110 Mizutani et al. Aug 2007 A1
20070230729 Naylor et al. Oct 2007 A1
20070233460 Lancaster et al. Oct 2007 A1
20070233463 Sparre Oct 2007 A1
20070244702 Kahn et al. Oct 2007 A1
20070294076 Shore et al. Dec 2007 A1
20080077395 Lancaster et al. Mar 2008 A1
20080086298 Anismovich Apr 2008 A1
20080109374 Levergood et al. May 2008 A1
20080141180 Reed et al. Jun 2008 A1
20080147378 Hall Jun 2008 A1
20080154577 Kim Jun 2008 A1
20080201344 Levergood et al. Aug 2008 A1
20080243834 Rieman et al. Oct 2008 A1
20080288240 D'Agostini et al. Nov 2008 A1
20080294982 Leung et al. Nov 2008 A1
20090094017 Chen et al. Apr 2009 A1
20090132230 Kanevsky et al. May 2009 A1
20090187577 Reznik et al. Jul 2009 A1
20090204385 Cheng et al. Aug 2009 A1
20090217196 Neff et al. Aug 2009 A1
20090240539 Slawson Sep 2009 A1
20090248182 Logan et al. Oct 2009 A1
20090248482 Knyphausen et al. Oct 2009 A1
20090313005 Jaquinta Dec 2009 A1
20090326917 Hegenberger Dec 2009 A1
20100057439 Ideuchi et al. Mar 2010 A1
20100057561 Gifford Mar 2010 A1
20100121630 Mende et al. May 2010 A1
20100179803 Sawaf Jul 2010 A1
20100223047 Christ Sep 2010 A1
20100241482 Knyphausen et al. Sep 2010 A1
20100262621 Ross et al. Oct 2010 A1
20110066469 Kadosh Mar 2011 A1
20110097693 Crawford Apr 2011 A1
20110184719 Christ Jul 2011 A1
20120022852 Tregaskis Jan 2012 A1
20120046934 Cheng Feb 2012 A1
20120095747 Ross et al. Apr 2012 A1
20120185235 Albat Jul 2012 A1
20120330990 Chen et al. Dec 2012 A1
20130173247 Hodson Jul 2013 A1
20130325442 Dahlmeier Dec 2013 A1
20130346062 Lancaster et al. Dec 2013 A1
20140006006 Christ Jan 2014 A1
20140012565 Lancaster et al. Jan 2014 A1
20140058718 Kunchukuttan Feb 2014 A1
20140142917 D'Penha May 2014 A1
20140142918 Dotterer May 2014 A1
20140229257 Reistad et al. Aug 2014 A1
20140297252 Prasad et al. Oct 2014 A1
20140358519 Mirkin Dec 2014 A1
20140358524 Papula Dec 2014 A1
20140365201 Gao Dec 2014 A1
20150051898 Simard Feb 2015 A1
20150142415 Cheng et al. May 2015 A1
20150169554 Ross et al. Jun 2015 A1
20150186362 Li Jul 2015 A1
20160253319 Ross et al. Sep 2016 A1
Foreign Referenced Citations (111)
Number Date Country
5240198 May 1998 AU
694367 Jul 1998 AU
5202299 Oct 1999 AU
199938259 Nov 1999 AU
761311 Sep 2003 AU
1076861 Jun 2005 BE
2221506 Dec 1996 CA
231184 Jul 2009 CA
1076861 Jun 2005 CH
1179289 Dec 2004 CN
1770144 May 2006 CN
101019113 Aug 2007 CN
0N101826072 Sep 2010 CN
101248415 Oct 2010 CN
102053958 May 2011 CN
102193914 Sep 2011 CN
102662935 Sep 2012 CN
102902667 Jan 2013 CN
69525374 Aug 2002 DE
69431306 May 2003 DE
69925831 Jun 2005 DE
69633564 Nov 2005 DE
2317447 Jan 2014 DE
0262938 Apr 1988 EP
0668558 Aug 1995 EP
0830774 Feb 1998 EP
0830774 Mar 1998 EP
0887748 Dec 1998 EP
1076861 Feb 2001 EP
1128301 Aug 2001 EP
1128302 Aug 2001 EP
1128303 Aug 2001 EP
0803103 Feb 2002 EP
1235177 Aug 2002 EP
0734556 Sep 2002 EP
1266313 Dec 2002 EP
1489523 Dec 2004 EP
1076861 Jun 2005 EP
1787221 May 2007 EP
1889149 Feb 2008 EP
2226733 Sep 2010 EP
2299369 Mar 2011 EP
2317441 May 2011 EP
2336899 Jun 2011 EP
2317441 Jan 2014 EP
1076861 Jun 2005 FR
2241359 Aug 1991 GB
1016861 Jun 2005 GB
2433403 Jun 2007 GB
2468278 Sep 2010 GB
2474839 May 2011 GB
2317447 Jan 2014 GB
1076861 Jun 2005 IE
H04-152466 May 1992 JP
H05-135095 Jun 1993 JP
H05-197746 Aug 1993 JP
H06-035962 Feb 1994 JP
H06-259487 Sep 1994 JP
H07-093331 Apr 1995 JP
H08-055123 Feb 1996 JP
H09-114907 May 1997 JP
H10-063747 Mar 1998 JP
H10-097530 Apr 1998 JP
H10509543 Sep 1998 JP
H11507752 Jul 1999 JP
3190881 Jul 2001 JP
3190882 Jul 2001 JP
3260693 Feb 2002 JP
2002513970 May 2002 JP
3367675 Jan 2003 JP
2003150623 May 2003 JP
2003157402 May 2003 JP
2004318510 Nov 2004 JP
2005107597 Apr 2005 JP
2005197827 Jul 2005 JP
3762882 Apr 2006 JP
2006216073 Aug 2006 JP
2007042127 Feb 2007 JP
2007249606 Sep 2007 JP
2008152670 Jul 2008 JP
2008152760 Jul 2008 JP
4485548 Jun 2010 JP
4669373 Apr 2011 JP
4669430 Apr 2011 JP
4718687 Apr 2011 JP
2011095841 May 2011 JP
5473533 Feb 2014 JP
244945 Apr 2007 MX
2317447 Jan 2014 NL
WO199406086 Mar 1994 WO
WO9516971 Jun 1995 WO
WO9613013 May 1996 WO
WO9642041 Dec 1996 WO
WO9715885 May 1997 WO
WO9804061 Jan 1998 WO
WO9819224 May 1998 WO
WO9952626 Oct 1999 WO
WO199957651 Nov 1999 WO
WO2000057320 Sep 2000 WO
WO200101289 Jan 2001 WO
WO200129696 Apr 2001 WO
WO2002029622 Apr 2002 WO
WO2002039318 May 2002 WO
WO2006016171 Feb 2006 WO
WO2006121849 Nov 2006 WO
WO2007068123 Jun 2007 WO
WO2008055360 May 2008 WO
WO2008083503 Jul 2008 WO
WO2008147647 Dec 2008 WO
WO2010062540 Jun 2010 WO
WO2010062542 Jun 2010 WO
Non-Patent Literature Citations (238)
Entry
Non-Final Office Action, dated Jun. 18, 2013, U.S. Appl. No. 13/007,445, filed Jan. 14, 2011.
Final Office Action, dated Oct. 29, 2013, U.S. Appl. No. 13/007,445, filed Jan. 14, 2011.
Non-Final Office Action, dated May 19, 2014, U.S. Appl. No. 13/007,445, filed Jan. 14, 2011.
Final Office Action, dated Jan. 20, 2015, U.S. Appl. No. 13/007,445, filed Jan. 14, 2011.
Non-Final Office Action, dated May 13, 2015, U.S. Appl. No. 13/007,445, filed Jan. 14, 2011.
Notice of Allowance, dated Sep. 23, 2015, U.S. Appl. No. 13/007,445, filed Jan. 14, 2011.
Final Office Action, dated Oct. 17, 2013, U.S. Appl. No. 13/007,460, filed Jan. 14, 2011.
Feb. 28, 2013 13/007,460 Jan. 14, 2011 5508US.
Non-Final Office Action, dated Mar. 31, 2014, U.S. Appl. No. 13/007,460, filed Jan. 14, 2011.
Advisory Action, dated Mar. 12, 2015 U.S. Appl. No. 13/007,460, filed Jan. 14, 2011.
Notice of Allowance, dated Aug. 29, 2013, U.S. Appl. No. 12/477,708, filed Jun. 3, 2009.
Non-Final Office Action, dated Jan. 29, 2013, U.S. Appl. No. 12/477,708, filed Jun. 3, 2009.
Non-Final Office Action, dated Jun. 6, 2012, U.S. Appl. No. 12/477,708, filed Jun. 3, 2009.
Non-Final Office Action, dated Dec. 30, 2011, U.S. Appl. No. 12/477,708, filed Jun. 3, 2009.
Advisory Action, dated Sep. 21, 2011, U.S. Appl. No. 12/477,708, filed Jun. 3, 2009.
Final Office Action, dated Jun. 21, 2011, U.S. Appl. No. 12/477,708, filed Jun. 3, 2009.
Non-Final Office Action, dated Oct. 5, 2010, U.S. Appl. No. 12/477,708, filed Jun. 3, 2009.
Non-Final Office Action, dated Mar. 26, 2014, U.S. Appl. No. 12/477,708, filed Jun. 3, 2009.
Non-Final Office Action, dated Oct. 8, 2014, U.S. Appl. No. 12/477,708, filed Jun. 3, 2009.
Final Office Action, dated Jun. 4, 2015, U.S. Appl. No. 12/477,708, filed Jun. 3, 2009.
Notice of Allowance, dated Aug. 28, 2013, U.S. Appl. No. 12/791,527, filed Jun. 1, 2010.
Non-Final Office Action, dated Sep. 26, 2012, U.S. Appl. No. 12/791,527, filed Jun. 1, 2010.
Non-Final Office Action, dated Dec. 23, 2011, U.S. Appl. No. 12/791,527, filed Jun. 1, 2010.
Final Office Action, dated Jul. 21, 2011, U.S. Appl. No. 12/791,527, filed Jun. 1, 2010.
Non-Final Office Action, dated Oct. 6, 2010, U.S. Appl. No. 12/791,527, filed Jun. 1, 2010.
Notice of Allowance, dated Apr. 24, 2013, U.S. Appl. No. 11/525,231, filed Sep. 21, 2006.
Final Office Action, dated Sep. 25, 2012, U.S. Appl. No. 11/525,231, filed Sep. 21, 2006.
Non-Final Office Action, dated Feb. 15, 2012, U.S. Appl. No. 11/525,231, filed Sep. 21, 2006.
Advisory Action, dated Oct. 31, 2011, U.S. Appl. No. 11/525,231, filed Sep. 21, 2006.
Final Office Action, dated Jul. 8, 2011, U.S. Appl. No. 11/525,231, filed Sep. 21, 2006.
Non-Final Office Action, dated Nov. 9, 2010, U.S. Appl. No. 11/525,231, filed Sep. 21, 2006.
Non-Final Office Action, dated Apr. 26, 2010, U.S. Appl. No. 11/525,231, filed Sep. 21, 2006.
Non-Final Office Action, dated Jun. 22, 2011, U.S. Appl. No. 11/659,858, filed May 14, 2007.
Final Office Action, dated Dec. 7, 2011, U.S. Appl. No. 11/659,858, filed May 14, 2007.
Non-Final Office Action, dated Jun. 22, 2004, U.S. Appl. No. 09/662,758, filed Sep. 15, 2000.
Non-Final Office Action, dated Apr. 28, 2005, U.S. Appl. No. 09/662,758, filed Sep. 15, 2000.
Final Office Action, dated Oct. 20, 2005, U.S. Appl. No. 09/662,758, filed Sep. 15, 2000.
Notice of Allowance, dated May 3, 2006, U.S. Appl. No. 09/662,758, filed Sep. 15, 2000.
Non-Final Office Action, dated Dec. 13, 2007, U.S. Appl. No. 11/071,706, filed Mar. 3, 2005.
Final Office Action, dated Oct. 6, 2008, U.S. Appl. No. 11/071,706, filed Mar. 3, 2005.
Non-Final Office Action, dated Jun. 9, 2009, U.S. Appl. No. 11/071,706, filed Mar. 3, 2005.
Final Office Action, dated Feb. 18, 2010, U.S. Appl. No. 11/071,706, filed Mar. 3, 2005.
Advisory Action, dated May 26, 2010, U.S. Appl. No. 11/071,706, filed Mar. 3, 2005.
Non-Final Office Action, dated Sep. 24, 2010, U.S. Appl. No. 11/071,706, filed Mar. 3, 2005.
Notice of Allowance, dated Feb. 9, 2011, U.S. Appl. No. 11/071,706, filed Mar. 3, 2005.
Final Office Action, dated Feb. 28, 2013, U.S. Appl. No. 12/606,603, filed Oct. 27, 2009.
Non-Final Office Action, dated May 25, 2012, U.S. Appl. No. 12/606,603, filed Oct. 27, 2009.
Non-Final Office Action, dated Sep. 3, 1999, U.S. Appl. No. 09/071,900, filed May 4, 1998.
Non-Final Office Action, dated Dec. 20, 2000, U.S. Appl. No. 09/071,900, filed May 4, 1998.
Final Office Action, dated Mar. 29, 2000, U.S. Appl. No. 09/071,900, filed May 4, 1998.
Advisory Action, dated Aug. 14, 2000, U.S. Appl. No. 09/071,900, filed May 4, 1998.
Final Office Action, dated Aug. 15, 2001, U.S. Appl. No. 09/071,900, filed May 4, 1998.
Non-Final Office Action, dated Mar. 12, 2002, U.S. Appl. No. 09/071,900, filed May 4, 1998.
Non-Final Office Action, dated Jul. 3, 2002, U.S. Appl. No. 09/071,900, filed May 4, 1998.
Non-Final Office Action, dated Jan. 2, 2003, U.S. Appl. No. 09/071,900, filed May 4, 1998.
Final Office Action, dated May 7, 2003, U.S. Appl. No. 09/071,900, filed May 4, 1998.
Advisory Action, dated Dec. 30, 2003, U.S. Appl. No. 09/071,900, filed May 4, 1998.
Non-Final Office Action, dated Apr. 22, 2004, U.S. Appl. No. 09/071,900, filed May 4, 1998.
Final Office Action, dated Jan. 13, 2005, U.S. Appl. No. 09/071,900, filed May 4, 1998.
Notice of Allowance, dated Jul. 13, 2005, U.S. Appl. No. 09/071,900, filed May 4, 1998.
Non-Final Office Action, dated Dec. 1, 2003, U.S. Appl. No. 09/965,747, filed Sep. 28, 2011.
Notice of Allowance, dated May 4, 2004, U.S. Appl. No. 09/965,747, filed Sep. 28, 2011.
Advisory Action, dated Sep. 19, 2013, U.S. Appl. No. 12/636,970, filed Dec. 14, 2009.
Final Office Action, dated Jul. 10, 2013, U.S. Appl. No. 12/636,970, filed Dec. 14, 2009.
Non-Final Office Action, dated Dec. 6, 2012, U.S. Appl. No. 12/636,970, filed Dec. 14, 2009.
Advisory Action, dated Nov. 19, 2013, U.S. Appl. No. 12/636,970, filed Dec. 14, 2009.
Non-Final Office Action, dated Feb. 6, 2014, U.S. Appl. No. 12/636,970, filed Dec. 14, 2009.
Final Office Action, dated Jun. 24, 2014, U.S. Appl. No. 12/636,970, filed Dec. 14, 2009.
Notice of Allowance, dated Aug. 29, 2014, U.S. Appl. No. 12/636,970, filed Dec. 14, 2009.
Notice of Allowance, dated Dec. 9, 2010, U.S. Appl. No. 11/953,569, filed Dec. 10, 2007.
Non-Final Office Action, dated Mar. 24, 2010, U.S. Appl. No. 11/953,569, filed Dec. 10, 2007.
Advisory Action, dated Jun. 17, 2013, U.S. Appl. No. 13/052,041, filed Mar. 18, 2011.
Final Office Action, dated Apr. 26, 2013, U.S. Appl. No. 13/052,041, filed Mar. 18, 2011.
Non-Final Office Action, dated Oct. 9, 2012, U.S. Appl. No. 13/052,041, filed Mar. 18, 2011.
Non-Final Office Action, dated Dec. 20, 2013, U.S. Appl. No. 13/052,041, filed Mar. 18, 2011.
Final Office Action, dated Aug. 14, 2014, U.S. Appl. No. 13/052,041, filed Mar. 18, 2011.
Non-Final Office Action, dated Mar. 26, 2015, U.S. Appl. No. 13/052,041, filed Mar. 18, 2011.
Final Office Action, dated Nov. 5, 2015, U.S. Appl. No. 13/052,041, filed Mar. 18, 2011.
Non-Final Office Action, dated Aug. 4, 2016, U.S. Appl. No. 13/052,041, filed Mar. 18, 2011.
Notice of Allowance, dated Nov. 18, 2016, U.S. Appl. No. 13/052,041, filed Mar. 18, 2011.
Non-Final Office Action, dated Dec. 6, 2013, U.S. Appl. No. 13/175,783, filed Jul. 1, 2011.
Final Office Action, dated Jun. 12, 2013, U.S. Appl. No. 13/175,783, filed Jul. 1, 2011.
Non-Final Office Action, dated Nov. 23, 2012, U.S. Appl. No. 13/175,783, field Jul. 1, 2011.
Non-Final Office Action, dated Apr. 2, 2012, U.S. Appl. No. 13/175,783, filed Jul. 1, 2011.
Notice of Allowance, dated Jun. 19, 2014, U.S. Appl. No. 13/175,783, filed Jul. 1, 2011.
Corrected Notice of Allowability, dated Sep. 22, 2014, U.S. Appl. No. 13/175,783, filed Jul. 1, 2011.
Non-Final Office Action, dated May 23, 2016, U.S. Appl. No. 14/311,213, filed Jun. 20, 2014.
Final Office Action, dated Sep. 7, 2016, U.S. Appl. No. 14/311,213, filed Jun. 20, 2014.
Notice of Allowance, dated Nov. 7, 2016, U.S. Appl. No. 14/311,213, filed Jun. 20, 2014.
Non-Final Office Action, dated Oct. 9, 2013, U.S. Appl. No. 13/951,451, filed Jul. 25, 2013.
Final Office Action, dated Jun. 23, 2014, U.S. Appl. No. 13/951,451, filed Jul. 25, 2013.
Non-Final Office Action, dated Dec. 1, 2014, U.S. Appl. No. 13/951,451, filed Jul. 25, 2013.
Final Office Action, dated Mar. 11, 2015, U.S. Appl. No. 13/951,451, filed Jul. 25, 2013.
Non-Final Offfice Action, dated Mar. 31, 2015, U.S. Appl. No. 13/951,451, filed Jul. 25, 2013.
Final Office Action, dated Sep. 1, 2015, U.S. Appl. No. 13/951,451, filed Jul. 25, 2013.
Advisory Action, dated Feb. 16, 2016, U.S. Appl. No. 13/951,451, filed Jul. 25, 2013.
Notice of Allowance, dated Mar. 1, 2016, U.S. Appl. No. 13/951,451, filed Jul. 25, 2013.
Notice of Allowance, dated Mar. 10, 2016, U.S. Appl. No. 13/951,451, filed Jul. 25, 2013.
Final Office Action, dated May 21, 2014, U.S. Appl. No. 14/019,493, filed Sep. 5, 2013.
Non-Final Office Action, dated Dec. 24, 2013, U.S. Appl. No. 14/019,493, filed Sep. 5, 2013.
Advisory Action, dated Jul. 8, 2014, U.S. Appl. No. 14/019,493, filed Sep. 5, 2013.
Non-Final Office Action, dated Dec. 1, 2014, U.S. Appl. No. 14/019,493, filed Sep. 5, 2013.
Non-Final Office Action, dated May 1, 2015, U.S. Appl. No. 14/019,493, filed Sep. 5, 2013.
Non-Final Office Action, dated Jan. 10, 2014, U.S. Appl. No. 14/019,480, filed Sep. 5, 2013.
Final Office Action, dated Jun. 24, 2014, U.S. Appl. No. 14/019,480, filed Sep. 5, 2013.
Notice of Allowance, dated Sep. 3, 2014, U.S. Appl. No. 14/019,480, filed Sep. 5, 2013.
Non-Final Office Action, dated Apr. 1, 2015, U.S. Appl. No. 14/519,077, filed Oct. 20, 2014.
Final Office Action, dated Sep. 21, 2015, U.S. Appl. No. 14/519,077, filed Oct. 20, 2014.
Notice of Allowance, dated Feb. 3, 2016, U.S. Appl. No. 14/519,077, filed Oct. 20, 2014.
Supplemental Notice of Allowance, dated Mar. 1, 2016, U.S. Appl. No. 14/519,077, filed Oct. 20, 2014.
Non-Final Office Action, dated Aug. 4, 2016, U.S. Appl. No. 15/150,377, filed May 9, 2016.
“Office Action,” European Patent Application No. 10185842.1, dated Dec. 8, 2016, 7 pages.
First Examination Report dated Nov. 26, 2009 for European Patent Application 05772051.8, filed May 8, 2006, 8 pages.
Second Examination Report dated Feb. 19, 2013 for European Patent Application 06759147.9, filed May 8, 2006, 5 pages.
Langlais, et al. “TransType: a Computer-Aided Translation Typing System”, in Conference on Language Resources and Evaluation, 2000, pp. 46-51.
First Notice of Reasons for Rejection dated Jun. 18, 2013 for Japanese Patent Application 2009-246729, filed Oct. 27, 2009, 3 pages.
First Notice of Reasons for Rejection dated Jun. 4, 2013 for Japanese Patent Application 2010-045531, filed Oct. 27, 2009, 4 pages.
Rejection Decision dated May 14, 2013 for Chinese Patent Application 200910253192.6, filed Dec. 14, 2009, 9 pages.
Matsunaga, et al. “Sentence Matching Algorithm of Revised Documents with Considering Context Information,” IEICE Technical Report, 2003, pp. 43-48.
Pennington, Paula K. Improving Quality in Translation Through an Awareness of Process and Self-Editing Skills. Eastern Michigan University, ProQuest, UMI Dissertations Publishing, 1994, 115 pages.
Notice of Allowance dated Jan. 7, 2014 for Japanese Patent Application 2009-246729, filed Oct. 27, 2009, 3 pages.
Kumano et al., “Japanese-English Translation Selection Using Vector Space Model,” Journal of Natural Language Processing; vol. 10; No. 3; (2003); pp. 39-59.
Final Rejection and a Decision to Dismiss the Amendment dated Jan. 7, 2014 for Japanese Patent Application 2010-045531, filed Mar. 2, 2010, 4 pages.
Office Action dated Feb. 24, 2014 for Chinese Patent Application No. 201010521841.9, filed Oct. 25, 2010, 30 pages.
Extended European Search Report dated Oct. 24, 2014 for European Patent Application 10185842.1, filed Oct. 1, 2010, 8 pages.
Summons to attend oral proceeding pursuant to Rule 115(1)(EPC) mailed Oct. 13, 2014 in European Patent Application 00902634.5 filed Jan. 26, 2000, 8 pages.
Summons to attend oral proceeding pursuant to Rule 115(1)(EPC) mailed Feb. 3, 2015 in European Patent Application 06759147.9 filed May 8, 2006, 5 pages.
Decision to Refuse dated Mar. 2, 2015 in European Patent Application 00902634.5 filed Jan. 26, 2000, 15 pages.
Brief Communication dated Jun. 17, 2015 in European Patent Application 06759147.9 filed May 8, 2006, 20 pages.
Somers, H. “EBMT Seen as Case-based Reasoning” Mt Summit VIII Workshop on Example-Based Machine Translation, 2001, pp. 56-65, XP055196025.
The Minutes of Oral Proceedings mailed Mar. 2, 2015 in European Patent Application 00902634.5 filed Jan. 26, 2000, 19 pages.
Notification of Reexamination dated Aug. 18, 2015 in Chinese Patent Application 200910253192.6, filed Dec. 14, 2009, 24 pages.
Decision to Refuse dated Aug. 24, 2015 in European Patent Application 06759147.9, filed May 8, 2006, 26 pages.
Papineni, Kishore, et al., “BLEU: A Method for Automatic Evaluation of Machine Translation,” Proceedings of the 40th Annual Meeting on Association for Computational Linguistics. Association for Computational Linguistics, 2002, pp. 311-318.
Komatsu, H et al, “Corpus-based predictive text input”, “Proceedings of the 2005 International Conference on Active Media Technology”, 2005, IEEE, pp. 75-80, ISBN 0-7803-9035-0.
Saiz, Jorge Civera: “Novel statistical approaches to text classification, machine translation and computer-assisted translation” Doctor En Informatica Thesis, May 22, 2008, XP002575820 Universidad Polit'ecnica de Valencia, Spain. Retrieved from Internet: http://dspace.upv.es/manakin/handle/10251/2502 [retrieved on Mar. 30, 2010]. p. 111-131.
De Gispert, A., Marino, J.B. and Crego, J.M.: “Phrase-Based Alignment Combining Corpus Cooccurrences and Linguistic Knowledge” Proc. of the Int. Workshop on Spoken Language Translation (IWSLT'04), Oct. 1, 2004, XP002575821 Kyoto, Japan. pp. 107-114. Retrieved from the Internet: http://mi.eng.cam.ac.uk/˜ad465/agispert/docs/papers/TP_gispert.pdf [retrieved on Mar. 30, 2010].
Planas, Emmanuel: “SIMILIS Second-generation translation memory software,” Translating and the Computer 27, Nov. 2005 [London: Aslib, 2005], 7 pages.
Net Auction, www.netauction.net/dragonart.html, “Come bid on original illustrations,” by Greg & Tim Hildebrandt, Feb. 3, 2001. (last accessed Nov. 16, 2011), 3 pages.
Web Pages—BidNet, www.bidnet.com, “Your link to the State and Local Government Market,” including Bid Alert Service, Feb. 7, 2009. (last accessed Nov. 16, 2011), 1 page.
Web Pages Christie's, www.christies.com, including “How to Buy,” and “How to Sell,” Apr. 23, 2009. (last accessed Nov. 16, 2011), 1 page.
Web Pages Artrock Auction, www.commerce.com, Auction Gallery, Apr. 7, 2007. (last accessed Nov. 16, 2011), 1 page.
Trados Translator's Workbench for Windows, 1994-1995, Trados GbmH, Stuttgart, Germany, pp. 9-13 and 27-96.
Notification of Reasons for Refusal for Japanese Application No. 2000-607125 dated Nov. 10, 2009 (Abstract Only), 3 pages.
Ross et al., U.S. Appl. No. 11/071,706, filed Mar. 3, 2005, Office Communication dated Dec. 13, 2007, 19 pages.
Ross et al., U.S. Appl. No. 11/071,706, filed Mar. 3, 2005, Office Communication dated Oct. 6, 2008, 36 pages.
Ross et al., U.S. Appl. No. 11/071,706, filed Mar. 3, 2005, Office Communication dated Jun. 9, 2009, 37 pages.
Ross et al., U.S. Appl. No. 11/071,706, filed Mar. 3, 2005, Office Communication dated Feb. 18, 2010, 37 pages.
Colucci, Office Communication for U.S. Appl. No. 11/071,706 dated Sep. 24, 2010, 18 pages.
Och, et al., “Improved Alignment Models for Statistical Machine Translation,” In: Proceedings of the Joint Workshop on Empirical Methods in NLP and Very Large Corporations, 1999, p. 20-28, downloaded from http://www.actweb.org/anthology-new/W/W99/W99-0604.pdf.
International Search Report and Written Opinion dated Sep. 4, 2007 in Patent Cooperation Treaty Application No. PCT/US06/17398, 9 pages.
XP 002112717 Machine translation software for the Internet, Harada K.; et al, vol. 28, Nr:2, pp. 66-74. Sanyo Technical Review San'yo Denki Giho, Hirakata, JP ISSN 0285-516X, Oct. 1, 1996.
XP 000033460 Method to Make a Translated Text File Have the Same Printer Control Tags as the Original Text File, vol. 32, Nr:2, pp. 375-377, IBM Technical Disclosure Bulletin, International Business Machines Corp. (Thornwood), US ISSN 0018-8689, Jul. 1, 1989.
XP 002565038—Integrating Machine Translation into Translation Memory Systems, Matthias Heyn, pp. 113-126, TKE. Terminology and Knowledge Engineering. Proceedings International Congress on Terminology and Knowledge Engineering, Aug. 29-30, 1996.
XP 002565039—Linking translation memories with example-based machine translation, Michael Carl; Silvia Hansen, pp. 617-624, Machine Translation Summit. Proceedings, Sep. 1, 1999.
XP 55024828 TransType2 an Innovative Computer-Assisted Translation System, ACL 2004, Jul. 21, 2004, Retrieved from the Internet: http://www.mt-archive.info/ACL-2004-Esteban.pdf [retrieved on Apr. 18, 2012], 4 pages.
Bourigault, Surface Grammatical Analysis for the Extraction of Terminological Noun Phrases, Proc. of Coling-92, Aug. 23, 1992, pp. 977-981, Nantes, France.
Thurmair, Making Term Extraction Tools Usable, The Joint Conference of the 8th International Workshop of the European Association for Machine Translation, May 15, 2003, Dublin, Ireland, 10 pages.
Sanfillipo, Section 5.2 Multiword Recognition and Extraction, Eagles LE3-4244, Preliminary Recommendations on Lexical Semantic Encoding, Jan. 7, 1999, pp. 176-186.
Hindle et al., Structural Ambiguity and lexical Relations, 1993, Association for Computational Linguistics, vol. 19, No. 1, pp. 103-120.
Ratnaparkhi, A Maximum Entropy Model for Part-Of-Speech Tagging, 1996, Proceedings for the conference on empirical methods in natural language processing, V.1, pp. 133-142.
Somers, H. “Review Article: Example-based Machine Translation,” Machine Translation, Issue 14, pp. 113-157, 1999.
Civera, et al. “Computer-Assisted Translation Tool Based on Finite-State Technology,” In: Proc. of EAMT, 2006, pp. 33-40 (2006).
Okura, Seiji et al., “Translation Assistance by Autocomplete,” The Association for Natural Language Processing, Publication 13th Annual Meeting Proceedings, Mar. 2007, p. 678-679.
Soricut, R, et al., “Using a Large Monolingual Corpus to Improve Translation Accuracy,” Proc. of the Conference of the Association for Machine Translation in the Americas (Amta-2002), Aug. 10, 2002, pp. 155-164, XP002275656.
Fung et al. “An IR Approach for Translating New Words from Nonparallel, Comparable Texts,” Proceeding COLING 998 Proceedings of the 17th International Conference on Computational Linguistics, 1998, pp. 414-420.
First Office Action dated Dec. 26, 2008 in Chinese Patent Application 200580027102.1, filed Aug. 11, 2005, 7 pages.
Second Office Action dated Aug. 28, 2009 in Chinese Patent Application 200580027102.1, filed Aug. 11, 2005, 8 pages.
Third Office Action dated Apr. 28, 2010 in Chinese Patent Application 200580027102.1, filed Aug. 11, 2005, 8 pages.
Summons to attend oral proceeding pursuant to Rule 115(1)(EPC) mailed Mar. 20, 2012 in European Patent Application 05772051.8 filed Aug. 11, 2005, 7 pages.
Notification of Reasons for Rejection dated Jan. 9, 2007 for Japanese Patent Application 2000-547557, filed Apr. 30, 1999, 2 pages.
Decision of Rejection dated Jul. 3, 2007 for Japanese Patent Application 2000-547557, filed Apr. 30, 1999, 2 pages.
Extended European Search Report and Written Opinion dated Jan. 26, 2011 for European Patent Application 10189145.5, filed on Oct. 27, 2010, 9 pages.
Notice of Reasons for Rejection dated Jun. 26, 2012 for Japanese Patent Application P2009-246729. filed Oct. 27, 2009, 8 pages.
Search Report dated Jan. 22, 2010 for United Kingdom Application GB0918765.9, filed Oct. 27, 2009, 5 pages.
Notice of Reasons for Rejection dated Mar. 30, 2010 for Japanese Patent Application 2007-282902. filed Apr. 30, 1999, 5 pages.
Decision of Rejection dated Mar. 15, 2011 for Japanese Patent Application 2007-282902, filed Apr. 30, 1999, 5 pages.
First Office Action dated Oct. 18, 2011 for Chinese Patent Application 2009102531926, filed Dec. 14, 2009, 7 pages.
Second Office Action dated Aug. 14, 2012 for Chinese Patent Application 2009102531926, filed Dec. 14, 2009, 6 pages.
European Search Report dated Apr. 12, 2010 for European Patent Application 09179150.9, filed Dec. 14, 2009, 6 pages.
First Examination Report dated Jun. 16, 2011 for European Patent Application 09179150.9, filed Dec. 14, 2009, 6 pages.
Notice of Reasons for Rejection dated Jul. 31, 2012 for Japanese Patent Application 2010-045531, filed Mar. 2, 2010, 10 pages.
First Examination Report dated Oct. 26, 2012 for United Kingdom Patent Application GB0903418.2, filed Mar. 2, 2009, 6 pages.
Frst Office Action dated Jun. 19, 2009 for Chinese Patent Application 200680015388.6, filed May 8, 2006, 15 pages.
Final Office Action, dated Mar. 10, 2017, U.S. Appl. No. 15/150,377, filed May 9, 2016.
“Decision to Refuse,” European Patent Application 10185842.1, dated Mar. 22, 2018, 16 pages.
Nepveu et al. “Adaptive Language and Translation Models for Interactive Machine Translation” Conference on Empirical Methods in Natural Language Processing, Jul. 25, 2004, 8 pages. Retrieved from: http://www.cs.jhu.edu/˜yarowsky/sigdat.html.
Ortiz-Martinez et al. “Online Learning for Interactive Statistical Machine Translation” Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the ACL, Jun. 10, 2010, pp. 546-554. Retrieved from: https://www.researchgate.net/publication/220817231_Online_Learning_for_Interactive_Statistical_Machine_Translation.
Callison-Burch et al. “Proceedings of the Seventh Workshop on Statistical Machine Translation” [W12-3100] Proceedings of the Seventh Workshop on Statistical Machine Translation, Jun. 7, 2012, pp. 10-51. Retrieved from: http://aclanthology.info/volumes/proceedings-of-the-seventh-workshop-onstatistical-machine-translation.
Lopez, Adam. “Putting Human Assessments of Machine Translation Systems in Order” [W12-3101] Proceedings of the Seventh Workshop on Statistical Machine Translation, Jun. 7, 2012, pp. 1-9. Retrieved from: http://aclanthology.info/volumes/proceedings-of-the-seventh-workshop-onstatistical-machine-translation.
Avramidis, Eleftherios. “Quality estimation for Machine Translation output using linguistic analysis and decoding features” [W12-3108] Proceedings of the Seventh Workshop on Statistical Machine Translation, Jun. 7, 2012, pp. 84-90. Retrieved from: http://aclanthology.info/volumes/proceedings-of-the-seventh-workshop-onstatistical-machine-translation.
Buck, Christian. “Black Box Features for the WMT 2012 Quality Estimation Shared Task” [W12-3109] Proceedings of the Seventh Workshop on Statistical Machine Translation, Jun. 7, 2012, pp. 91-95. Retrieved from: Proceedings of the Seventh Workshop on Statistical Machine Translation. Retrieved from: http://aclanthology.info/volumes/proceedings-of-the-seventh-workshop-onstatistical-machine-translation.
Felice et al. “Linguistic Features for Quality Estimation” [W12-3110] Proceedings of the Seventh Workshop on Statistical Machine Translation, Jun. 7, 2012, pp. 96-103. Retrieved at: machine-translation http://aclanthology.info/volumes/proceedings-of-the-seventh-workshop-onstatistical-machine-translation.
Gonzalez-Rubio et al. “PRHLT Submission to the WMT12 Quality Estimation Task” [W12-3111] Proceedings of the Seventh Workshop on Statistical Machine Translation, Jun. 7, 2012, pp. 104-108. Retrieved from: http://aclanthology.info/volumes/proceedings-of-the-seventh-workshop-onstatistical-machine-translation.
Hardmeier et al. “Tree Kernels for Machine Translation Quality Estimation” [W12-3112] Proceedings of the Seventh Workshop on Statistical Machine Translation,Jun. 7, 2012, pp. 109-113. Retrieved from: http://aclanthology.info/volumes/proceedings-of-the-seventh-workshop-onstatistical-machine-translation.
Langlois et al. “LORIA System for the VVMT12 Quality Estimation Shared Task” [W12-3113] Proceedings of the Seventh Workshop on Statistical Machine Translation, Jun. 7, 2012, pp. 114-119. Retrieved from: http://aclanthology.info/volumes/proceedings-of-the-seventh-workshop-onstatistical-machine-translation.
Moreau et al. “Quality Estimation: an experimental study using unsupervised similarity measures” [W12-3114] Proceedings of the Seventh Workshop on Statistical Machine Translation, Jun. 7, 2012, pp. 120-126. Retrieved from: http://aclanthology.info/volumes/proceedings-of-the-seventh-workshop-onstatistical-machine-translation.
Gonzalez et al. “The UPC Submission to the WMT 2012 Shared Task on Quality Estimation” [W12-3115] Proceedings of the Seventh Workshop on Statistical Machine Translation, Jun. 7, 2012, pp. 127-132. Retrieved from: http://aclanthology.info/volumes/proceedings-of-the-seventh-workshop-onstatistical-machine-translation.
Popovic, Maja. “Morpheme- and POS-based IBM1 and language model scores for translation quality estimation” Proceedings of the Seventh Workshop on Statistical Machine Translation, Jun. 7, 2012, pp. 133-137. Retrieved from: http://aclanthology.info/volumes/proceedings-of-the-seventh-workshop-onstatistical-machine-translation.
Rubino et al. “DCU-Symantec Submission for the WMT 2012 Quality Estimation Task” [W12-3117] Proceedings of the Seventh Workshop on Statistical Machine Translation, Jun. 7, 2012, pp. 138-144. Retrieved from: http://aclanthology.info/volumes/proceedings-of-the-seventh-workshop-onstatistical-machine-translation.
Soricut et al. “The SDL Language Weaver Systems in the VVMT12 Quality Estimation Shared Task” [W12-3118] Proceedings of the Seventh Workshop on Statistical Machine Translation, Jun. 7, 2012, pp. 145-151. Retrieved from: http://aclanthology.info/volumes/proceedings-of-the-seventh-workshop-onstatistical-machine-translation.
Wu et al. “Regression with Phrase Indicators for Estimating MT Quality” [W12-3119] Proceedings of the Seventh Workshop on Statistical Machine Translation, Jun. 7, 2012, pp. 152-156. Retrieved from: http://aclanthology.info/volumes/proceedings-of-the-seventh-workshop-onstatistical-machine-translation.
Wuebker et al. “Hierarchical Incremental Adaptation for Statistical Machine Translation” Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, pp. 1059-1065, Lisbon, Portugal, Sep. 17-21, 2015.
“Best Practices—Knowledge Base,” Lilt website [online], Mar. 6, 2017 [retrieved on Oct. 19, 2017], Retrieved from the Internet:<https://lilt.com/kb/translators/best-practices>, 2 pages.
“Data Security—Knowledge Base,” Lilt website [online], Oct. 14, 2016 [retrieved on Oct. 19, 2017], Retrieved from the Internet:<https://lilt.com/kb/security>, 1 pages.
“Data Security and Confidentiality,” Lilt website [online], 2017 [retrieved on Oct. 19, 2017], Retrieved from the Internet: <https://lilt.com/security>, 7 pages.
“Memories—Knowledge Base,” Lilt website [online], Jun. 7, 2017 [retrieved on Oct. 19, 2017], Retrieved from the Internet:<https://lilt.com/kb/project-managers/memory>, 4 pages.
“Memories (API)—Knowledge Base,” Lilt website [online], Jun. 2, 2017 [retrieved on Oct. 19, 2017], Retrieved from the Internet:<https://lilt.com/kb/api/memories>, 1 page.
“Quoting—Knowledge Base,” Lilt website [online], Jun. 7, 2017 [retrieved on Oct. 19, 2017], Retrieved from the Internet:<https://lilt.com/kb/project-managers/quoting>, 4 pages.
“The Editor—Knowledge Base,” Lilt website [online], Aug. 15, 2017 [retrieved on Oct. 19, 2017], Retrieved from the Internet:<https://lilt.com/kb/translators/editor>, 5 pages.
“Training Lil—Knowledge Base,” Lilt website [online], Oct. 14, 2016 [retrieved on Oct. 20, 2017], Retrieved from the Internet:<https://lilt.com/kb/troubleshooting/training-lilt>, 1 page.
“What is Lilt_—Knowledge Base,” Lilt website [online],Dec. 15, 2016 [retrieved on Oct. 19, 2017], Retrieved from the Internet:<https://lilt.conn/kb/what-is-lilt>, 1 page.
“Getting Started—Knowledge Base,” Lilt website [online], Apr. 11, 2017 [retrieved on Oct. 20, 2017], Retrieved from the Internet:<https://lilt.com/kb/translators/getting-started>, 2 pages.
“The Lexicon—Knowledge Base,” Lilt website [online], Jun. 7, 2017 [retrieved on Oct. 20, 2017], Retrieved from the Internet:<https://lilt.com/kb/translators/lexicon>, 4 pages.
“Simple Translation—Knowledge Base,” Lilt website [online], Aug. 17, 2017 [retrieved on Oct. 20, 2017], Retrieved from the Internet:<https://liltcom/kb/api/simple-translation>, 3 pages.
“Split and Merge—Knowledge Base,” Lilt website [online], Oct. 14, 2016 [retrieved on Oct. 20, 2017], Retrieved from the Internet:<https://lilt.com/kb/translators/split-merge>, 4 pages.
“Lilt API_API Reference,” Lilt website [online], retrieved on Oct. 20, 2017, Retrieved from the Internet:<https://lilt.com/docs/api>, 53 pages.
“Automatic Translation Quality—Knowledge Base”, Lilt website [online], Dec. 1, 2016, retrieved on Oct. 20, 2017, Retrieved from the Internet:<https://lilt.com/kb/evaluation/evaluate-mt>, 4 pages.
“Projects—Knowledge Base,”Lilt website [online], Jun. 7, 2017, retrieved on Oct. 20, 2017, Retrieved from the Internet:<https://lilt.com/kb/project-managers/projects>, 3 pages.
“Getting Started with lilt,” Lilt website [online], May 30, 2017, retrieved on Oct. 20, 2017, Retrieved from the Internet:<https://lilt.com/kb/api/lilt-js>, 6 pages.
“Interactive Translation—Knowledge Base,” Lilt website [online], Aug. 17, 2017, retrieved on Oct. 20, 2017, Retrieved from the Internet:<https://lilt.com/kb/api/interactive-translation>, 2 pages.
Hildebrand et al., “Adaptation of the Translation Modelfor Statistical Machine Translation based on Information Retrieval,” EAMT 2005 Conference Proceedings, May 2005, pp. 133-142. Retrieved from https://www.researchgate.net/publication/228634956_Adaptation_of_the_translation_model_for_statistical_machine_translation_based_on_information_retrieval.
Och et al., “The Alignment Template Approach to Statistical Machine Translation Machine Translation,” Computational Linguistics, vol. 30. No. 4, Dec. 1, 2004, pp. 417-442 (39 pages with citations). Retrieved from http://dl.acm.org/citation.cfm?id=1105589.
Sethy et al., “Building Topic Specific Language Models Fromwebdata Using Competitive Models,” Interspeech 2005—Eurospeech, 9th European Conference on Speech Communication and Technology, Lisbon, Portugal, Sep. 4-8, 2005, 4 pages. Retrieved from https://www.researchgate.net/publication/221490916_Building_topic_specificlanguage_models_from_webdata_using_competitive_models.
Dobrinkat, “Domain Adaptation in Statistical Machine Translation Systems via User Feedback,” Master's Thesis, University of Helsinki, Nov. 25, 2008, 103 pages. Retrieved from http://users.ics.aalto.fi/mdobrink/online-papers/dobrinkat08mt.pdf.
Business Wire, “Language Weaver Introduces User-Managed Customization Tool,” Oct. 25, 2005, 3 pages. Retrieved from http: ProQuest.
Winiwarter, W., “Learning Transfer Rules for Machine Translation from Parallel Corpora,” Journal of Digital Information Management, vol. 6 No. 4, Aug. 2008, pp. 285-293. Retrieved from https://www.researchgate.net/publication/220608987_Learning_Transfer_Rules_for_Machine_Translation_from_Parallel_Corpora.
Potet et al., “Preliminary Experiments on Using Users' Post-Editions to Enhance a SMT System,” Proceedings of the European Association for Machine Translation (EAMT), May 2011, pp. 161-168. Retreived from Retrieved at http://www.mt-archive.info/EAMT-2011-Potet.pdf.
Ortiz-Martinez et al., “An Interactive Machine Translation System with Online Learning” Proceedings of the ACL-HLT 2011 System Demonstrations, Jun. 21, 2011, pp. 68-73. Retrieved from http://www.aclweb.org/anthology/P11-4012.
Lopez-Salcedo et al.,“Online Learning of Log-Linear Weights in Interactive Machine Translation,” Communications in Computer and Information Science, vol. 328, 2011, pp. 1-10. Retrieved from http://www.casmacat.eu/uploads/Main/iberspeech2.pdf.
Blanchon et al., “A Web Service Enabling Gradable Post-edition of Pre-translations Pro duced by Existing Translation Tools: Practical Use to Provide High quality Translation of an Online Encyclopedia” Jan. 2009, 9 pages. Retrieved from http://www.mt-archive.info/MTS-2009-Blanchon.pdf.
Levenberg et al.“Stream-based Translation Models for Statistical Machine Translation” Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the ACL, Dec. 31, 2010, pp. 394-402.
Lagarda et al. “Statistical Post-Editing of a Rule Based Machine Translation System” Proceedings of NAACL HLT 2009: Short Papers, Jun. 2009, pp. 217-220.
Ehara, “Rule Based Machine Translation Combined with Statistical Post Editor for Japanese to English Patent Translation,” MT Summit XI, 2007, pp. 13-18.
Bechara et al. “Statistical Post-Editing for a Statistical MT System” Proceedings of the 13th Machine Translation Summit, 2011, pp. 308-315.
“Summons to attend oral proceeding pursuant to Rule 115(1)(EPC),” European Patent Application 10185842.1, Aug. 11, 2017, 9 pages.
Westfall, Edith R., “Integrating Tools with the Translation Process North American Sales and Support,” Jan. 1, 1998, pp. 501-505, XP055392884. Retrieved from the Internet: <URL:https://rd.springer.com/content/pdf/10.1007/3-540-49478-2_46.pdf>.
“Summons to attend oral proceeding pursuant to Rule 115(1)(EPC),” European Patent Application 09179150.9, Dec. 14, 2017, 17 pages.
Related Publications (1)
Number Date Country
20170132214 A1 May 2017 US
Continuations (6)
Number Date Country
Parent 14311213 Jun 2014 US
Child 15410471 US
Parent 13052041 Mar 2011 US
Child 14311213 US
Parent 11953569 Dec 2007 US
Child 13052041 US
Parent 11735763 Apr 2007 US
Child 11953569 US
Parent 11515398 Sep 2006 US
Child 11735763 US
Parent 11123071 May 2005 US
Child 11515398 US