US 8,676,563 B2Grant
Providing human-generated and machine-generated trusted translations
Issue Date:2014-03-18
•27 Claims
•8 Drawing Sheets
Abstract
Customers having a translation project to select a translation method from a variety of options, ranging from a completely human translation to a completely automated translation. For human translations, translation job information may be communicated through one or more network service modules which execute within a network service application, such as a web-based networking application. A network service module may register a user having an account with the network service application as a translator and communicate translation jobs to the user. One or more users who express interest in performing the translation are selected to perform a translation job, each job comprising at least a portion of the translation project. After a user provides a translation for the translation job, the translation is analyzed to generate a trust level prediction for the translation. A user translation profile may be updated after each translation to reflect the user's performance.
Metadata
Assignee
- Language Weaver, Inc.
Inventors
- Radu Soricut
- Narayanaswamy Viswanathan
- Daniel Marcu
Application Information
Application Number:US 12/820,061
Filing Date:2010-06-21
Priority Date:2009-10-01
Art Unit:2657
Classifications
IPC:
G06F17/28
Patent Drawings (8 sheets)
Description
Cross-Reference to Related Application
[0001] The present application is a Continuation-in-Part and claims the priority benefit of prior U.S. patent application Ser. No. 12/572,021 filed Oct. 1, 2009 now U.S. Pat. No. 8,380,486 and entitled “Providing Machine-Generated Translations and Corresponding Trust Levels,” and is related to U.S. patent application Ser. No. 12/510,913 filed Jul. 28, 2009 and entitled “Translating Documents Based on Content.” The disclosures of both aforementioned applications are incorporated herein by reference.
Background of the Invention
[0002] Translations of documents from a source one language to a target language are typically handled by people or by machines. Translation services usually focus on one or the other, but not both. Most machine translation services do not provide a choice of machine translation or human translation options to a customer.
[0003] Further, human translations are typically more expensive than machine translations and peer reviewed. The human translation quality is usually confirmed by review of one or more other people. Inevitably, the translation skills of different reviewers will vary from person to person. Therefore, the quality of a peer reviewed translation may be subjective based on the skill of the particular reviewer, and may vary between translation. This results in an uneven measure of human translation reviews and inconsistent quality.
Summary of the Invention
[0004] The present technology allows customers having a translation project to select a translation method from a variety of options, ranging from a completely human translation to a completely automated translation. The human translation option may include one or more users translating portions of a translation project. The users may be harnessed through one or more network service modules (end point modules) which execute within a network service application, such as a web-based networking application. A network service module may register a user having an account with the network service application as a translator and communicate translation jobs to the user. One or more users who express interest in performing the translation are selected to perform a translation job, each job comprising at least a portion of the translation project. After a user provides a translation for the translation job, the translation is analyzed to generate a trust level prediction for the translation. A user translation profile may be updated after each translation to reflect the user's performance. User performance may be based on an automatically generated trust score, failure to provide a translation and other information. The translation and rating information is provided to the user and to the network service module within the web service application.
[0005] An embodiment may provide a trusted translation by receiving a human-generated translation of a document from a source language to a target language. A trust level prediction of the human-generated translation may be generated. The trust level may be associated with a translational accuracy of the human-generated translation. The human-generated translation and the trust level may then be output.
[0006] An embodiment may process a translation job by receiving user information from a user having an account with a network service. The user information may be received by a network service module. Translation job information may be received from a remote application by the network service module. The translation job information may be provided to the user.
Brief Description of the Drawings
[0007] FIG. 1 is a block diagram of an exemplary system for providing a trusted translation.
[0008] FIG. 2 is a block diagram of an exemplary application server module.
[0009] FIG. 3 is a flow chart of an exemplary method for providing a trusted translation.
[0010] FIG. 4 is a flow chart of an exemplary method for providing a trusted human translation.
[0011] FIG. 5 is a flow chart of an exemplary method for providing a translation.
[0012] FIG. 6 is a flow chart of an exemplary method for handling a translation job.
[0013] FIG. 7 is a flow chart of a computing device for implementing the present technology.
Detailed Description of Exemplary Embodiments
[0014] The present technology allows customers having a translation project to select a translation method from a variety of options, ranging from a completely human translation to a completely automated translation. The human translation option may include one or more users translating portions of a translation project. The users may be harnessed through one or more network service modules (end point modules) which execute within a network service application, such as a web-based networking application. A network service module may register a user having an account with the network service application and communicate translation jobs to the user.
[0015] A user may request to perform one or more jobs that are communicated to the user. One or more users who express interest in performing the translation are selected to perform a translation job, each job comprising at least a portion of the translation project. User selection may depend on past user translation performance, ability to complete past translations on time, and other information. Once a user provides a translation for the translation job, the translation is analyzed to generate a trust level prediction for the translation. A user translation profile may be updated after the translation or failure to complete the translation to reflect the user's performance. The translation and rating information is provided to the user and to the network service module within the web service application.
[0016] FIG. 1 is a block diagram of an exemplary system for providing a trusted translation. System 100 of FIG. 1 includes application server 110, network server 120, network 130, customer computing device 140, user computing devices 150 and 160, network service servers 170 and 180, and content destination server 190.
[0017] Application server 110 may be implemented as one or more servers and may process requests received over network 130 via network server 120. Application server 110 may communicate with network server 120 and may include translation application 112, training data set 114, and human translation module 116. The functionality of application server 110 is discussed in more detail below with respect to the methods of FIGS. 3-5 .
[0018] Translation application 112 may include one or more applications executed by a processor to generate a machine translation. Translation application 112 may also be executed to predict a translation quality of a human generated translation or machine translation, provide an interface to customers for requesting and managing translation projects, and other functions.
[0019] Human translation module 116 may be executed to communicate with remote network service modules installed on remote machines (for example, modules executing within applications on network service servers). The human translation module may manage user translation profiles and communicate translation job information, user translation profile information, and other data with a network service module.
[0020] Network server 120 communicates with application server 110 and network 130. The network server may be implemented as one or more machines that process requests for application server 110 and provide responses to requesting entities. The responses may be generated by application server 110 or network server 120. When network 130 is implemented as the Internet, network server 120 may be implemented as a web server.
[0021] Network 130 may be implemented as a local area network, wide area network, private network, public network, an intranet, the Internet, or a combination of these networks.
[0022] Customer computing device 140 may be utilized by a customer 142 to request services provided by application server 110. In particular, customer computing device 140 may transmit a request to translation application 112 to configure a translation project, select a type of translation, configure network service modules for the human translation, and complete a translation.
[0023] The present technology may utilize one or more users to implement crowd sourced-based human translations. Users 152 and 162 may access translation job information provided by a network service module and submit translations to application server 110 through computing devices 150-160. Each of computing devices 140, 150 and 160 may communicate with other devices over network 130. Though only two user computing devices are illustrated, more or fewer user computing devices may be present in system 100.
[0024] As illustrated, a system 100 may include one or more network service servers, such as servers 170 and 180, which may include applications 172 and 182, respectively. Each of network service servers 170 and 180 may be implemented as one or more servers which provide a service over network 130. The service may be accessed by network service users or a machine translation customer over network 130. Network service server 170 may include an application 172. The application may implement a network service over network 130, such as for example a networking service, business service, or some other service. Examples of web services provided by an application 172 include Facebook, Linked In, Pro-Z, and other services.
[0025] One or more endpoint modules may be embedded within or execute to communicate with an application within a network service. Network service module 174 may be imbedded within application 172 and may interact with users which subscribe to and/or have an account with a service provided by application 172. When executed, network service module 174 may register a user with the network service module, provide information regarding translation jobs, and select one or more users to perform a translation. The implementation of registering a user, publishing a translation job, and selecting users to perform translations may vary depending on the platform and application in which the network service module 174 executes within. Operation for network service module 174 is discussed in more detail below with respect to FIG. 6 .
[0026] Network service module 184 may execute within application 182, and may operate similarly to network service module 174. Though system 100 illustrates one network service module within each application, other variations of applications within a server and network service modules associated with an application are possible.
[0027] Content destination server may communicate with network 130 and receive translated content to be published or stored. The content destination server 190 may be implemented as a customer web site, an online document, or some other content, and may publish translations generated by crowd sourcing or machine translation.
[0028] FIG. 2 is a block diagram of an exemplary application server module. In some embodiments, the application of FIG. 2 provides more detail for the application modules of application server 110 in FIG. 1 . A human translation module 116 may identify jobs in a translation project, as well as manage communications, parameters, and other portions of a crowd-sourced translation project. The human translation module 116 may communicate job information to a network service module based on a translation project configured by a customer. Human translation module 116 may also manage user translation profiles. The translation profiles may be updated based on a status of a translation, a trust score generated based on a completed translation, and other information such as for example subject matter expertise for a particular user translator.
[0029] Translation application 112 may include communications module 205, interface module 210, translation engine 215, and quality prediction engine 220. Translation application 112 may be executed to manage communication with a customer through customer computing device 140, interface with remote devices, translate a document to generate translated content, and provide a quality prediction of a user generated translation.
[0030] Communications module 205 may be executed to allow an indication to be received via a user interface to provide a translation of a document from a source language to a target language, as well as a prediction of a trust level of the translation. The communications module 205 may also facilitate accessing the document to be translated such as in response to an indication by a user.
[0031] The interface module 210 can be executed to provide a graphical user interface through a network browser, for example as a content page provided by a web browser, which enables a user to request the translation and corresponding trust-level prediction.
[0032] The translation engine 215 comprises a machine translation engine capable of translating from a source language to a target language. Such translation capability may result from training the translation engine 215 on various training data. In some embodiments, the translation application 112 may include more than one translation engines 215. Additionally, the translation engine 215 may be based on statistical-translation techniques, non-statistical-translation techniques, or a combination thereof.
[0033] As depicted in FIG. 2 , the translation engines 215 is associated with the training dataset 225. According to other exemplary embodiments, the translation engine 215 can be associated with any number of training datasets. The training dataset 225 may comprise documents in source languages and corresponding translations of those documents in target languages (i.e., parallel corpora). The translated documents may be human-generated or machine-generated. The training dataset 225 may be domain-specific or generic.
[0034] According to exemplary embodiments, the quality prediction engine 220 is executable to predict a trust level of a translation provided by the translation engine 215. The trust-level prediction is indicative of translational accuracy of translations generated by the translation engine 215. The trust level is predicted independent of a human-generated translation or other human intervention.
[0035] An example of translation application 112 is described in U.S. patent application Ser. No. 12/572,021, entitled “Providing Machine-Generated Translation and Corresponding Trust Levels,” which was filed on Oct. 1, 2009, and is incorporated herein by reference in its entirety.
[0036] The interaction between the translation service provided by application server 110 and network server 120, a customer requesting a translation, and users providing crowd source translation is discussed in more detail with respect to FIGS. 3-6 and may be summarized as follows. A translation project may be communicated to translation application 112, for example by customer 142 using customer computing device 140 to define a project through translation application 112. The details of the translation job may be provided by customer computing device 140 over network 130 to translation application 112, for example through a web page provided by translation application 112. Once the project configuration is completed, information regarding translation jobs consisting of one or more portions of the translation project may be transmitted to selected network service modules embedded in network services. Selected users who wish to perform the translation jobs are paired with the jobs by network service modules which receive job information. Users obtain access to the content to be translated and either complete a translation or do not complete a translation under a specified set of criteria. A trust score may be generated based on the translation, or failure to complete a translation. A user translation profile may also be updated. The translation is reported to a content destination server and feedback regarding a translation is provided to the translating user.
[0037] FIG. 3 is a flow chart of an exemplary method for providing a trusted translation. The method of FIG. 3 may be performed by portions of system 100 in the system of FIG. 1 . First, a translation request is received at step 310. The request may be received by application server 110 from a customer with documents to be translated. For example, the translation may be received through an interface such as a web page interface provided by translation application 112 over network 130.
[0038] A list of human and automated translation options may be provided at step 320. The list of translation options may be provided through an interface provided by translation application 112. The options may allow the customer to select between a fully automated translation, a machine translation with post-editing performed by a human, crowd source generated translation (non-professional human translation), and professional human translation for converting documents in a source language to documents in a target language.
[0039] A selection of a translation option is received from a customer at step 330. Hence, a single translation service provided by the present technology allows a user to select any of several translation methods. The selection may be received through an interface provided by translation application 112. The translation is generated and provided per the customer request at step 340. If selected, the professional translation may be performed by a professional translator as requested by a customer. A requested machine translation may be performed by translation engine 215 of translation application 112. A machine translation with a post-edits may be performed in the same way, however a human may review the translation provided by translation engine 215. A crowd source application may be provided by users registered with an end point application embedded in a network service. Crowd source translation is discussed in more detail below with respect to FIGS. 4-6 .
[0040] For each translation provided by the present technology, whether by human translation or machine translation, a trust score may be predicted for the translation. Hence, whether the translation is generated by a user, by machine translation, or a combination of these, the present technology may generate a trust score to predict a trust level of the resulting translation. The trust score may be generated by quality prediction engine 220 as discussed above.
[0041] At step 330 in the method of FIG. 3 , a customer may indicate that a translation should be performed by crowd sourcing. In this case, a customer may provide details to configure parameters associated with the crowd sourced translation by one or more nonprofessional translators. The method of FIG. 4 outlines an exemplary method for allowing a customer to configure a translation to be performed by multiple nonprofessional translators (i.e., via crowd sourcing).
[0042] FIG. 4 is a flow chart of an exemplary method for providing a trusted human translation. The method of FIG. 4 provides more detail for step 340 in the method of FIG. 3 , for example when a customer requests a translation generated via crowd sourcing. The method of FIG. 4 provides exemplary steps for configuring parameters for a crowd-sourced translation project. Configuration of such a translation project may include the steps of FIG. 4 , fewer steps, and additional configuration steps.
[0043] A source language and translation language selection are received at step 410. For example, when a customer configures a translation project, the customer may indicate that the translation should be performed from an English source language to a French target language.
[0044] A crowd sourcing location selection may be received at step 420. When the source language and translation language selection is received at step 410, the present technology may determine the locations of available translators that may perform the translation. For example, the translators may be located in a particular country, a particular state, or some other location. The locations may indicate availability of users registered with an end point application and able to perform the requested translation.
[0045] A network service module selection is received at step 430. After a customer has selected the language translation pair, the customer may select types of application network service modules to publish translation job information. Types of network service module may correspond to the network service application in which the network service module operates. Examples of a network service module types may include a Facebook network service module, Linked-In network service module, Pro-Z network service module, Second Life network service module. Human translation module 116 may maintain a table or list of network service module types which correspond to a particular language pair, location, and other data. The table or list may be updated upon receiving user registration details from a network service module at a particular network service application.
[0046] Translation parameters may be received at step 440. The translation parameters may include general translation parameters and end point specific parameters. For example, translation parameters may include a message to send to potential translator users, whether or not to enable e-mail notification of available translation jobs by a network service module, and whether or not to post available translation jobs to a module content page. Additional translation parameters may include payment terms, currency, type of reward to receive, and other compensation information. For example, the compensation for translation may include cash, virtual goods having value within the application, rewards, a thank you button, gift vouchers, and other items of real or virtual value. The compensation for a translation may vary per end point value. Additional translation parameters may include a project budget and project timing information, such as for example a time limit and maximum budget for which to spend on the particular translation. Other project-related items such as review and recurrence may also be configured as a translation parameter.
[0047] A translation may be processed at step 450. Processing a translation may include sending translation notification information to a network service module, selection of one or more users to perform the translation by the network service module, having the selected users perform the translation, and processing the translation by application server 110. Trust scores may be generated for translations performed by users. Processing a translation is discussed in more detail below with respect to the methods of FIGS. 5 and 6 . FIG. 5 describes processing a translation from the point of view of application server 110, and FIG. 6 describes processing a translation from the point of view of a network service module.
[0048] FIG. 5 is a flow chart of an exemplary method for providing a translation. The method of FIG. 5 provides more detail for step 450 of the method of FIG. 4 from the context of translation application 112.
[0049] First, content to be translated is identified at step 510. The content to be translated may be a document which is accessed from a remote location. The document to be translated may also be identified based on the location of the content rather than retrieving the content itself. The identification may include receiving the location of the content, or the content itself, by translation application 112.
[0050] A new content notification is transmitted by application server 110 to network service modules at step 520. The new content notification is an indication of one or more translation jobs. A new content notification may include a customer message for a user, a location and/or a link to the content to be translated and information to enable a network service module select a translator, such as a classification of the document content to be translated. The network service modules selected at step 430 may receive the new content notification.
[0051] Source content to be translated is provided to selected users by application server 110 at step 530. A network service module may receive the content notification sent at step 520, provide the information to one or more users, receive indications from one or more users interested in performing a translation, selecting one or more users to perform the translation, and provide the selected users with job information for accessing the content from application server 110. The job information regarding the content to translate may include application server contact information or other information to provide the user with access to the content to be translated. In some embodiments, a user may be provided with a link to an interface (provided by translation application 112) provided by application server 110 which provides the content to be translated.
[0052] The translation or detection of a no-translation event is received at step 540. Once a selected user completes a translation job, the user may indicate this to the application server, for example, through an interface in which the translation is being provided. If the translation is not completed within a certain amount of time, or for some other reason a user fails to complete a translation, a detect no-translation event is triggered. The no-translation event indicates the user failed to complete a translation of the content. The detect no-translation event may be associated with an expiration of a period of time (for example, a maximum allowed time in which to complete the translation), a cancellation of the translation by the user, or some other event. Upon detecting a no-translation event, the translation job will be re-sent to the selected network service modules to reassign the translation job.
[0053] A trust level prediction of the human translation provided by the user is generated at step 550. Quality prediction engine 220 may generate the trust score based on the translation provided by the user. If a selected user does not complete a translation, the trust level prediction is not generated.
[0054] The user translation record is updated at step 560. The user translation record may reflect a user's predicted trust score, translations not completed, customer feedback on user translations, and other data. For example, user trust levels may be averaged to generate an overall score. The user's failure to complete a translation may reduce the overall score. In some embodiments, the higher the level of accuracy and the more consistently a user completes a translation, the better the translation overall score.
[0055] The complete translation is provided to a destination server at step 570. In some embodiments, the translation may be provided by translation application 112 to content destination server 190. The translation provided may be based on the predicted trust level score determined at step 550 (i.e., the translation may be provided only if the predicted trust level meets a minimum threshold level, for example 95%).
[0056] The translation predicted trust score may be reported at step 580. The predicted trust score may be reported to the user to inform the user of their translation quality. Overall score information may also be provided to the user. The predicted trust score and/or overall score may also be provided to the network service module to enable the module to select the most qualified interested users for future translation jobs.
[0057] FIG. 6 is a flow chart of an exemplary embodiment for handling a translation job. The method of FIG. 6 may be performed by a network service module within an application, such as for example network service module 174 within application 172.
[0058] A user registers with a network service module at step 610. To register with a network service module, the user may first register with an application 172 which network service module 174 is embedded within or communicates with. Once registered with application 172, or having an account with application 172, a user may register with a network service module associated with the application. Registration with a network service module may include providing a user name, contact information, e-mail, translation skills (e.g., languages able to perform translations in), indication of other network service modules in which the user is registered, and other information.
[0059] A new translation job notification may be received by a network service module from translation application 112 at step 620. The information received for a new translation job may be the same information sent by translation application 112 at step 520 in the method of FIG. 5 . The notification may include, for example, a message from a customer to prospective user translators, language pair information, a location for a user to access content to be translated, and other data.
[0060] New job notifications are reported by a network service module to registered users at step 630. The new job notification may be reported to users registered with the particular network service module that receives the new translation job notification. The reporting may be made by e-mail, message notification, or some other communication sent by a network service module to a registered user. The notification may also be made by reporting the new job notification data to a page associated with the network service module within the application in which it is embedded, such as for example a bulletin board, content page, favorites page, or some other location.
[0061] A request may be received from one or more registered users by a network service module to perform a translation job at step 640. The translation job information is provided to one or more selected users at step 650. The users selected to perform the translation may by the requesting users which have the highest overall score, the first users to reply to the job notification, or may be selected in some other manner. The translation job information provided to the user may include a link with additional information to start the translation job. When a user selects the link to access the content to be translated, translation application 112 may receive this request as discussed above with respect to step 530 in the method of FIG. 5 . The user may then access the content to be translated and provide a translation. If the user does not complete the translation within a specified period of time, a no-translation event may be triggered and the translation job may be reported by an end-point module at step 630.
[0062] FIG. 7 is a flow chart of a computing device for implementing the present technology. In some embodiments, the system of FIG. 7 may be used to implement application server 110, network server 120, computing devices 140, 150 and 160, network service servers 170 and 180, and content destination server 190. The computing system 700 (also referred to as computer system 700) includes one or more processors 710 and main memory 720. Main memory 720 stores, in part, instructions and data for execution by processor 710. Main memory 720 can store the executable code when in operation. The computing system 700 further includes a mass storage device 730, portable storage medium drive(s) 740 (also referred to as portable storage device 740), output devices 750, user input devices 760, a graphics display 770 (also referred to as display system 770), and peripheral device(s) 780.
[0063] The components shown in FIG. 7 are depicted as being connected via a single bus 790. The components may be connected through one or more data transport means. The processor 710 and the main memory 720 may be connected via a local microprocessor bus, and the mass storage device 730, the peripheral devices 780, the portable storage medium drive(s) 740, and display system 770 may be connected via one or more input/output (I/O) buses.
[0064] The mass storage device 730, which may be implemented with a magnetic disk drive or an optical disk drive, is a non-volatile storage device for storing data and instructions for use by the processor 710. The mass storage device 730 can store the system software for implementing embodiments of the present technology for purposes of loading that software into the main memory 720.
[0065] The portable storage device 740 operates in conjunction with a portable non-volatile storage medium, such as a floppy disk, compact disk, digital video disc, or USB storage device, to input and output data and code to and from the computer system 700 of FIG. 7 . The system software for implementing embodiments of the present technology may be stored on such a portable medium and input to the computer system 700 via the portable storage device 740.
[0066] The input devices 760 provide a portion of a user interface. The input devices 760 may include an alpha-numeric keypad, such as a keyboard, for inputting alpha-numeric and other information, or a pointing device, such as a mouse, a trackball, stylus, or cursor direction keys. Additionally, the computing system 700 as shown in FIG. 7 includes the output devices 750. Suitable output devices include speakers, printers, network interfaces, and monitors.
[0067] The display system 770 may include a liquid crystal display (LCD) or other suitable display device. The display system 770 receives textual and graphical information, and processes the information for output to the display device.
[0068] The peripheral device(s) 780 may include any type of computer support device to add additional functionality to the computer system. The peripheral device(s) 780 may include a modem or a router.
[0069] The components contained in the computer system 700 of FIG. 7 are those typically found in computer systems that may be suitable for use with embodiments of the present technology and are intended to represent a broad category of such computer components that are well known in the art. Thus, the computer system 700 of FIG. 7 can be a personal computer, hand held computing device, telephone, mobile computing device, workstation, server, minicomputer, mainframe computer, or any other computing device. The computer can also include different bus configurations, networked platforms, multi-processor platforms, etc. Various operating systems can be used including Unix, Linux, Windows, Macintosh OS, Palm OS, webOS, Android, iPhone OS and other suitable operating systems.
[0070] It is noteworthy that any hardware platform suitable for performing the processing described herein is suitable for use with the technology. Computer-readable storage media refer to any medium or media that participate in providing instructions to a central processing unit (CPU), a processor, a microcontroller, or the like. Such media can take forms including, but not limited to, non-volatile and volatile media such as optical or magnetic disks and dynamic memory, respectively. Common forms of computer-readable storage media include a floppy disk, a flexible disk, a hard disk, magnetic tape, any other magnetic storage medium, a CD-ROM disk, digital video disk (DVD), any other optical storage medium, RAM, PROM, EPROM, a FLASHEPROM, any other memory chip or cartridge.
[0071] Various forms of transmission media may be involved in carrying one or more sequences of one or more instructions to a CPU for execution. A bus carries the data to system RAM, from which a CPU retrieves and executes the instructions. The instructions received by system RAM can optionally be stored on a fixed disk either before or after execution by a CPU.
[0072] While various embodiments have been described above, it should be understood that they have been presented by way of example only, and not limitation. The descriptions are not intended to limit the scope of the technology to the particular forms set forth herein. Thus, the breadth and scope of a preferred embodiment should not be limited by any of the above-described exemplary embodiments. It should be understood that the above description is illustrative and not restrictive. To the contrary, the present descriptions are intended to cover such alternatives, modifications, and equivalents as may be included within the spirit and scope of the technology as defined by the appended claims and otherwise appreciated by one of ordinary skill in the art. The scope of the technology should, therefore, be determined not with reference to the above description, but instead should be determined with reference to the appended claims along with their full scope of equivalents.
Claims
What is claimed is:
1. A method for providing a trusted translation, comprising:
receiving a human-generated translation of a document from a source language to a target language, the human-generated translation being produced by a person;
generating a trust level prediction of the human-generated translation based at least in part on a mapping by executing a quality-prediction engine stored in memory, the trust level prediction of the human-generated translation associated with translational accuracy of the human-generated translation, the quality-prediction engine being calibrated, the calibration including:
obtaining a plurality of opinions for a plurality of sample translations performed by the person, each of the opinions from a human and indicating a perceived trust level of corresponding sample translations, and
using the quality prediction-engine to determine a trust level of each of the plurality of sample translations,
determining a relationship between the plurality of opinions and the trust levels of each of the plurality of sample translations, and
tuning the mapping to minimize any difference between the plurality of opinions and the trust levels of each of the plurality of sample translations; and
outputting the human-generated translation and the trust level prediction of the human-generated translation.
2. The method of claim 1, further comprising providing an interface configured to receive a translation selection of one of a plurality of translation methods, the plurality of translation methods including both a human translation method and a machine translation method.
3. The method of claim 1, wherein outputting includes reporting information based on the trust level prediction to a user that generated the translation.
4. The method of claim 1, wherein outputting includes reporting information based on the trust level prediction to a module executing within a remote application.
5. The method of claim 1, further comprising transmitting translation information to a module executing within a remote application.
6. The method of claim 5, wherein the translation information includes a description of the translation to be performed.
7. The method of claim 5, wherein the translation information includes information for initiating access to the content to be translated.
8. The method of claim 1, further comprising receiving configuration information for a translation to be performed by humans.
9. The method of claim 8, wherein the configuration information includes a selection of one or more modules from a plurality of modules within one or more remote applications.
10. The method of claim 9, wherein the remote applications are network service applications executing on remote application servers.
11. A non-transitory computer readable storage medium having embodied thereon a program, the program being executable by a processor to perform a method for providing a trusted translation, the method comprising:
receiving a human-generated translation of a document from a source language to a target language, the human-generated translation being produced by a person;
generating a trust level prediction of the human-generated translation based at least in part on a mapping, the trust level associated with translational accuracy of the human-generated translation;
calibrating, the calibrating including:
obtaining a plurality of opinions for a plurality of sample translations performed by the person, each of the opinions from a human and indicating a perceived trust level of corresponding sample translations, and
using the quality prediction-engine to determine a trust level of each of the plurality of sample translations,
determining a relationship between the plurality of opinions and the trust levels of each of the plurality of sample translations, and
tuning the mapping to minimize any difference between the plurality of opinions and the trust levels of each of the plurality of sample translations; and
outputting the human-generated translation and the trust level prediction of the human-generated translation.
12. The non-transitory computer readable storage medium of claim 11, the method further comprising providing an interface configured to receive a translation selection of one of a plurality of translation methods, the plurality of translation methods including both a human translation method and a machine translation method.
13. The non-transitory computer readable storage medium of claim 11, wherein outputting includes reporting information based on the trust level prediction to a user that generated the translation.
14. The non-transitory computer readable storage medium of claim 11, wherein outputting includes reporting information based on the trust level prediction to a module executing within a remote application.
15. The non-transitory computer readable storage medium of claim 11, the method further comprising transmitting translation information to a module executing within a remote application.
16. The non-transitory computer readable storage medium of claim 15, wherein the translation information includes a description of the translation to be performed.
17. The non-transitory computer readable storage medium of claim 15, wherein the translation information includes information for initiating access to the content to be translated.
18. The non-transitory computer readable storage medium of claim 11, the method further comprising receiving configuration information for a translation to be performed by humans.
19. The non-transitory computer readable storage medium of claim 18, wherein the configuration information includes a selection of one or more modules from a plurality of modules within one or more remote applications.
20. The non-transitory computer readable storage medium of claim 19, wherein the remote applications are network service applications executing on remote application servers.
21. The method of claim 1, further comprising:
receiving user information from a user having an account with a network service by executing a network service module stored in memory;
receiving translation job information from a remote application by the network service module; and
providing the translation job information to the user.
22. The method of claim 21, wherein the user information includes user translation information.
23. The method of claim 21, wherein receiving user information includes registering the user with the network service module.
24. The method of claim 21, further comprising communicating the translation job information to users of the network service for which user information was received.
25. The method of claim 21, further comprising receiving a request from one or more users to perform the translation by the network service module.
26. The method of claim 21, further comprising selecting one or more users to perform the translation by the network service module.
27. The method of claim 21, further comprising receiving trust score information regarding a translation performed by a user.
Patent Citations (368)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4502128(A) | 1985-02-01 | Okajima et al. | Applicant |
| US4599691(A) | 1986-07-01 | Sakaki et al. | Applicant |
| US4615002(A) | 1986-09-01 | Innes | Applicant |
| US4661924(A) | 1987-04-01 | Okamoto et al. | Applicant |
| US4787038(A) | 1988-11-01 | Doi et al. | Applicant |
| US4791587(A) | 1988-12-01 | Doi | Applicant |
| US4800522(A) | 1989-01-01 | Miyao et al. | Applicant |
| US4814987(A) | 1989-03-01 | Miyao et al. | Applicant |
| US4942526(A) | 1990-07-01 | Okajima et al. | Applicant |
| US4980829(A) | 1990-12-01 | Okajima et al. | Applicant |
| US5020112(A) | 1991-05-01 | Chou | Applicant |
| US5088038(A) | 1992-02-01 | Tanaka et al. | Applicant |
| US5091876(A) | 1992-02-01 | Kumano et al. | Applicant |
| US5146405(A) | 1992-09-01 | Church | Applicant |
| US5167504(A) | 1992-12-01 | Mann | Applicant |
| US5181163(A) | 1993-01-01 | Nakajima et al. | Applicant |
| US5212730(A) | 1993-05-01 | Wheatley et al. | Applicant |
| US5218537(A) | 1993-06-01 | Hemphill et al. | Applicant |
| US5220503(A) | 1993-06-01 | Suzuki et al. | Applicant |
| US5267156(A) | 1993-11-01 | Nomiyama | Applicant |
| US5268839(A) | 1993-12-01 | Kaji | Applicant |
| US5295068(A) | 1994-03-01 | Nishino et al. | Applicant |
| US5302132(A) | 1994-04-01 | Corder | Applicant |
| US5311429(A) | 1994-05-01 | Tominaga | Applicant |
| US5387104(A) | 1995-02-01 | Corder | Applicant |
| US5408410(A) | 1995-04-01 | Kaji | Applicant |
| US5432948(A) | 1995-07-01 | Davis et al. | Applicant |
| US5442546(A) | 1995-08-01 | Kaji et al. | Applicant |
| US5477450(A) | 1995-12-01 | Takeda et al. | Applicant |
| US5477451(A) | 1995-12-01 | Brown et al. | Applicant |
| US5495413(A) | 1996-02-01 | Kutsumi et al. | Applicant |
| US5497319(A) | 1996-03-01 | Chong et al. | Applicant |
| US5510981(A) | 1996-04-01 | Berger et al. | Applicant |
| US5528491(A) | 1996-06-01 | Kuno et al. | Applicant |
| US5535120(A) | 1996-07-01 | Chong et al. | Applicant |
| US5541836(A) | 1996-07-01 | Church et al. | Applicant |
| US5541837(A) | 1996-07-01 | Fushimoto | Applicant |
| US5548508(A) | 1996-08-01 | Nagami | Applicant |
| US5644774(A) | 1997-07-01 | Fukumochi et al. | Applicant |
| US5675815(A) | 1997-10-01 | Yamauchi et al. | Applicant |
| US5687383(A) | 1997-11-01 | Nakayama et al. | Applicant |
| US5696980(A) | 1997-12-01 | Brew | Applicant |
| US5724593(A) | 1998-03-01 | Hargrave, III et al. | Applicant |
| US5752052(A) | 1998-05-01 | Richardson et al. | Applicant |
| US5754972(A) | 1998-05-01 | Baker et al. | Applicant |
| US5761631(A) | 1998-06-01 | Nasukawa | Applicant |
| US5761689(A) | 1998-06-01 | Rayson et al. | Applicant |
| US5768603(A) | 1998-06-01 | Brown et al. | Applicant |
| US5779486(A) | 1998-07-01 | Ho et al. | Applicant |
| US5781884(A) | 1998-07-01 | Pereira et al. | Applicant |
| US5794178(A) | 1998-08-01 | Caid et al. | Applicant |
| US5805832(A) | 1998-09-01 | Brown et al. | Applicant |
| US5806032(A) | 1998-09-01 | Sproat | Applicant |
| US5819265(A) | 1998-10-01 | Ravin et al. | Applicant |
| US5826219(A) | 1998-10-01 | Kutsumi | Applicant |
| US5826220(A) | 1998-10-01 | Takeda et al. | Applicant |
| US5845143(A) | 1998-12-01 | Yamauchi et al. | Applicant |
| US5848385(A) | 1998-12-01 | Poznanski et al. | Applicant |
| US5848386(A) | 1998-12-01 | Motoyama | Applicant |
| US5855015(A) | 1998-12-01 | Shoham | Applicant |
| US5864788(A) | 1999-01-01 | Kutsumi | Applicant |
| US5867811(A) | 1999-02-01 | O'Donoghue | Applicant |
| US5870706(A) | 1999-02-01 | Alshawi | Applicant |
| US5893134(A) | 1999-04-01 | O'Donoghue et al. | Applicant |
| US5903858(A) | 1999-05-01 | Saraki | Applicant |
| US5907821(A) | 1999-05-01 | Kaji et al. | Applicant |
| US5909681(A) | 1999-06-01 | Passera et al. | Applicant |
| US5930746(A) | 1999-07-01 | Ting | Applicant |
| US5966685(A) | 1999-10-01 | Flanagan et al. | Applicant |
| US5966686(A) | 1999-10-01 | Heidorn et al. | Applicant |
| US5983169(A) | 1999-11-01 | Kozma | Applicant |
| US5987402(A) | 1999-11-01 | Murata et al. | Applicant |
| US5987404(A) | 1999-11-01 | Della Pietra et al. | Applicant |
| US5991710(A) | 1999-11-01 | Papineni et al. | Applicant |
| US5995922(A) | 1999-11-01 | Penteroudakis et al. | Applicant |
| US6018617(A) | 2000-01-01 | Sweitzer et al. | Applicant |
| US6031984(A) | 2000-02-01 | Walser | Applicant |
| US6032111(A) | 2000-02-01 | Mohri | Applicant |
| US6047252(A) | 2000-04-01 | Kumano et al. | Applicant |
| US6064819(A) | 2000-05-01 | Franssen et al. | Applicant |
| US6064951(A) | 2000-05-01 | Park et al. | Applicant |
| US6073143(A) | 2000-06-01 | Nishikawa et al. | Applicant |
| US6077085(A) | 2000-06-01 | Parry et al. | Applicant |
| US6092034(A) | 2000-07-01 | McCarley et al. | Applicant |
| US6119077(A) | 2000-09-01 | Shinozaki | Applicant |
| US6131082(A) | 2000-10-01 | Hargrave, III et al. | Applicant |
| US6161082(A) | 2000-12-01 | Goldberg et al. | Applicant |
| US6182014(B1) | 2001-01-01 | Kenyon et al. | Applicant |
| US6182027(B1) | 2001-01-01 | Nasukawa et al. | Applicant |
| US6205456(B1) | 2001-03-01 | Nakao | Applicant |
| US6206700(B1) | 2001-03-01 | Brown et al. | Applicant |
| US6223150(B1) | 2001-04-01 | Duan et al. | Applicant |
| US6233544(B1) | 2001-05-01 | Alshawi | Applicant |
| US6233545(B1) | 2001-05-01 | Datig | Applicant |
| US6233546(B1) | 2001-05-01 | Datig | Applicant |
| US6236958(B1) | 2001-05-01 | Lange et al. | Applicant |
| US6269351(B1) | 2001-07-01 | Black | Applicant |
| US6275789(B1) | 2001-08-01 | Moser et al. | Applicant |
| US6278967(B1) | 2001-08-01 | Akers et al. | Applicant |
| US6278969(B1) | 2001-08-01 | King et al. | Applicant |
| US6285978(B1) | 2001-09-01 | Bernth et al. | Applicant |
| US6289302(B1) | 2001-09-01 | Kuo | Applicant |
| US6304841(B1) | 2001-10-01 | Berger et al. | Applicant |
| US6311152(B1) | 2001-10-01 | Bai et al. | Applicant |
| US6317708(B1) | 2001-11-01 | Witbrock et al. | Applicant |
| US6327568(B1) | 2001-12-01 | Joost | Applicant |
| US6330529(B1) | 2001-12-01 | Ito | Applicant |
| US6330530(B1) | 2001-12-01 | Horiguchi et al. | Applicant |
| US6356864(B1) | 2002-03-01 | Foltz et al. | Applicant |
| US6360196(B1) | 2002-03-01 | Poznanski et al. | Applicant |
| US6389387(B1) | 2002-05-01 | Poznanski et al. | Applicant |
| US6393388(B1) | 2002-05-01 | Franz et al. | Applicant |
| US6393389(B1) | 2002-05-01 | Chanod et al. | Applicant |
| US6415250(B1) | 2002-07-01 | van den Akker | Applicant |
| US6460015(B1) | 2002-10-01 | Hetherington et al. | Applicant |
| US6470306(B1) | 2002-10-01 | Pringle et al. | Applicant |
| US6473729(B1) | 2002-10-01 | Gastaldo et al. | Applicant |
| US6480698(B2) | 2002-11-01 | Ho et al. | Applicant |
| US6490549(B1) | 2002-12-01 | Ulicny et al. | Applicant |
| US6498921(B1) | 2002-12-01 | Ho et al. | Applicant |
| US6502064(B1) | 2002-12-01 | Miyahira et al. | Applicant |
| US6529865(B1) | 2003-03-01 | Duan et al. | Applicant |
| US6535842(B1) | 2003-03-01 | Roche et al. | Applicant |
| US6587844(B1) | 2003-07-01 | Mohri | Applicant |
| US6609087(B1) | 2003-08-01 | Miller et al. | Applicant |
| US6647364(B1) | 2003-11-01 | Yumura et al. | Applicant |
| US6691279(B2) | 2004-02-01 | Yoden et al. | Applicant |
| US6745161(B1) | 2004-06-01 | Arnold et al. | Applicant |
| US6745176(B2) | 2004-06-01 | Probert, Jr. et al. | Applicant |
| US6757646(B2) | 2004-06-01 | Marchisio | Applicant |
| US6778949(B2) | 2004-08-01 | Duan et al. | Applicant |
| US6782356(B1) | 2004-08-01 | Lopke | Applicant |
| US6810374(B2) | 2004-10-01 | Kang | Applicant |
| US6848080(B1) | 2005-01-01 | Lee et al. | Applicant |
| US6857022(B1) | 2005-02-01 | Scanlan | Applicant |
| US6885985(B2) | 2005-04-01 | Hull | Applicant |
| US6901361(B1) | 2005-05-01 | Portilla | Applicant |
| US6904402(B1) | 2005-06-01 | Wang et al. | Applicant |
| US6952665(B1) | 2005-10-01 | Shimomura et al. | Applicant |
| US6983239(B1) | 2006-01-01 | Epstein | Applicant |
| US6996518(B2) | 2006-02-01 | Jones et al. | Applicant |
| US6996520(B2) | 2006-02-01 | Levin | Applicant |
| US6999925(B2) | 2006-02-01 | Fischer et al. | Applicant |
| US7013262(B2) | 2006-03-01 | Tokuda et al. | Applicant |
| US7016827(B1) | 2006-03-01 | Ramaswamy et al. | Applicant |
| US7016977(B1) | 2006-03-01 | Dunsmoir et al. | Applicant |
| US7024351(B2) | 2006-04-01 | Wang | Applicant |
| US7031911(B2) | 2006-04-01 | Zhou et al. | Applicant |
| US7050964(B2) | 2006-05-01 | Menzes et al. | Applicant |
| US7085708(B2) | 2006-08-01 | Manson | Applicant |
| US7089493(B2) | 2006-08-01 | Hatori et al. | Applicant |
| US7103531(B2) | 2006-09-01 | Moore | Applicant |
| US7107204(B1) | 2006-09-01 | Liu et al. | Applicant |
| US7107215(B2) | 2006-09-01 | Ghali | Applicant |
| US7113903(B1) | 2006-09-01 | Riccardi et al. | Applicant |
| US7143036(B2) | 2006-11-01 | Weise | Applicant |
| US7146358(B1) | 2006-12-01 | Gravano et al. | Applicant |
| US7149688(B2) | 2006-12-01 | Schalkwyk | Applicant |
| US7171348(B2) | 2007-01-01 | Scanlan | Applicant |
| US7174289(B2) | 2007-02-01 | Sukehiro | Applicant |
| US7177792(B2) | 2007-02-01 | Knight et al. | Applicant |
| US7191115(B2) | 2007-03-01 | Moore | Applicant |
| US7194403(B2) | 2007-03-01 | Okura et al. | Applicant |
| US7197451(B1) | 2007-03-01 | Carter et al. | Applicant |
| US7206736(B2) | 2007-04-01 | Moore | Applicant |
| US7209875(B2) | 2007-04-01 | Quirk et al. | Applicant |
| US7219051(B2) | 2007-05-01 | Moore | Applicant |
| US7239998(B2) | 2007-07-01 | Xun | Applicant |
| US7249012(B2) | 2007-07-01 | Moore | Applicant |
| US7249013(B2) | 2007-07-01 | Al-Onaizan et al. | Applicant |
| US7283950(B2) | 2007-10-01 | Pournasseh et al. | Applicant |
| US7295962(B2) | 2007-11-01 | Marcu | Applicant |
| US7302392(B1) | 2007-11-01 | Thenthiruperai et al. | Applicant |
| US7319949(B2) | 2008-01-01 | Pinkham | Applicant |
| US7340388(B2) | 2008-03-01 | Soricut et al. | Applicant |
| US7346487(B2) | 2008-03-01 | Li | Applicant |
| US7346493(B2) | 2008-03-01 | Ringger et al. | Applicant |
| US7349839(B2) | 2008-03-01 | Moore | Applicant |
| US7349845(B2) | 2008-03-01 | Coffman et al. | Applicant |
| US7356457(B2) | 2008-04-01 | Pinkham et al. | Applicant |
| US7369998(B2) | 2008-05-01 | Sarich et al. | Applicant |
| US7373291(B2) | 2008-05-01 | Garst | Applicant |
| US7383542(B2) | 2008-06-01 | Richardson et al. | Applicant |
| US7389222(B1) | 2008-06-01 | Langmead et al. | Applicant |
| US7389234(B2) | 2008-06-01 | Schmid et al. | Applicant |
| US7403890(B2) | 2008-07-01 | Roushar | Applicant |
| US7409332(B2) | 2008-08-01 | Moore | Applicant |
| US7409333(B2) | 2008-08-01 | Wilkinson et al. | Applicant |
| US7447623(B2) | 2008-11-01 | Appleby | Applicant |
| US7454326(B2) | 2008-11-01 | Marcu et al. | Applicant |
| US7496497(B2) | 2009-02-01 | Liu | Applicant |
| US7533013(B2) | 2009-05-01 | Marcu | Applicant |
| US7536295(B2) | 2009-05-01 | Cancedda et al. | Applicant |
| US7546235(B2) | 2009-06-01 | Brockett et al. | Applicant |
| US7552053(B2) | 2009-06-01 | Gao et al. | Applicant |
| US7565281(B2) | 2009-07-01 | Appleby | Applicant |
| US7574347(B2) | 2009-08-01 | Wang | Applicant |
| US7580830(B2) | 2009-08-01 | Al-Onaizan et al. | Applicant |
| US7587307(B2) | 2009-09-01 | Cancedda et al. | Applicant |
| US7620538(B2) | 2009-11-01 | Marcu et al. | Applicant |
| US7620632(B2) | 2009-11-01 | Andrews | Applicant |
| US7624005(B2) | 2009-11-01 | Koehn et al. | Applicant |
| US7624020(B2) | 2009-11-01 | Yamada et al. | Applicant |
| US7627479(B2) | 2009-12-01 | Travieso et al. | Applicant |
| US7680646(B2) | 2010-03-01 | Lux-Pogodalla et al. | Applicant |
| US7689405(B2) | 2010-03-01 | Marcu | Applicant |
| US7698124(B2) | 2010-04-01 | Menezes et al. | Applicant |
| US7698125(B2) | 2010-04-01 | Graehl et al. | Applicant |
| US7707025(B2) | 2010-04-01 | Whitelock | Applicant |
| US7711545(B2) | 2010-05-01 | Koehn | Applicant |
| US7716037(B2) | 2010-05-01 | Precoda et al. | Applicant |
| US7813918(B2) | 2010-10-01 | Muslea et al. | Applicant |
| US7822596(B2) | 2010-10-01 | Elgazzar et al. | Applicant |
| US7925494(B2) | 2011-04-01 | Cheng et al. | Applicant |
| US7957953(B2) | 2011-06-01 | Moore | Applicant |
| US7974833(B2) | 2011-07-01 | Soricut et al. | Applicant |
| US8060360(B2) | 2011-11-01 | He | Applicant |
| US8145472(B2) | 2012-03-01 | Shore et al. | Examiner |
| US8214196(B2) | 2012-07-01 | Yamada et al. | Applicant |
| US8244519(B2) | 2012-08-01 | Bicici et al. | Applicant |
| US8265923(B2) | 2012-09-01 | Chatterjee et al. | Applicant |
| US8615389(B1) | 2013-12-01 | Marcu | Applicant |
| US2001/0009009(A1) | 2001-07-01 | Iizuka | Applicant |
| US2001/0029455(A1) | 2001-10-01 | Chin et al. | Applicant |
| US2002/0002451(A1) | 2002-01-01 | Sukehiro | Applicant |
| US2002/0013693(A1) | 2002-01-01 | Fuji | Applicant |
| US2002/0040292(A1) | 2002-04-01 | Marcu | Applicant |
| US2002/0046018(A1) | 2002-04-01 | Marcu et al. | Applicant |
| US2002/0046262(A1) | 2002-04-01 | Heilig et al. | Applicant |
| US2002/0059566(A1) | 2002-05-01 | Delcambre et al. | Applicant |
| US2002/0078091(A1) | 2002-06-01 | Vu et al. | Applicant |
| US2002/0087313(A1) | 2002-07-01 | Lee et al. | Applicant |
| US2002/0099744(A1) | 2002-07-01 | Coden et al. | Applicant |
| US2002/0111788(A1) | 2002-08-01 | Kimpara | Applicant |
| US2002/0111789(A1) | 2002-08-01 | Hull | Applicant |
| US2002/0111967(A1) | 2002-08-01 | Nagase | Applicant |
| US2002/0143537(A1) | 2002-10-01 | Ozawa et al. | Applicant |
| US2002/0152063(A1) | 2002-10-01 | Tokieda et al. | Applicant |
| US2002/0169592(A1) | 2002-11-01 | Aityan | Applicant |
| US2002/0188438(A1) | 2002-12-01 | Knight et al. | Applicant |
| US2002/0188439(A1) | 2002-12-01 | Marcu | Applicant |
| US2002/0198699(A1) | 2002-12-01 | Greene et al. | Examiner |
| US2002/0198701(A1) | 2002-12-01 | Moore | Applicant |
| US2002/0198713(A1) | 2002-12-01 | Franz et al. | Applicant |
| US2003/0009322(A1) | 2003-01-01 | Marcu | Applicant |
| US2003/0023423(A1) | 2003-01-01 | Yamada et al. | Applicant |
| US2003/0144832(A1) | 2003-07-01 | Harris | Applicant |
| US2003/0154071(A1) | 2003-08-01 | Shreve | Applicant |
| US2003/0158723(A1) | 2003-08-01 | Masuichi et al. | Applicant |
| US2003/0176995(A1) | 2003-09-01 | Sukehiro | Applicant |
| US2003/0182102(A1) | 2003-09-01 | Corston-Oliver et al. | Applicant |
| US2003/0191626(A1) | 2003-10-01 | Al-Onaizan et al. | Applicant |
| US2003/0204400(A1) | 2003-10-01 | Marcu et al. | Applicant |
| US2003/0216905(A1) | 2003-11-01 | Chelba et al. | Applicant |
| US2003/0217052(A1) | 2003-11-01 | Rubenczyk et al. | Applicant |
| US2003/0233222(A1) | 2003-12-01 | Soricut et al. | Applicant |
| US2004/0006560(A1) | 2004-01-01 | Chan et al. | Applicant |
| US2004/0015342(A1) | 2004-01-01 | Garst | Applicant |
| US2004/0024581(A1) | 2004-02-01 | Koehn et al. | Applicant |
| US2004/0030551(A1) | 2004-02-01 | Marcu et al. | Applicant |
| US2004/0035055(A1) | 2004-02-01 | Zhu et al. | Applicant |
| US2004/0044530(A1) | 2004-03-01 | Moore | Applicant |
| US2004/0059708(A1) | 2004-03-01 | Dean et al. | Applicant |
| US2004/0068411(A1) | 2004-04-01 | Scanlan | Applicant |
| US2004/0098247(A1) | 2004-05-01 | Moore | Applicant |
| US2004/0102956(A1) | 2004-05-01 | Levin | Applicant |
| US2004/0102957(A1) | 2004-05-01 | Levin | Applicant |
| US2004/0111253(A1) | 2004-06-01 | Luo et al. | Applicant |
| US2004/0115597(A1) | 2004-06-01 | Butt | Applicant |
| US2004/0122656(A1) | 2004-06-01 | Abir | Applicant |
| US2004/0167768(A1) | 2004-08-01 | Travieso et al. | Applicant |
| US2004/0167784(A1) | 2004-08-01 | Travieso et al. | Applicant |
| US2004/0193401(A1) | 2004-09-01 | Ringger et al. | Applicant |
| US2004/0230418(A1) | 2004-11-01 | Kitamura | Applicant |
| US2004/0237044(A1) | 2004-11-01 | Travieso et al. | Applicant |
| US2004/0260532(A1) | 2004-12-01 | Richardson et al. | Applicant |
| US2005/0021322(A1) | 2005-01-01 | Richardson et al. | Applicant |
| US2005/0021517(A1) | 2005-01-01 | Marchisio | Applicant |
| US2005/0026131(A1) | 2005-02-01 | Elzinga et al. | Applicant |
| US2005/0033565(A1) | 2005-02-01 | Koehn | Applicant |
| US2005/0038643(A1) | 2005-02-01 | Koehn | Applicant |
| US2005/0055199(A1) | 2005-03-01 | Ryzchachkin et al. | Applicant |
| US2005/0060160(A1) | 2005-03-01 | Roh et al. | Applicant |
| US2005/0075858(A1) | 2005-04-01 | Pournasseh et al. | Applicant |
| US2005/0086226(A1) | 2005-04-01 | Krachman | Applicant |
| US2005/0102130(A1) | 2005-05-01 | Quirk et al. | Applicant |
| US2005/0125218(A1) | 2005-06-01 | Rajput et al. | Applicant |
| US2005/0149315(A1) | 2005-07-01 | Flanagan et al. | Applicant |
| US2005/0171757(A1) | 2005-08-01 | Appleby | Applicant |
| US2005/0204002(A1) | 2005-09-01 | Friend | Applicant |
| US2005/0228640(A1) | 2005-10-01 | Aue et al. | Applicant |
| US2005/0228642(A1) | 2005-10-01 | Mau et al. | Applicant |
| US2005/0228643(A1) | 2005-10-01 | Munteanu et al. | Applicant |
| US2005/0234701(A1) | 2005-10-01 | Graehl et al. | Applicant |
| US2005/0267738(A1) | 2005-12-01 | Wilkinson et al. | Applicant |
| US2006/0004563(A1) | 2006-01-01 | Campbell et al. | Applicant |
| US2006/0015320(A1) | 2006-01-01 | Och | Applicant |
| US2006/0015323(A1) | 2006-01-01 | Udupa et al. | Applicant |
| US2006/0018541(A1) | 2006-01-01 | Chelba et al. | Applicant |
| US2006/0020448(A1) | 2006-01-01 | Chelba et al. | Applicant |
| US2006/0041428(A1) | 2006-02-01 | Fritsch et al. | Applicant |
| US2006/0095248(A1) | 2006-05-01 | Menezes et al. | Applicant |
| US2006/0111891(A1) | 2006-05-01 | Menezes et al. | Applicant |
| US2006/0111892(A1) | 2006-05-01 | Menezes et al. | Applicant |
| US2006/0111896(A1) | 2006-05-01 | Menezes et al. | Applicant |
| US2006/0129424(A1) | 2006-06-01 | Chan | Applicant |
| US2006/0142995(A1) | 2006-06-01 | Knight et al. | Applicant |
| US2006/0150069(A1) | 2006-07-01 | Chang | Applicant |
| US2006/0167984(A1) | 2006-07-01 | Fellenstein et al. | Applicant |
| US2006/0190241(A1) | 2006-08-01 | Goutte et al. | Applicant |
| US2007/0016400(A1) | 2007-01-01 | Soricutt et al. | Applicant |
| US2007/0016401(A1) | 2007-01-01 | Ehsani et al. | Applicant |
| US2007/0033001(A1) | 2007-02-01 | Muslea et al. | Applicant |
| US2007/0050182(A1) | 2007-03-01 | Sneddon et al. | Applicant |
| US2007/0078654(A1) | 2007-04-01 | Moore | Applicant |
| US2007/0078845(A1) | 2007-04-01 | Scott et al. | Applicant |
| US2007/0083357(A1) | 2007-04-01 | Moore et al. | Applicant |
| US2007/0094169(A1) | 2007-04-01 | Yamada et al. | Applicant |
| US2007/0112553(A1) | 2007-05-01 | Jacobson | Applicant |
| US2007/0112555(A1) | 2007-05-01 | Lavi et al. | Applicant |
| US2007/0112556(A1) | 2007-05-01 | Lavi et al. | Applicant |
| US2007/0122792(A1) | 2007-05-01 | Galley et al. | Applicant |
| US2007/0168202(A1) | 2007-07-01 | Changela et al. | Applicant |
| US2007/0168450(A1) | 2007-07-01 | Prajapat et al. | Applicant |
| US2007/0180373(A1) | 2007-08-01 | Bauman et al. | Applicant |
| US2007/0219774(A1) | 2007-09-01 | Quirk et al. | Applicant |
| US2007/0250306(A1) | 2007-10-01 | Marcu et al. | Applicant |
| US2007/0265825(A1) | 2007-11-01 | Cancedda et al. | Applicant |
| US2007/0265826(A1) | 2007-11-01 | Chen et al. | Applicant |
| US2007/0269775(A1) | 2007-11-01 | Andreev et al. | Applicant |
| US2007/0294076(A1) | 2007-12-01 | Shore et al. | Applicant |
| US2008/0052061(A1) | 2008-02-01 | Kim et al. | Applicant |
| US2008/0065478(A1) | 2008-03-01 | Kohlmeier et al. | Applicant |
| US2008/0114583(A1) | 2008-05-01 | Al-Onaizan et al. | Applicant |
| US2008/0154581(A1) | 2008-06-01 | Lavi et al. | Applicant |
| US2008/0183555(A1) | 2008-07-01 | Walk | Applicant |
| US2008/0215418(A1) | 2008-09-01 | Kolve et al. | Applicant |
| US2008/0249760(A1) | 2008-10-01 | Marcu et al. | Applicant |
| US2008/0270109(A1) | 2008-10-01 | Och | Applicant |
| US2008/0270112(A1) | 2008-10-01 | Shimohata | Examiner |
| US2008/0281578(A1) | 2008-11-01 | Kumaran et al. | Applicant |
| US2008/0307481(A1) | 2008-12-01 | Panje | Applicant |
| US2009/0076792(A1) | 2009-03-01 | Lawson-Tancred | Applicant |
| US2009/0083023(A1) | 2009-03-01 | Foster et al. | Applicant |
| US2009/0119091(A1) | 2009-05-01 | Sarig | Applicant |
| US2009/0125497(A1) | 2009-05-01 | Jiang et al. | Applicant |
| US2009/0234634(A1) | 2009-09-01 | Chen et al. | Applicant |
| US2009/0241115(A1) | 2009-09-01 | Raffo et al. | Applicant |
| US2009/0326912(A1) | 2009-12-01 | Ueffing | Applicant |
| US2010/0017293(A1) | 2010-01-01 | Lung et al. | Applicant |
| US2010/0042398(A1) | 2010-02-01 | Marcu et al. | Applicant |
| US2010/0138213(A1) | 2010-06-01 | Bicici et al. | Applicant |
| US2010/0174524(A1) | 2010-07-01 | Koehn | Applicant |
| US2011/0029300(A1) | 2011-02-01 | Marcu et al. | Applicant |
| US2011/0066643(A1) | 2011-03-01 | Cooper et al. | Applicant |
| US2011/0082684(A1) | 2011-04-01 | Soricut et al. | Applicant |
| US2012/0323554(A1) | 2012-12-01 | Hopkins et al. | Applicant |
| EP469884 | 1992-02-01 | Applicant | |
| EP715265 | 1996-06-01 | Applicant | |
| EP933712(A2) | 1999-08-01 | Applicant | |
| EP933712(A3) | 2001-01-01 | Applicant | |
| JP7244666 | 1995-09-01 | Applicant | |
| JP10011447 | 1998-01-01 | Applicant | |
| JP11272672 | 1999-10-01 | Applicant | |
| JP2004501429 | 2004-01-01 | Applicant | |
| JP2004062726 | 2004-02-01 | Applicant | |
| JP2008101837 | 2008-05-01 | Applicant | |
| WO3083709 | 2003-10-01 | Applicant |
Non-Patent Literature (258)
- “Rapp, Reinhard, ““Identifying Word Translations in Non-Parallel Texts,”” 1995, 33rd Annual Meeting of the ACL, pp. 320-322.”Applicant
- Rayner et al.,“Hybrid Language Processing in the Spoken Language Translator,” IEEE, pp. 107-110.Applicant
- “Resnik, P. and Smith, A., ““The Web as a Parallel Corpus,”” Sep. 2003, Computational Linguistics, SpecialIssue on Web as Corpus, vol. 29, Issue 3, pp. 349-380.”Applicant
- “Resnik, P. and Yarowsky, D. ““A Perspective on Word Sense Disambiguation Methods and Their Evaluation,””1997, Proceedings of SIGLEX '97, Washington, D.C., pp. 79-86.”Applicant
- “Resnik, Philip, ““Mining the Web for Bilingual Text,””1999, 37th Annual Meeting of the ACL, College Park, MD, pp. 527-534.”Applicant
- Rich, E. And Knight, K., “Artificial Intelligence, Second Edition,” 1991, McGraw-Hill Book Company [Front Matter].Applicant
- “Richard et al., ““Visiting the Traveling Salesman Problem with Petri nets and application in the glass industry,””Feb. 1996, IEEE Emerging Technologies and Factory Automation, pp. 238-242.”Applicant
- “Robin, Jacques, ““Revision-Based Generation of Natural Language Summaries Providing Historical Background: Corpus-Based Analysis, Design Implementation and Evaluation,”” 1994, Ph.D. Thesis, Columbia University, New York.”Applicant
- Rogati et al., “Resource Selection for Domain-Specific Cross-Lingual IR,” ACM 2004, pp. 154-161.Applicant
- Zhang, R. et al., “The NiCT-ATR Statistical Machine Translation System for the IWSLT 2006 Evaluation,” submitted to IWSLT, 2006.Applicant
- “Russell, S. and Norvig, P., ““Artificial Intelligence: A Modern Approach,”” 1995, Prentice-Hall, Inc., New Jersey [Front Matter].”Applicant
- “Sang, E. and Buchholz, S., ““Introduction to the CoNLL-2000 Shared Task: Chunking,”” 2002, Proc. ofCoNLL-2000 and LLL-2000, Lisbon, Portugal, pp. 127-132.”Applicant
- Schmid, H., and Schulte im Walde, S., “Robust German Noun Chunking With a Probabilistic Context-Free Grammar,” 2000, Proc. of the 18th Conference on Computational Linguistics, vol. 2, pp. 726-732.Applicant
- “Schutze, Hinrich, ““Automatic Word Sense Discrimination,”” 1998, Computational Linguistics, Special Issue on WordSense Disambiguation, vol. 24, Issue 1, pp. 97-123.”Applicant
- “Selman et al., ““A New Method for Solving Hard Satisfiability Problems,”” 1992, Proc. of the 10th National Conferenceon Artificial Intelligence, San Jose, CA, pp. 440-446.”Applicant
- Kumar, S. and Byrne, W., “Minimum Bayes-Risk Decoding for Statistical Machine Translation.” HLTNAACL Conference. Mar. 2004, 8 pages.Applicant
- “Shapiro, Stuart (ed.), ““Encyclopedia of Artificial Intelligence, 2nd edition””, vol. D 2,1992, John Wiley & Sons Inc;““Unification”” article, K. Knight, pp. 1630-1637.”Applicant
- Shirai, S., “A Hybrid Rule and Example-based Method for Machine Translation,” NTT Communication Science Laboratories, pp. 1-5.Applicant
- “Sobashima et al., ““A Bidirectional Transfer-Driven Machine Translation System for Spoken Dialogues,”” 1994, Proc.of 15th Conference on Computational Linguistics, vol. 1, pp. 64-68.”Applicant
- “Soricut et al., ““Using a Large Monolingual Corpus to Improve Translation Accuracy,”” 2002, Lecture Notes in Computer Science, vol. 2499, Proc. of the 5th Conference of the Association for Machine Translation in theAmericas on Machine Translation: From Research to Real Users, pp. 155-164.”Applicant
- “Stalls, B. and Knight, K., ““Translating Names and Technical Terms in Arabic Text,”” 1998, Proc. of the COLING/ACL Workkshop on Computational Approaches to Semitic Language.”Applicant
- “Sumita et al., ““A Discourse Structure Analyzer for Japanese Text,”” 1992, Proc. of the International Conference onFifth Generation Computer Systems, vol. 2, pp. 1133-1140.”Applicant
- “Sun et al., ““Chinese Named Entity Identification Using Class-based Language Model,”” 2002, Proc. of 19thInternational Conference on Computational Linguistics, Taipei, Taiwan, vol. 1, pp. 1-7.”Applicant
- Tanaka, K. and Iwasaki, H. “Extraction of Lexical Translations from Non-Aligned Corpora,” Proceedings of COLING 1996.Applicant
- Taskar, B., et al., “A Discriminative Matching Approach to Word Alignment,” In Proceedings of the Conference on Human Language Technology and Empirical Methods in Natural Language Processing (Vancouver, BC, Canada, Oct. 6-8, 2005). Human Language Technology Conference. Assoc. for Computational Linguistics, Morristown, NJ.Applicant
- “Taylor et al., ““The Penn Treebank: An Overview,”” in A. Abeill (ed.), D Treebanks: Building and Using ParsedCorpora, 2003, pp. 5-22.”Applicant
- “Tiedemann, Jorg, ““Automatic Construction of Weighted String Similarity Measures,”” 1999, In Proceedings ofthe Joint SIGDAT Conference on Emperical Methods in Natural Language Processing and Very Large Corpora.”Applicant
- “Tillman, C. and Xia, F., ““A Phrase-Based Unigram Model for Statistical Machine Translation,”” 2003, Proc. of theNorth American Chapter of the ACL on Human Language Technology, vol. 2, pp. 106-108.”Applicant
- “Tillmann et al., ““A DP Based Search Using Monotone Alignments in Statistical Translation,”” 1997, Proc. of theAnnual Meeting of the ACL, pp. 366-372.”Applicant
- Tomas, J., “Binary Feature Classification for Word Disambiguation in Statistical Machine Translation,” Proceedings of the 2nd Int'l. Workshop on Pattern Recognition, 2002, pp. 1-12.Applicant
- Uchimoto, K. et al., “Word Translation by Combining Example-Based Methods and Machine Learning Models,” Natural LanguageProcessing (Shizen Gengo Shori), vol. 10, No. 3, Apr. 2003, pp. 87-114.Applicant
- Uchimoto, K. et al., “Word Translation by Combining Example-based Methods and Machine Learning Models,” Natural LanguageProcessing (Shizen Gengo Shori), vol. 10, No. 3, Apr. 2003, pp. 87-114. (English Translation).Applicant
- “Ueffing et al., ““Generation of Word Graphs in Statistical Machine Translation,”” 2002, Proc. of Empirical Methods inNatural Language Processing (EMNLP), pp. 156-163.”Applicant
- Varga et al., “Parallel Corpora for Medium Density Languages”, In Proceedings of RANLP 2005, pp. 590-596.Applicant
- “Veale, T. and Way, A., ““Gaijin: A Bootstrapping, Template-Driven Approach to Example-Based MT,”” 1997, Proc. ofNew Methods in Natural Language Processing, Sofia, Bulgaria.”Applicant
- Vogel et al., “The CMU Statistical Machine Translation System,” 2003, Machine Translation Summit IX, New Orleans, LA.Applicant
- “Vogel et al., ““The Statistical Translation Module in the Verbmobil System,”” 2000, Workshop on Multi-Lingual SpeechCommunication, pp. 69-74.”Applicant
- “Vogel, S. and Ney, H., ““Construction of a Hierarchical Translation Memory,”” 2000, Proc. of Cooling 2000, Saarbrucken, Germany, pp. 1131-1135.”Applicant
- “Wang, Y. and Waibel, A., ““Decoding Algorithm in Statistical Machine Translation,”” 1996, Proc. of the 35th AnnualMeeting of the ACL, pp. 366-372.”Applicant
- “Wang, Ye-Yi, ““Grammar Inference and Statistical Machine Translation,”” 1998, Ph.D Thesis, Carnegie MellonUniversity, Pittsburgh, PA.”Applicant
- “Watanabe et al., ““Statistical Machine Translation Based on Hierarchical Phrase Alignment,”” 2002, 9th InternationalConference on Theoretical and Methodological Issues in Machin Translation (TMI-2002), Keihanna, Japan, pp. 188-198.”Applicant
- “Witbrock, M. and Mittal, V., ““Ultra-Summarization: A Statistical Approach to Generating Highly Condensed Non-Extractive Summaries,”” 1999, Proc. of SIGIR '99, 22nd International Conference on Research and Development inInformation Retrieval, Berkeley, CA, pp. 315-316.”Applicant
- “Wu, Dekai, ““A Polynomial-Time Algorithm for Statistical Machine Translation,”” 1996, Proc. of 34th Annual Meeting ofthe ACL, pp. 152-158.”Applicant
- “Wu, Dekai, ““Stochastic Inversion Transduction Grammars and Bilingual Parsing of Parallel Corpora,”” 1997, Computational Linguistics, vol. 23, Issue 3, pp. 377-403.”Applicant
- “Yamada, K. and Knight, K. ““A Syntax-Based Statistical Translation Model,”” 2001, Proc. of the 39th AnnualMeeting of the ACL, pp. 523-530.”Applicant
- “Yamada, K. and Knight, K., ““A Decoder for Syntax-Based Statistical MT,”” 2001, Proceedings of the 40th AnnualMeeting of the ACL, pp. 303-310.”Applicant
- Yamada K., “A Syntax-Based Statistical Translation Model,” 2002 PhD Dissertation, pp. 1-141.Applicant
- “Yamamoto et al., ““A Comparative Study on Translation Units for Bilingual Lexicon Extraction,”” 2001, JapanAcademic Association for Copyright Clearance, Tokyo, Japan.”Applicant
- Yamamoto et al, “Acquisition of Phrase-level Bilingual Correspondence using Dependency Structure” In Proceedings of COLING—2000, pp. 933-939.Applicant
- “Yarowsky, David, ““Unsupervised Word Sense Disambiguation Rivaling Supervised Methods,”” 1995, 33rd AnnualMeeting of the ACL, pp. 189-196.”Applicant
- “Abney, Steven P. , ““Parsing by Chunks,”” 1991, Principle-Based Parsing: Computation and Psycholinguistics, vol. 44,pp. 257-279.”Applicant
- Agbago, A., et al., “True-casing for the Portage System,” In Recent Advances in Natural Language Processing (Borovets, Bulgaria), Sep. 21-23, 2005, pp. 21-24.Applicant
- Al-Onaizan et al., “Statistical Machine Translation,” 1999, JHU Summer Tech Workshop, Final Report, pp. 1-42.Applicant
- “Al-Onaizan et al., ““Translating with Scarce Resources,”” 2000, 17th National Conference of the American Associationfor Artificial Intelligence, Austin, TX, pp. 672-678.”Applicant
- Al-Onaizan, Y. and Knight K., “Machine Transliteration of Names in Arabic Text,”Proceedings of ACL Workshop on Computational Approaches to Semitic Languages. Philadelphia, 2002.Applicant
- “Al-Onaizan, Y. and Knight, K., ““Named Entity Translation: Extended Abstract””, 2002, Proceedings of HLT-02, SanDiego, CA.”Applicant
- “Al-Onaizan, Y. and Knight, K., ““Translating Named Entities Using Monolingual and Bilingual Resources,”” 2002, Proc. of the 40th Annual Meeting of the ACL, pp. 400-408.”Applicant
- “Alshawi et al., ““Learning Dependency Translation Models as Collections of Finite-State Head Transducers,”” 2000, Computational Linguistics, vol. 26, pp. 45-60.”Applicant
- Alshawi, Hiyan, “Head Automata for Speech Translation”, Proceedings of the ICSLP 96, 1996, Philadelphia, Pennslyvania.Applicant
- Ambati, V., “Dependency Structure Trees in Syntax Based Machine Translation,” Spring 2008 Report <http://www.cs.cmu.edu/˜vamshi/publications/DependencyMT—report.pdf>, pp. 1-8.Applicant
- “Arbabi et al., ““Algorithms for Arabic name transliteration,”” Mar. 1994, IBM Journal of Research and Development,vol. 38, Issue 2, pp. 183-194.”Applicant
- Arun, A., et al., “Edinburgh System Description for the 2006 TC-STAR Spoken Language Translation Evaluation,” in TC-STAR Workshop on Speech-to-Speech Translation (Barcelona, Spain), Jun. 2006, pp. 37-41.Applicant
- Ballesteros, L. et al., “Phrasal Translation and Query Expansion Techniques for Cross-Language Information Retrieval,” SIGIR 97, Philadelphia, PA, © 1997, pp. 84-91.Applicant
- “Bangalore, S. and Rambow, O., ““Evaluation Metrics for Generation,”” 2000, Proc. of the 1st International NaturalLanguage Generation Conf., vol. 14, pp. 1-8.”Applicant
- “Bangalore, S. and Rambow, O., ““Using TAGs, a Tree Model, and a Language Model for Generation,”” May 2000,Workshop TAG+5, Paris.”Applicant
- “Bangalore, S. and Rambow, O., ““Corpus-Based Lexical Choice in Natural Language Generation,”” 2000, Proc. ofthe 38th Annual ACL, Hong Kong, pp. 464-471.”Applicant
- “Bangalore, S. and Rambow, O., ““Exploiting a Probabilistic Hierarchical Model for Generation,”” 2000, Proc. of 18thconf. on Computational Linguistics, vol. 1, pp. 42-48.”.Applicant
- Bannard, C. and Callison-Burch, C., “Paraphrasing with Bilingual Parallel Corpora,” In Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics (Ann Arbor, MI, Jun. 25-30, 2005). Annual Meeting of the ACL Assoc. for Computational Linguistics, Morristown, NJ, 597-604. DOI=http://dx.doi.org/10.3115/1219840.Applicant
- “Barnett et al., ““Knowledge and Natural Language Processing,”” Aug. 1990, Communications of the ACM, vol. 33,Issue 8, pp. 50-71.”Applicant
- “Baum, Leonard, ““An Inequality and Associated Maximization Technique in Statistical Estimation for ProbabilisticFunctions of Markov Processes””, 1972, Inequalities 3:1-8.”Applicant
- Berhe, G. et al., “Modeling Service-based Multimedia Content Adaptation in Pervasive Computing,” CF '04 (Ischia, Italy) Apr. 14-16, 2004, pp. 60-69.Applicant
- Boitet, C. et al., “Main Research Issues in Building Web Services for Mutualized, Non-Commercial Translation,” Proc. of the 6th Symposium on Natural Language Processing, Human and Computer Processing of Language and Speech, © 2005, pp. 1-11.Applicant
- “Brants, Thorsten, ““TnT—A Statistical Part-of-Speech Tagger,”” 2000, Proc. of the 6th Applied Natural LanguageProcessing Conference, Seattle.”Applicant
- Brill, Eric, “Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part of Speech Tagging”, 1995, Assocation for Computational Linguistics, vol. 21, No. 4, pp. 1-37.Applicant
- “Brill, Eric. ““Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Partof Speech Tagging””,1995, Computational Linguistics, vol. 21, No. 4, pp. 543-565.”Applicant
- “Brown et al., ““A Statistical Approach to Machine Translation,”” Jun. 1990, Computational Linguistics, vol. 16, No. 2, pp. 79-85.”Applicant
- Brown et al., “Word-Sense Disambiguation Using Statistical Methods,” 1991, Proc. of 29th Annual ACL, pp. 264-270.Applicant
- “Brown et al., ““The Mathematics of Statistical Machine Translation: Parameter Estimation,”” 1993, ComputationalLinguistics, vol. 19, Issue 2, pp. 263-311.”Applicant
- “Brown, Ralf, ““Automated Dictionary Extraction for ““Knowledge-Free”” Example-Based Translation,””1997, Proc. of 7th Int'l Cont. on Theoretical and Methodological Issues in MT, Santa Fe, NM, pp. 111-118.”Applicant
- “Callan et al., ““TREC and TIPSTER Experiments with Inquery,”” 1994, Information Processing and Management,vol. 31, Issue 3, pp. 327-343.”Applicant
- Callison-Burch, C. et al., “Statistical Machine Translation with Word- and Sentence-aligned Parallel Corpora,” In Proceedings of the 42nd Meeting on Assoc. for Computational Linguistics (Barcelona, Spain, Jul. 21-26, 2004). Annual Meeting of the ACL. Assoc. for Computational Linguistics, Morristown, NJ, 1.Applicant
- “Carl, Michael. ““A Constructivist Approach to Machine Translation,”” 1998, New Methods of Language Processingand Computational Natural Language Learning, pp. 247-256.”Applicant
- “Chen, K. and Chen, H., ““Machine Translation: An Integrated Approach,”” 1995, Proc. of 6th Int'l Cont. on Theoreticaland Methodological Issue in MT, pp. 287-294.”Applicant
- Cheng, P. et al., “Creating Multilingual Translation Lexicons with Regional Variations Using Web Corpora,” In Proceedings of the 42nd Annual Meeting on Assoc. for Computational Linguistics (Barcelona, Spain, Jul. 21-26, 2004). Annual Meeting of the ACL. Assoc. for Computational Linguistics, Morristown, NJ, 53.Applicant
- Cheung et al., “Sentence Alignment in Parallel, Comparable, and Quasi-comparable Corpora”, In Proceedings of LREC, 2004, pp. 30-33.Applicant
- Chinchor, Nancy, “MUC-7 Named Entity Task Definition,” 1997, Version 3.5.Applicant
- “Clarkson, P. and Rosenfeld, R., ““Statistical Language Modeling Using the CMU-Cambridge Toolkit””, 1997, Proc. ESCA Eurospeech, Rhodes, Greece, pp. 2707-2710.”Applicant
- Cohen et al., “Spectral Bloom Filters,” SIGMOD 2003, Jun. 9-12, 2003, ACM pp. 241-252.Applicant
- Cohen, “Hardware-Assisted Algorithm for Full-text Large-Dictionary String Matching Using n-gram Hashing,” 1998, Information Processing and Management, vol. 34, No. 4, pp. 443-464.Applicant
- Cohen, Yossi, “Interpreter for FUF,” (available at ftp:/lftp.cs.bgu.ac.il/ pUb/people/elhadad/fuf-life.lf).Applicant
- Corston-Oliver, Simon, ““Beyond String Matching and Cue Phrases: Improving Efficiency and Coverage inDiscourse Analysis””, 1998, The AAAI Spring Symposium on Intelligent Text Summarization, pp. 9-15.Applicant
- Covington, “An Algorithm to Align Words for Historical Comparison”, Computational Linguistics, 1996,vol. 22, No. 4, pp. 481-496.Applicant
- “Dagan, I. and Itai, A., ““Word Sense Disambiguation Using a Second Language Monolingual Corpus””, 1994, Association forComputational Linguistics, vol. 20, No. 4, pp. 563-596.”Applicant
- “Dempster et al., ““Maximum Likelihood from Incomplete Data via the EM Algorithm””, 1977, Journal of the RoyalStatistical Society, vol. 39, No. 1, pp. 1-38.”Applicant
- “Diab, M. and Finch, S., ““A Statistical Word-Level Translation Model for Comparable Corpora,”” 2000, In Proc.of theConference on Content Based Multimedia Information Access (RIAO).”Applicant
- “Diab, Mona, ““An Unsupervised Method for Multilingual Word Sense Tagging Using Parallel Corpora: APreliminary Investigation””, 2000, SIGLEX Workshop on Word Senses and Multi-Linguality, pp. 1-9.”Applicant
- Eisner, Jason, “Learning Non-Isomorphic Tree Mappings for Machine Translation,” 2003, in Proc. of the 41st Meeting of the ACL, pp. 205-208.Applicant
- Elhadad et al., “Floating Constraints in Lexical Choice”, 1996, ACL, vol. 23 No. 2, pp. 195-239.Applicant
- “Elhadad, M. and Robin, J., ““An Overview of SURGE: a Reusable Comprehensive Syntactic RealizationComponent,”” 1996, Technical Report 96-03, Department of Mathematics and Computer Science, Ben GurionUniversity, Beer Sheva, Israel.”Applicant
- Elhadad, M. and Robin, J., “Controlling Content Realization with Functional Unification Grammars”, 1992, Aspects of Automated Natural Language Generation, Dale et al. (eds)., Springer Verlag, pp. 89-104.Applicant
- Ueffing et al., “Using Pos Information for Statistical Machine Translation into Morphologically Rich Languages,” In EACL, 2003: Proceedings of the Tenth Conference on European Chapter of the Association for Computational Linguistics, pp. 347-354.Applicant
- Frederking et al., “Three Heads are Better Than One,” In Proceedings of the 4th Conference on Applied Natural Language Processing, Stuttgart, Germany, 1994, pp. 95-100.Applicant
- Och et al., “Discriminative Training and Maximum Entropy Models for Statistical Machine Translation,” In Proc. of the 40th Annual Meeting of the Association for Computational Linguistics (ACL), Philadelphia, PA, 2002.Applicant
- Yasuda et al., “Automatic Machine Translation Selection Scheme to Output the Best Result,” Proc of LREC, 2002, pp. 525-528.Applicant
- Zhang et al., “Synchronous Binarization for Machine Translations,” Jun. 4-9, 2006, in Proc. of the Human Language Technology Conference of the North American Chapter of the ACL, pp. 256-263.Applicant
- Zhang et al., “Distributed Language Modeling for N-best List Re-ranking,” In Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (Sydney, Australia, Jul. 22-23, 2006). ACL Workshops. Assoc. for Computational Linguistics, Morristown, NJ, 216-223.Applicant
- “Patent Cooperation Treaty International Preliminary Report on Patentability and the Written Opinion, Internationalapplication No. PCT/US2008/004296, Oct. 6, 2009, 5 pgs.”Applicant
- Document, Wikipedia.com, web.archive.org (Feb. 24, 2004) <http://web.archive.org/web/20040222202831 /http://en.wikipedia.org/wikiiDocument>, Feb. 24, 2004.Applicant
- Identifying, Dictionary.com, wayback.archive.org (Feb. 28, 2007) <http://wayback.archive.org/web/200501 01 OOOOOO*/http:////dictionary.reference.com//browse//identifying>, Feb. 28, 2005 <http://web.archive.org/web/20070228150533/http://dictionary.reference.com/browse/identifying>.Applicant
- Koehn, P. et al, “Statistical Phrase-Based Translation,” Proceedings of HLT-NAACL 2003 Main Papers , pp. 48-54 Edmonton, May-Jun. 2003.Applicant
- Abney, S.P., “Stochastic Attribute Value Grammars”, Association for Computional Linguistics, 1997, pp. 597-618.Applicant
- Fox, H., “Phrasal Cohesion and Statistical Machine Translation” Proceedings of the Conference on Empirical Methods in Natural Language Processing, Philadelphia, Jul. 2002, pp. 304-311. Association for Computational Linguistics. <URL: http://acl.ldc.upenn.edu/W/W02/W02-1039.pdf>.Applicant
- Tillman, C., et al, “Word Reordering and a Dynamic Programming Beam Search Algorithm for Statistical Machine Translation,” 2003, Association for Computational Linguistics, vol. 29, No. 1, pp. 97-133 <URL: http://acl.ldc.upenn.edu/J/J03/J03-1005.pdf>.Applicant
- Wang, W., et al. “Capitalizing Machine Translation” in HLT-NAACL '06 Proceedings Jun. 2006. <http://www.isi.edu/natural-language/mt/hlt-naacl-06-wang.pdf>.Applicant
- Langlais, P. et al., “TransType: a Computer-Aided Translation Typing System” EmbedMT '00 ANLP-NAACL 2000 Workshop: Embedded Machine Translation Systems, 2000, pp. 46-51. <http://acl.ldc.upenn.edu/W/W00/W00-0507.pdf>.Applicant
- “Elhadad, Michael, ““FUF: the Universal Unifier User Manual Version 5.2””, 1993, Department of Computer Science,Ben Gurion University, Beer Sheva, Israel.”Applicant
- “Elhadad, Michael, ““Using Argumentation to Control Lexical Choice: A Functional Unification Implementation””,1992, Ph.D. Thesis, Graduate School of Arts and Sciences, Columbia University.”Applicant
- “Elhadad, M. and Robin, J., ““SURGE: a Comprehensive Plug-in Syntactic Realization Component for TextGeneration””, 1999 (available at http://www.cs.bgu.ac.il/-elhadad/pub.html).”Applicant
- Fleming, Michael et al., “Mixed-Initiative Translation of Web Pages,” AMTA 2000, LNAI 1934, Springer-Verlag, Berlin, Germany, 2000, pp. 25-29.Applicant
- Och, Franz Josef and Ney, Hermann, “Improved Statistical Alignment Models” ACLOO:Proc. of the 38th Annual Meeting of the Association for Computational Lingustics, ′Online! Oct. 2-6, 2000, pp. 440-447, XP002279144 Hong Kong, China Retrieved from the Internet: <URL:http://www-i6.informatik.rwth-aachen.de/Colleagues/och/ACLOO.ps> ′retrieved on May 6, 2004! abstract.Applicant
- Ren, Fuji and Shi, Hongchi, “Parallel Machine Translation: Principles and Practice,” Engineering of Complex Computer Systems, 2001 Proceedings, Seventh IEEE Int'l. Conference, pp. 249-259, 2001.Applicant
- Fung et al, “Mining Very-Non-Parallel Corpora: Parallel Sentence and Lexicon Extraction via Bootstrapping and EM”, in EMNLP 2004.Applicant
- “Fung, P. and Yee, L., ““An IR Approach for Translating New Words from Nonparallel, Comparable Texts””, 1998,36th Annual Meeting of the ACL, 17th International Conference on Computational Linguistics, pp. 414-420.”Applicant
- “Fung, Pascale, ““Compiling Bilingual Lexicon Entries From a Non-Parallel English-Chinese Corpus””, 1995, Proc, ofthe Third Workshop on Very Large Corpora, Boston, MA, pp. 173-183.”Applicant
- “Gale, W. and Church, K., ““A Program for Aligning Sentences in Bilingual Corpora,”” 1991, 29th Annual Meeting ofthe ACL, pp. 177-183.”Applicant
- Gale, W. and Church, K., “A Program for Aligning Sentences in Bilingual Corpora,” 1993, Computational Linguisitcs, vol. 19, No. 1, pp. 75-102.Applicant
- Galley et al., “Scalable Inference and Training of Context-Rich Syntactic Translation Models,” Jul. 2006, in Proc. of the 21st International Conference on Computational Linguistics, pp. 961-968.Applicant
- Galley et al., “What's in a translation rule?”, 2004, in Proc. of HLT/NAACL '04, pp. 1-8.Applicant
- Gaussier et al, “A Geometric View on Bilingual Lexicon Extraction from Comparable Corpora”, In Proceedings of ACL 2004, July.Applicant
- “Germann et al., ““Fast Decoding and Optimal Decoding for Machine Translation””, 2001, Proc. of the 39th AnnualMeeting of the ACL, Toulouse, France, pp. 228-235.”Applicant
- “Germann, Ulrich: ““Building a Statistical Machine Translation System from Scratch: How Much Bang for theBuck Can We Expect?”” Proc. of the Data-Driven MT Workshop of ACL-01, Toulouse, France, 2001.”Applicant
- Gildea, D., “Loosely Tree-based Alignment for Machine Translation,” In Proceedings of the 41st Annual Meeting on Assoc. for Computational Linguistics—vol. 1 (Sapporo, Japan, Jul. 7-12, 2003). Annual Meeting of the ACL Assoc. for Computational Linguistics, Morristown, NJ, 80-87. DOI=http://dx.doi.org/10.3115/1075096.1075107.Applicant
- “Grefenstette, Gregory, ““The World Wide Web as a Resource for Example-Based Machine TranslationTasks””, 1999, Translating and the Computer 21, Proc. of the 21 st International Cant. on Translating and theComputer. London, UK, 12 pp.”.Applicant
- Grossi et al, “Suffix Trees and Their Applications in String Algorithms”, In. Proceedings of the 1st South American Workshop on String Processing, Sep. 1993, pp. 57-76.Applicant
- Gupta et al., “Kelips: Building an Efficient and Stable P2P DHT thorough Increased Memory and Background Overhead,” 2003 IPTPS, LNCS 2735, pp. 160-169.Applicant
- Habash, Nizar, “The Use of a Structural N-gram Language Model in Generation-Heavy Hybrid Machine Translation,” University of Maryland, Univ. Institute for Advance Computer Studies, Sep. 8, 2004.Applicant
- “Hatzivassiloglou, V. et al., ““Unification-Based Glossing””, 1995, Proc. of the International Joint Conference onArtificial Intelligence, pp. 1382-1389.”Applicant
- Huang et al., “Relabeling Syntax Trees to Improve Syntax-Based Machine Translation Quality,” Jun. 4-9, 2006, in Proc. of the Human Language Techology Conference of the North Americna Chapter of the ACL, pp. 240-247.Applicant
- Ide, N. and Veronis, J., “Introduction to the Special Issue on Word Sense Disambiguation: The State of the Art”, Mar. 1998, Computational Linguistics, vol. 24, Issue 1, pp. 2-40.Applicant
- Bikel, D., Schwartz, R., and Weischedei, R., “An Algorithm that Learns What's in a Name,” Machine Learning 34, 211-231 (1999).Applicant
- Imamura et al., “Feedback Cleaning of Machine Translation Rules Using Automatic Evaluation,” 2003 Computational Linguistics, pp. 447-454.Applicant
- Imamura, Kenji, “Hierarchical Phrase Alignment Harmonized with Parsing”, 2001, in Proc. of NLPRS, Tokyo.Applicant
- “Jelinek, F., ““Fast Sequential Decoding Algorithm Using a Stack””, Nov. 1969, IBM J. Res. Develop., vol. 13, No. 6, pp. 675-685.”Applicant
- “Jones, K. Sparck, ““Experiments in Relevance Weighting of Search Terms””, 1979, Information Processing &Management, vol. 15, Pergamon Press Ltd., UK, pp. 133-144.”Applicant
- Klein et al., “Accurate Unlexicalized Parsing,” Jul. 2003, in Proc. of the 41st Annual Meeting of the ACL, pp. 423-430.Applicant
- “Knight et al., ““Integrating Knowledge Bases and Statistics in MT,”” 1994, Proc. of the Conference of the Associationfor Machine Translation in the Americas.”Applicant
- “Knight et al., ““Filling Knowledge Gaps in a Broad-Coverage Machine Translation System””, 1995, Proc. ofthel4th International Joint Conference on Artificial Intelligence, Montreal, Canada, vol. 2, pp. 1390-1396.”Applicant
- “Knight, K. and Al-Onaizan, Y., ““A Primer on Finite-State Software for Natural Language Processing””, 1999 (available at http://www.isLedullicensed-sw/carmel).”Applicant
- Knight, K. and Al-Onaizan, Y., “Translation with Finite-State Devices,” Proceedings of the 4th AMTA Conference, 1998.Applicant
- “Knight, K. and Chander, I., ““Automated Postediting of Documents,””1994, Proc. of the 12th Conference on ArtificialIntelligence, pp. 779-784.”Applicant
- Knight, K. and Graehl, J., “Machine Transliteration”, 1997, Proc. of the ACL-97, Madrid, Spain, pp. 128-135.Applicant
- “Knight, K. and Hatzivassiloglou, V., ““Two-Level, Many-Paths Generation,”” 1995, Proc. of the 33rd AnnualConference of the ACL, pp. 252-260.”Applicant
- “Knight, K. and Luk, S., ““Building a Large-Scale Knowledge Base for Machine Translation,”” 1994, Proc. of the 12thConference on Artificial Intelligence, pp. 773-778.”Applicant
- “Knight, K. and Marcu, D., ““Statistics-Based Summarization—Step One: Sentence Compression,”” 2000, AmericanAssociation for Artificial Intelligence Conference, pp. 703-710.”Applicant
- “Knight, K. and Yamada, K., ““A Computational Approach to Deciphering Unknown Scripts,”” 1999, Proc. of the ACLWorkshop on Unsupervised Learning in Natural Language Processing.”Applicant
- “Knight, Kevin, ““A Statistical MT Tutorial Workbook,”” 1999, JHU Summer Workshop (available at http://www.isLedu/natural-language/mUwkbk.rtf).”Applicant
- Knight, Kevin, “Automating Knowledge Acquisition for Machine Translation,” 1997, Al Magazine, vol. 18, No. 4.Applicant
- “Knight, Kevin, ““Connectionist Ideas and Algorithms,”” Nov. 1990, Communications of the ACM, vol. 33, No. 11, pp. 59-74.”Applicant
- “Knight, Kevin, ““Decoding Complexity in Word-Replacement Translation Models””, 1999, Computational Linguistics, vol. 25, No. 4.”Applicant
- “Knight, Kevin, ““Integrating Knowledge Acquisition and Language Acquisition””, May 1992, Journal of AppliedIntelligence, vol. 1, No. 4.”Applicant
- “Knight, Kevin, ““Learning Word Meanings by Instruction,””1996, Proc. of the D National Conference on ArtificialIntelligence, vol. 1, pp. 447-454.”Applicant
- Knight, Kevin, “Unification: A Multidisciplinary Survey,” 1989, ACM Computing Surveys, vol. 21, No. 1.Applicant
- Koehn, Philipp, “Noun Phrase Translation,” A PhD Dissertation for the University of Southern California, pp. xiii, 23, 25-57, 72-81, Dec. 2003.Applicant
- “Koehn, P. and Knight, K., ““ChunkMT: Statistical Machine Translation with Richer Linguistic Knowledge,”” Apr. 2002,Information Sciences Institution.”Applicant
- “Koehn, P. and Knight, K., ““Estimating Word Translation Probabilities from Unrelated Monolingual Corpora Usingthe EM Algorithm,”” 2000, Proc. of the 17th meeting of the AAAI.”Applicant
- “Koehn, P. and Knight, K., ““Knowledge Sources for Word-Level Translation Models,”” 2001, Conference on EmpiricalMethods in Natural Language Processing.”Applicant
- “Kumar, R. and Li, H., ““Integer Programming Approach to Printed Circuit Board Assembly Time Optimization,”” 1995,IEEE Transactions on Components, Packaging, and Manufacturing, Part B: Advance Packaging, vol. 18,No. 4. pp. 720-727.”Applicant
- Kupiec, Julian, “An Algorithm for Finding Noun Phrase Correspondences in Bilingual Corpora,” In Proceedings of the 31st Annual Meeting of the ACL, 1993, pp. 17-22.Applicant
- “Kurohashi, S. and Nagao, M., ““Automatic Detection of Discourse Structure by Checking Surface Information inSentences,”” 1994, Proc. of COL-LING '94, vol. 2, pp. 1123-1127.”Applicant
- “Langkilde, I. and Knight, K., ““Generation that Exploits Corpus-Based Statistical Knowledge,”” 1998, Proc. of theCOLING-ACL, pp. 704-710.”Applicant
- “Langkilde, I. and Knight, K., ““The Practical Value of N-Grams in Generation,”” 1998, Proc. of the 9th InternationalNatural Language Generation Workshop, pp. 248-255.”Applicant
- “Langkilde, Irene, ““Forest-Based Statistical Sentence Generation,”” 2000, Proc. of the 1st Conference on NorthAmerican chapter of the ACL, Seattle, WA, pp. 170-177.”Applicant
- “Langkilde-Geary, Irene, ““A Foundation for General-Purpose Natural Language Generation: SentenceRealization Using Probabilistic Models of Language,”” 2002, Ph.D. Thesis, Faculty of the Graduate School, Universityof Southern California.”Applicant
- “Langkilde-Geary, Irene, ““An Empirical Verification of Coverage and Correctness for a General-PurposeSentence Generator,”” 1998, Proc. 2nd Int'l Natural Language Generation Conference.”Applicant
- “Lee, Yue-Shi,““Neural Network Approach to Adaptive Learning: with an Application to Chinese Homophone Disambiguation,”” IEEE pp. 1521-1526.”Applicant
- Lita, L., et al., “tRuEcasIng,” Proceedings of the 41st Annual Meeting of the Assoc. for Computational Linguistics (In Hinrichs, E. and Roth, D.—editors), pp. 152-159.Applicant
- Llitjos, A. F. et al., “The Translation Correction Tool: English-Spanish User Studies,” Citeseer © 2004, downloaded from: http://gs37.sp.cs.cmu.edu/ari/papers/Irec04/fontll, pp. 1-4.Applicant
- “Mann, G. and Yarowsky, D., ““Multipath Translation Lexicon Induction via Bridge Languages,”” 2001, Proc. of the2nd Conference of the North American Chapter of the ACL, Pittsburgh, PA, pp. 151-158.”Applicant
- “Manning, C. and Schutze, H., ““Foundations of Statistical Natural Language Processing,”” 2000, The MIT Press, Cambridge, MA [Front Matter].”Applicant
- “Marcu, D. and Wong, W., ““A Phrase-Based, Joint Probability Model for Statistical Machine Translation,”” 2002, Proc.of ACL-2 conference on Empirical Methods in Natural Language Processing, vol. 10, pp. 133-139.”Applicant
- “Marcu, Daniel, ““Building Up Rhetorical Structure Trees,”” 1996, Proc. of the National Conference on ArtificialIntelligence and Innovative Applications of Artificial Intelligence Conference, vol. 2, pp. 1069-1074.”Applicant
- “Marcu, Daniel, ““Discourse trees are good indicators of importance in text,”” 1999, Advances in Automatic TextSummarization, The MIT Press, Cambridge, MA.”Applicant
- “Marcu, Daniel, ““Instructions for Manually Annotating the Discourse Structures of Texts,”” 1999, DiscourseAnnotation, pp. 1-49.”Applicant
- “Marcu, Daniel, ““The Rhetorical Parsing of Natural Language Texts,”” 1997, Proceedings of ACLIEACL '97, pp. 96-103.”Applicant
- “Marcu, Daniel, ““The Rhetorical Parsing, Summarization, and Generation of Natural Language Texts,”” 1997, Ph. D.Thesis, Graduate Department of Computer Science, University of Toronto.”Applicant
- “Marcu, Daniel, ““Towards a Unified Approach to Memory- and Statistical-Based Machine Translation,”” 2001, Proc.of the 39th Annual Meeting of the ACL, pp. 378-385.”Applicant
- McCallum, A. and Li, W., “Early Results for Named Entity Recognition with Conditional Random Fields, Feature Induction and Web-enhanced Lexicons,” In Proceedings of the Seventh Conference on Natural Language Learning at HLT-NAACL, 2003, vol. 4 (Edmonton, Canada), Assoc. for Computational Linguistics, Morristown, NJ, pp. 188-191.Applicant
- McDevitt, K. et al., “Designing of a Community-based Translation Center,” Technical Report TR-03-30, Computer Science, Virginia Tech, © 2003, pp. 1-8.Applicant
- “Melamed, I. Dan, ““A Word-to-Word Model of Translational Equivalence,”” 1997, Proc. of the 35th Annual Meeting ofthe ACL, Madrid, Spain, pp. 490-497.”Applicant
- “Melamed, I. Dan, ““Automatic Evaluation and Uniform Filter Cascades for Inducing N-Best Translation Lexicons,””1995, Proc. of the 3rd Workshop on Very Large Corpora, Boston, MA, pp. 184-198.”Applicant
- “Melamed, I. Dan, ““Empirical Methods for Exploiting Parallel Texts,”” 2001, MIT Press, Cambridge, MA [table ofcontents].”Applicant
- “Meng et al.. ““Generating Phonetic Cognates to Handle Named Entities in English-Chinese Cross-LanguageSpoken Document Retrieval,”” 2001, IEEE Workshop on Automatic Speech Recognition and Understanding. pp. 311-314.”Applicant
- Metze, F. et al., “The NESPOLE! Speech-to-Speech Translation System,” Proc. of the HLT 2002, 2nd Int'l. Conf. on Human Language Technology (San Francisco, CA), © 2002, pp. 378-383.Applicant
- “Mikheev et al., ““Named Entity Recognition without Gazeteers,”” 1999, Proc. of European Chapter of the ACL, Bergen,Norway, pp. 1-8.”Applicant
- “Miike et al., ““A Full-Text Retrieval System with a Dynamic Abstract Generation Function,”” 1994, Proceedings of SI-GIR'94, pp. 152-161.”Applicant
- “Mohri, M. and Riley, M., ““An Efficient Algorithm for the N-Best-Strings Problem,”” 2002, Proc. of the 7th Int. Conf. onSpoken Language Processing (ICSLP'02), Denver, CO, pp. 1313-1316.”Applicant
- Mohri, Mehryar, “Regular Approximation of Context Free Grammars Through Transformation”, 2000, pp. 251-261, “Robustness in Language and Speech Technology”, Chapter 9, Kluwer Academic Publishers.Applicant
- “Monasson et al., ““Determining Computational Complexity from Characteristic ‘Phase Transitions’,”” Jul. 1999, NatureMagazine, vol. 400, pp. 133-137.”Applicant
- “Mooney, Raymond, ““Comparative Experiments on Disambiguating Word Senses: An Illustration of the Role of Biasin Machine Learning,”” 1996, Proc. of the Conference on Empirical Methods in Natural Language Processing, pp. 82-91.”Applicant
- Nagao, K. et al., “Semantic Annotation and Transcoding: Making Web Content More Accessible,” IEEE Multimedia, vol. 8, Issue 2 Apr.-Jun. 2001, pp. 69-81.Applicant
- “Nederhof, M. and Satta, G., ““IDL-Expressions: A Formalism for Representing and Parsing Finite Languages inNatural Language Processing,”” 2004, Journal of Artificial Intelligence Research, vol. 21, pp. 281-287.”Applicant
- “Nieben, S. and Ney, H, ““Toward Hierarchical Models for Statistical Machine Translation of Inflected Languages,”” 2001,Data-Driven Machine Translation Workshop, Toulouse, France, pp. 47-54.”Applicant
- Norvig, Peter, “Techniques for Automatic Memoization with Applications to Context-Free Parsing”, Compuational Linguistics,1991, pp. 91-98, vol. 17, No. 1.Applicant
- “Och et al., ““Improved Alignment Models for Statistical Machine Translation,”” 1999, Proc. of the Joint Conf. ofEmpirical Methods in Natural Language Processing and Very Large Corpora, pp. 20-28.”Applicant
- Och et al. “A Smorgasbord of Features for Statistical Machine Translation.” HLTNAACL Conference. Mar. 2004, 8 pages.Applicant
- Och, F., “Minimum Error Rate Training in Statistical Machine Translation,” In Proceedings of the 41st Annual Meeting on Assoc. for Computational Linguistics—vol. 1 (Sapporo, Japan, Jul. 7-12, 2003). Annual Meeting of the ACL. Assoc. for Computational Linguistics, Morristown, NJ, 160-167. DOI= http://dx.doi.org/10.3115/1075096.Applicant
- “Och, F. and Ney, H, ““Improved Statistical Alignment Models,”” 2000, 38th Annual Meeting of the ACL, Hong Kong, pp. 440-447.”Applicant
- Och, F. and Ney, H., “Discriminative Training and Maximum Entropy Models for Statistical Machine Translation,” 2002, Proc. of the 40th Annual Meeting of the ACL, Philadelphia, PA, pp. 295-302.Applicant
- Och, F. and Ney, H., “A Systematic Comparison of Various Statistical Alignment Models,” Computational Linguistics, 2003, 29:1, 19-51.Applicant
- “Papineni et al., ““Bleu: a Method for Automatic Evaluation of Machine Translation,”” 2001, IBM Research Report, RC22176(WQ102-022).”Applicant
- Perugini, Saviero et al., “Enhancing Usability in CITIDEL: Multimodal, Multilingual and Interactive Visualization Interfaces,” JCDL '04, Tucson, AZ, Jun. 7-11, 2004, pp. 315-324.Applicant
- Petrov et al., “Learning Accurate, Compact and Interpretable Tree Annotation,” Jun. 4-9, 2006, in Proc. of the Human Language Technology Conference of the North American Chapter of the ACL, pp. 433-440.Applicant
- “Pla et al., ““Tagging and Chunking with Bigrams,”” 2000, Proc. of the 18th Conference on Computational Linguistics, vol. 2, pp. 614-620.”Applicant
- Qun, Liu, “A Chinese-English Machine Translation System Based on Micro-Engine Architecture,” An Int'l. Conference on Translation and Information Technology, Hong Kong, Dec. 2000, pp. 1-10.Applicant
- Rapp, Reinhard, Automatic Identification of Word Translations from Unrelated English and German Corpora, 1999, 37th Annual Meeting of the ACL, pp. 519-526.Applicant
- Papineni et al., “Bleu: a Method for Automatic Evaluation of Machine Translation”, Proc. of the 40th Annual Meeting of the Association for Computational Linguistics (ACL), Jul. 2002, pp. 311-318.Applicant
- Shaalan et al., “Machine Translation of English Noun Phrases into Arabic”, (2004), vol. 17, No. 2, International Journal of Computer Processing of Oriental Languages, 14 pages.Applicant
- Isahara et al., “Analysis, Generation and Semantic Representation in CONTRAST—A Context-Based Machine Translation System”, 1995, Systems and Computers in Japan, vol. 26, No. 14, pp. 37-53.Applicant
- Proz.com, Rates for proofreading versus Translating, http://www.proz.com/forum/business—issues/202-rates—for—proofreading—versus—translating.html, Apr. 23, 2009, retrieved Jul. 13, 2012.Applicant
- Celine, Volume discounts on large translation project, naked translations, http://www.nakedtranslations.com/en/2007/volume-discounts-on-large-translation-projects/, Aug. 1, 2007, retrieved Jul. 16, 2012.Applicant
- Graehl, J and Knight, K, May 2004, Training Tree Transducers, in NAACL-HLT (2004), pp. 105-112.Applicant
- Niessen et al, “Statistical machine translation with scarce resources using morphosyntactic information”, Jun. 2004, Computational Linguistics, vol. 30, issue 2, pp. 181-204.Applicant
- First Office Action mailed Jun. 7, 2004 in Canadian Patent Application 2408819, filed May 11, 2001.Applicant
- First Office Action mailed Jun. 14, 2007 in Canadian Patent Application 2475857, filed Mar. 11, 2003.Applicant
- Office Action mailed Mar. 26, 2012 in German Patent Application 10392450.7, filed Mar. 28, 2003.Applicant
- First Office Action mailed Nov. 5, 2008 in Canadian Patent Application 2408398, filed Mar. 27, 2003.Applicant
- Second Office Action mailed Sep. 25, 2009 in Canadian Patent Application 2408398, filed Mar. 27, 2003.Applicant
- First Office Action mailed Mar. 1, 2005 in European Patent Application No. 03716920.8, filed Mar. 27, 2003.Applicant
- Second Office Action mailed Nov. 9, 2006 in European Patent Application No. 03716920.8, filed Mar. 27, 2003.Applicant
- Third Office Action mailed Apr. 30, 2008 in European Patent Application No. 03716920.8, filed Mar. 27, 2003.Applicant
- Office Action mailed Oct. 25, 2011 in Japanese Patent Application 2007-536911 filed Oct. 12, 2005.Applicant
- Office Action mailed Jul. 24, 2012 in Japanese Patent Application 2007-536911 filed Oct. 12, 2005.Applicant
- Final Office Action mailed Apr. 9, 2013 in Japanese Patent Application 2007-536911 filed Oct. 12, 2005.Applicant
- Office Action mailed May 13, 2005 in Chinese Patent Application 1812317.1, filed May 11, 2001.Applicant
- Office Action mailed Apr. 21, 2006 in Chinese Patent Application 1812317.1, filed May 11, 2001.Applicant
- Office Action mailed Jul. 19, 2006 in Japanese Patent Application 2003-577155, filed Mar. 11, 2003.Applicant
- Office Action mailed Mar. 1, 2007 in Chinese Patent Application 3805749.2, filed Mar. 11, 2003.Applicant
- Office Action mailed Feb. 27, 2007 in Japanese Patent Application 2002-590018, filed May 13, 2002.Applicant
- Office Action mailed Jan. 26, 2007 in Chinese Patent Application 3807018.9, filed Mar. 27, 2003.Applicant
- Office Action mailed Dec. 7, 2005 in Indian Patent Application 2283/DELNP/2004, filed Mar. 11, 2003.Applicant
- Office Action mailed Mar. 31, 2009 in European Patent Application 3714080.3, filed Mar. 11, 2003.Applicant
- Agichtein et al., “Snowball: Extracting Information from Large Plain-Text Collections,” ACM DL '00, the Fifth ACM Conference on Digital Libraries, Jun. 2, 2000, San Antonio, TX, USA.Applicant
- Satake, Masaomi, “Anaphora Resolution for Named Entity Extraction in Japanese Newspaper Articles,” Master's Thesis [online], Feb. 15, 2002, School of Information Science, JAIST, Nomi, Ishikaw, Japan.Applicant
- Office Action mailed Aug. 29, 2006 in Japanese Patent Application 2003-581064, filed Mar. 27, 2003.Applicant
- Office Action mailed Jan. 26, 2007 in Chinese Patent Application 3807027.8, filed Mar. 28, 2003.Applicant
- Office Action mailed Jul. 25, 2006 in Japanese Patent Application 2003-581063, filed Mar. 28, 2003.Applicant
- Huang et al., “A syntax-directed translator with extended domain of locality,” Jun. 9, 2006, In Proceedings of the Workshop on Computationally Hard Problmens and Joint Inference in Speech and Language Processing, pp. 1-8, New York City, New York, Association for Computational Linguistics.Applicant
- Melamed et al., “Statistical machine translation by generalized parsing,” 2005, Technical Report 05-001, Proteus Project, New York University, http://nlp.cs.nyu.edu/pubs/.Applicant
- Galley et al., “Scalable Inference and Training of Context-Rich Syntactic Translation Models,” Jul. 2006, In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the ACL, pp. 961-968.Applicant
- Huang et al., “Statistical syntax-directed translation with extended domain of locality,” Jun. 9, 2006, In Proceedings of AMTA, pp. 1-8.Applicant
- Advisory Action, Aug. 5, 2013, U.S. Appl. No. 11/272,460, filed Nov. 9, 2005.Applicant
- Notice of Allowance, Oct. 2, 2013, U.S. Appl. No. 11/107,304, filed Apr. 15, 2005.Applicant
- Non-Final Office Action, Sep. 11, 2013, U.S. Appl. No. 11/635,248, filed Dec. 5, 2006.Applicant
- Non-Final Office Action, Mar. 29, 2013, U.S. Appl. No. 12/077,005, filed Mar. 14, 2008.Applicant
- Advisory Action, Sep. 27, 2013, U.S. Appl. No. 11/811,228, filed Jun. 8, 2007.Applicant
- Advisory Action, Jun. 20, 2013, U.S. Appl. No. 12/510,913, filed Jul. 28, 2009.Applicant
- Non-Final Office, Action Sep. 24, 2013, U.S. Appl. No. 12/720,536, filed Mar. 9, 2010.Applicant
- Advisory Action, Jun. 26, 2013, U.S. Appl. No. 13/089,202, filed Apr. 18, 2011.Applicant