Use of annotations in statistical machine translation

Information

  • Patent Grant
  • 9122674
  • Patent Number
    9,122,674
  • Date Filed
    Friday, December 15, 2006
    18 years ago
  • Date Issued
    Tuesday, September 1, 2015
    9 years ago
Abstract
A method, system, and computer readable medium for translating a document is provided. A statistical machine translation engine is trained using a translation memory comprising an annotation. A translation rule associated with the annotation is defined. A source document in a source language is received. The source document comprises an instance of the annotation and a string. The string is translated using the statistical machine translation engine. The instance of the annotation is processed according to the translation rule. A target document in a target language is generated based on the translated string and the processed annotation.
Description
BACKGROUND

1. Field of the Invention


The present invention relates generally to statistical machine translation of documents and more specifically to systems and methods for processing annotations associated with a translation memory.


2. Description of the Related Art


In the field of computer-generated translations, there are two approaches to translating a document from a source language into a target language. The first approach is statistical machine translation (SMT) which uses a set of statistical probabilities to match a word or phrase in one language to an equivalent word or phrase in another language. The set of probabilities is generated using a large quantity of documents that have been previously translated from the source language to the target language.


The second approach is translation memory (TM) which uses bilingual databases of parallel translations of sentence segments. A segment of a source document in a source language is matched to an entry in the TM. The corresponding entry, in the target language, is provided as a translation of the segment. However, TM techniques are limited to translating only the segments that have a corresponding entry in the TM database. For example, a sentence in French such as “Solaris—mise a jour (11-22 UC) serveur NET: 3 licence de utilization” can not be translated using a database with a similar entry such as:


















Solaris - mise à jour (33-64 UC)
Solaris - SPARC server



serveur
(33-64 CPU)



SPARC: 1 licence de utilisation
upgrade: 1 RTU license



Voir page 122 pour le numéro de
See page 122 for the



référence de la mise à niveau de
recommended warranty



garantie recommandée.
upgrade part number.











because the database does not include an entry that matches the sentence exactly. To adapt the TM to identify tags that indicate occurrences such as words or values, the TM includes abstract tags in the entries. For example, the database above may be rewritten as:


















PRODUCTNAME - mise à jour
PRODUCTNAME -



(NUM-NUM
PRODUCTNAME



COMPONENTNAME) serveur
server (NUM-NUM



PRODUCTNAME:
COMPONENTNAME)



NUM licence de utilisation
upgrade: NUM RTU licence



Voir page NUM pour le numéro de
See page NUM for the



référence de la mise à niveau de
recommended warranty



garantie recommandée.
upgrade part number.











where the tags (in capital letters) appear in place of the words indicating words such as the product name, the component name, and numerals. The rewritten database includes a match for the sentence above and can provide a perfect translation.


However, if the modified TM is used to train an SMT engine, the tags can interfere with the training process and result in less accurate translation probabilities when the system receives segments to be translated that have not been rewritten via the same process used to modify the TM. This may result in inaccurate translations.


SUMMARY OF THE INVENTION

A method, system, and computer readable medium for translating a document is provided. A statistical machine translation engine is trained using a translation memory comprising an annotation. A translation rule associated with the annotation is defined. A source document in a source language is received. The source document comprises an instance of the annotation and a string. The string is translated using the statistical machine translation engine. The instance of the annotation is processed according to the translation rule. A target document in a target language is generated based on the translated string and the processed annotation.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 depicts an illustration of an exemplary environment in which some embodiments may be practiced;



FIG. 2 depicts a block diagram illustrating an exemplary translation engine according to exemplary embodiments;



FIG. 3 depicts a flowchart illustrating an exemplary process for integrating a translation memory with a statistical machine translation engine according to exemplary embodiments; and



FIG. 4 depicts a flowchart illustrating an exemplary process for selecting a configuration set according to exemplary embodiments.





DETAILED DESCRIPTION

A system and method for translating a document having annotations is provided. The system and method may be used to integrate translation memory (TM) systems and statistical machine translation (SMT) systems. The system and method distinguishes between annotations to translate according to rules associated with a configuration set and word strings to translate using statistical machine translation to generate a translated document. The system and method may also be used by the translation engine 104 when no TM is available.



FIG. 1 depicts an illustration of an exemplary environment 100 in which some embodiments may be practiced. The environment 100 comprises a document library 102, a translation engine 104, and a network 106. The translation engine 104 is configured to communicate with the document library over the network 106. The network 106 may comprise a public network (e.g., the Internet) or a private network. The document library 102 comprises parallel translations of documents or segments of documents used in SMT. These parallel translations may be referred to as “parallel segments.” The document library may also include a TM database. The translation memory database may include entries having abstract tags. The abstract tags may include annotations indicating a value, a component name, a product name, or other lingo.


The translation engine 104 is configured to translate a document written in a source language into a target language using statistical machine translation (SMT). The source language is the language in which the source document appears. The target language is the language into which the source document is translated. The generated translation of the document is the target document. The translation engine 104 may retrieve documents from the document library 102 that are to be translated. In some embodiments, the translation engine 104 is trained based on the parallel segments stored in the document library 102. The translation engine 104 may also be trained using the TM database.


In operation, the translation engine 104 accesses the parallel segments and TM database stored in the document library 102 to generate sets of statistical probabilities used to translate a source document. The generated sets of statistical probabilities may be stored in the document library 102 and/or the translation engine 104. If the TM database comprises entries containing abstract tags, the document library 102 and/or the translation engine 104 may comprise a configuration set that defines the abstract tags such that the translation engine 104 is able to recognize the abstract tags as such during training and/or document translation. More specifically, the configuration set is a set of configuration values that define the processing behavior of annotations in a source document.



FIG. 2 depicts a block diagram illustrating a translation engine 104 according to exemplary embodiments. The translation engine 104 is configured to translate a source document into a target language to generate a target document. The translation engine 104 may comprise a computational device, such as a desktop computer, server, laptop computer, or the like. The translation engine 104 comprises a processor 202, a user interface 204, a communication interface 206, and a memory 208 that communicate via the bus 210. The processor 202 is configured to execute commands received via the communication interface 206 or the user interface 204. The commands may include an instruction to generate a set of statistical probabilities using a set of parallel segments, an instruction to identify annotations or abstract tags, and/or an instruction to translate a selected document. The processor 202 is further configured to retrieve and execute commands from the memory 208.


The user interface 204 is configured to display a graphical user interface (GUI) to a user and receive input from the user. The user interface 204 may comprise a monitor, speakers, a keyboard, a mouse, and so forth. The input received via the user interface 204 may include a selection of a document to be translated, an annotation definition, or corrections to the target document. The communication interface 206 is configured to receive and transmit data, such as source documents or target documents, over the network 106.


The memory 208 is configured to store instructions for translating a document using statistical machine translation. The memory 208 may further store a configuration set 212. The configuration set 212 defines annotations that occur in the TM database to indicate abstractions such as values, model numbers, and technical jargon. The configuration set 212 may further define one or more translating or formatting annotations associated with the TM database. The configuration set 212 is discussed further herein. Although translation engine 104 is illustrated as having the processor 202, the user interface 204, the communication interface 206, the memory 208, and the bus 210, fewer or more modules may comprise translation engine 104 and still fall within the scope of various embodiments.


The translation engine 104 is configured to integrate annotations appearing in a TM database into the SMT technique used by the translation engine 104. By integrating the annotations, a source document can be translated as a whole rather than broken into segments that are translated according to whether a match appears in the TM database.


To integrate the annotations, a user generates a configuration set that defines the annotations occurring in a TM database. For example, the annotation:

    • <NUM number=“33”/>


      may appear in the TM database within an entry such as:















Voir page <NUM number = “33”/> pour
See page <NUM number = “33”/>


le numéro de référence de la mise à
for the recommended warranty


niveau de garantie recommandée.
upgrade part number.










The configuration set 212, to instruct the translation engine 104 as to the functionality of the annotation, may include a translation rule such as:
    • <tag tag-name=“NUM” word-class=“number” />


      The configuration set 212, therefore, includes a translation rule for recognizing an annotation and distinguishing the annotation from other sentence fragments appearing in the source document.


By training the translation engine 104 to recognize the annotation “<NUM number=“33”/>”, the translation engine 104 can be further trained based on the entries in the TM database. Training the translation engine 104 using the parallel segments listed as entries in the TM database increases the accuracy of the set of statistical probabilities used in SMT. In the above example, the translation engine 104 is able to assign a higher probability that the French phrase, “Voir page <NUM number=“33”/> pour” is translated “See page <NUM number=“33”/> for.” Further, because of the annotation, the translation engine 104 is able to accurately translate the French phrase, “Voir page <NUM number=“56”/> pour” as “See page <NUM number=“56”/> for” without further training or input from the user.


When a user selects a source document to be translated, the annotations are added to the source document. The translation engine 104 translates the source document using SMT. Additionally, the translation engine 104 processes annotations according to the configuration set 212. For example, some annotations, as described below, may include a translation rule that instructs the translation engine 104 to process segments of the source document differently. The annotations, therefore, give a user greater control over how a source document is translated.



FIG. 3 depicts a flowchart illustrating an exemplary process 300 for integrating a translation memory with a statistical machine translation (SMT) engine according to exemplary embodiments. The statistical machine translation engine may comprise the translation engine 104. The exemplary process 300 allows the translation engine 104 to accurately translate source documents that include the annotations. The annotations may indicate abstract values and/or terms. According to exemplary embodiments, the annotations may comprise extensible markup language (XML) tags, hypertext markup markup language (HTML), other markups based on standard generalized markup language (SGML), a textual field, or other annotation mechanism. The annotations are defined in the configuration set 212 and may appear in the TM database.


In step 302, the translation engine 104 is trained using the TM database to identify and process the annotations in the source document. Training the translation engine 104 using the TM database also allows the translation engine 104 to learn general translation patterns within the database entries and modify the probability values associated with words or fragments accordingly. For example, the translation engine 104 may learn an output context for the annotations. An output context is the word or words that consistently appear in the target document around selected annotations, such as a defined semantic behavior for dates, numbers, product names, or the like.


In step 304, translation rules associated with the annotations are defined for a language pair. The translation rules may include an output context, a translation boundary, and/or a formatting instruction. The translation rules may be probabilistic or heuristic.


For example, a word class annotation indicates that a word or phrase belongs to an abstract word class. For example, the annotation:

    • <NUM numb er=“122”/>


      indicates that the text “122” is a number, such as a page number. Likewise, the annotation:
    • <VAL metric=“2.59 N*m”/>


      indicates that the text “2.59 N*m” is a metric measurement. The translation engine 104 may preserve the word class annotation in the target document. Other annotations may be used to indicate product names, component names, technical jargon, and so forth.


A translation boundary indicates that text occurring before the boundary is translated separately from text occurring after the boundary. By including a boundary, a user is able to prevent “translation swap” occurring across the boundary. For example, a user can indicate that text occurring between parentheses in a source document to be translated separately from the text occurring outside the parenthesis. For example, the annotation:

    • <segment x=“1”/>L=16<segment/>


      indicates that the fragment “L=16” is to be translated independently of the text surrounding the fragment.


In some embodiments, a second boundary annotation comprises a sentence boundary. A sentence boundary indicates a sentence break in instances where sentence punctuation does not normally appear. For example, a sentence boundary may be used to separate the following two sentences:

    • <sentence/>Pieza no reutilizable <sentence/>
    • MOLDURA EXTERIOR DEL PARABRISAS.


      The sentence boundary indicates that the phrases should be treated as separate sentences even though no punctuation appears in the source document.


Another annotation that may be included in the source document is a translation boundary. A translation boundary indicates a segment of the source document that is not to be translated into the target language. Translation boundaries can be nested such that a portion of a not-translated segment is translated in the target document. For example, the underlined text in the following sentence will be translated into the target language:

    • Here's an <off> comment <on> interesting </on> another comment </off> problem.


      where the word, “interesting” is translated because the “on” annotations defining the translation boundary are nested within the “off” annotations defining another translation boundary.


Formatting annotations may include space preservation around the annotations when the source document is translated into the target language. The translation engine 104 may insert extra spaces or delete space around words that may be undesirable in the target document. To preserve the spacing, the annotations are inserted with the desired spacing after the start tag and before the end tag. For example:

    • <textart id=“b111209e17-1-7”>from P/W RL Fuse </textart>


      indicates that there is no space before the word “from” and that there is a space after the word “fuse.” In some embodiments, word class annotations, described above, do not include space preservation.


Using annotations, the annotations themselves can be preserved within the target document. By preserving the annotations, the translation engine 104 does not translate data occurring within the annotation itself. For example, an annotation may include a part name or a component name that is not to be translated into the target language. Referring to the previous example, the fragment, “b111209e17-1-7”, will not be translated. The tag body, however, may be translated. In the above example, the phrase “from the P/W RL Fuse” will be translated into the target language.


In step 306, the source document comprising annotations and strings is received. The annotations include, for example, the XML tags described herein. The strings include the portions of the source document that are not annotated. The strings are processed by the translation engine 104 using statistical machine translation techniques.


In step 308, the language pair configuration set is selected. The language pair configuration set 212 is a group of configuration settings that defines the annotations associated with a source language and/or a target language. The configuration set 212 may additionally specify which annotations are to be removed from the target document after translation and which annotations are to be preserved in the target document. By editing the configuration sets, users of the translation engine 104 are able to define additional annotations and the behavior associated with the annotations. A configuration set may be accessed even if no TM database is available. An example of a configuration set 212 for documents in which the source language is English and the target language is empty is:

    • <config>
      • <filters>
        • <xml-filter src=“eng” tgt=“ ”>
          • <tags>
          •  <tag tag-name=“seg” break=“1” />
          •  <tag tag-name=“unit” word-class=“unit” />
          •  <tag tag-name=“val” word-class=“val” />
          •  <tag tag-name=“num” word-class=“num” />
          •  <tag tag-name=“tr-on” hands-on=“1” />
          •  <tag tag-name=“tr-off” hands-off=“1” />
          •  <tag tag-name=“segment” no-swap=“1” />
          •  <tag tag-name=“textart”/>
          •  <tag tag-name=“ptext” preserve-space=“1” />
          • </tags>
        • </xml-filter>
        • <xml-filter name=“Auto Parts Catalog”>
          • <tag tag-name=“unit” word-class=“unit” />
          • <tag tag-name=“val” word-class=“val” />
          • <tag tag-name=“num” word-class=“num” />
        • </xml-filter>
      • </filters>
    • </config>


      This exemplary configuration set can be used for any language pair where the source language is English. This configuration set also includes a second configuration set that is defined by a configuration set name, “Auto Parts Catalogue.” The user can identify specific configuration sets by using configuration set names. As such, in some embodiments, the configuration set 212 is selected and/or specified by the user. The configuration set 212 may be selected according to the exemplary process depicted in FIG. 4.


In step 310, the source document is translated according to the annotations. Using the annotations, a more accurate and more fluent translation can be generated by the translation engine 104. The annotations can be adapted to technical jargon occurring in the source document. The annotations may also be used to insert objects such as images, charts, tables, graphs, or the like appearing in the source document into the target document.



FIG. 4 depicts a flowchart illustrating an exemplary process 400 for selecting a configuration set, such as configuration set 212, according to exemplary embodiments. The configuration set may be stored in as a file. Further, a single file may contain more than one configuration set. In some embodiment, a configuration set may be identified by a configuration set name. The unique name allows a user to select a specific configuration set to be used for processing a document. Further, upon request, the system can supply the user with a list of all available configuration sets. The exemplary process 400 may be performed as step 306 by the translation engine 104, according to some embodiments.


In step 402, a determination is made as to whether a specific configuration set is selected by the user. In the above example, a user may select the configuration set for “Auto Parts Catalogue.” If a configuration set is selected by the user, a second determination is made as to whether the configuration set is found in step 404. If the configuration set is not found in step 404, an error is reported to the user in step 406. If the configuration set is found, the annotations in the source document are processed according to the configuration set selected by the user in step 408.


If no specific configuration set is selected by the user in step 402, a determination as to whether a configuration set for the exact language pair of the source language and the target language exists in step 410. In a first further step, if the exact language pair does not exist, another determination may be made as to whether a configuration set having a matching source language and no target language exists. In a second further step, if no match for the source language is found, a determination may be made as to whether a configuration set having no source language and a matching target language exists.


In step 410, and the first and second further steps discussed above, if a matching configuration set is found, the annotations in the source document may be processed according to the matching configuration set, as described in step 408. If no matching configuration set exists, the annotations in the source document may be processed according to an empty configuration set. The empty configuration set allows the translation engine 104 to translate the source document as though the annotations are not present.


The above-described functions and components can be comprised of instructions that are stored on a storage medium. The instructions can be retrieved and executed by a processor. Some examples of instructions are software, program code, and firmware. Some examples of storage medium are memory devices, tape, disks, integrated circuits, and servers. The instructions are operational when executed by the processor to direct the processor to operate in accord with various embodiments. Those skilled in the art are familiar with instructions, processor(s), and storage medium.


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 scope of the present disclosure is in no way limited to the languages used to describe exemplary embodiments. Thus, the breadth and scope of a preferred embodiment should not be limited by any of the above-described exemplary embodiments.

Claims
  • 1. A method for translating a document, comprising: defining translation rules associated with annotations occurring in a translation memory database, wherein the translation rules comprise an output context;integrating the translation rules in the translation memory database into statistical machine translation used by a translation engine, the integration including training the translation engine to recognize annotations in the translation memory database while performing statistical machine translation;training the statistical machine translation of the translation engine using both the translation memory database and parallel segments to modify statistical probability values;storing the statistical probability values modified during the training, the stored values for use in the statistical machine translation by the translation engine;receiving a source document in a source language, the source document comprising a string and an annotated segment of text, the annotated segment of text comprising text and an instance of an annotation;translating the source document as a whole using the translation engine without breaking the source document into segments that are translated according to whether a match appears in the translation memory database, the translation engine configured for: identifying annotations and associated annotated segments of the text in the source document to be processed using the translation rules, and strings in the source document to be translated using statistical machine translation,translating the identified strings in the source document using the statistical machine translation, andprocessing the identified instances of the annotations and the associated annotated segments of text according to the translation rules using the translation memory database, at least one of the translation rules being associated with the annotation; andgenerating a target document in a target language based on the translated source document and the translated text associated with the annotation.
  • 2. The method recited in claim 1, wherein the annotation indicates a word class.
  • 3. The method recited in claim 2, wherein the word class is associated with a value.
  • 4. The method recited in claim 2, wherein the output context is associated with the word class.
  • 5. The method recited in claim 1, wherein the annotation indicates a boundary.
  • 6. The method recited in claim 5, wherein translating the text associated with the instance of the annotation comprises translating text occurring after the annotation separately from text occurring before the annotation.
  • 7. The method recited in claim 1, wherein translating the text associated with the instance of the annotation comprises preserving a segment of the source document in the source language.
  • 8. The method recited in claim 1, wherein translating the text associated with the instance of the annotation comprises preserving a number of spaces around the translated text associated with the annotation in the target document.
  • 9. The method recited in claim 1, wherein translating the text associated with the instance of the annotation comprises preserving the annotation in the target document.
  • 10. The method recited in claim 1, wherein the annotation comprises an extensible markup language tag.
  • 11. The method recited in claim 1, wherein the annotation is associated with the source language.
  • 12. The method recited in claim 1, wherein the annotation is associated with the target language.
  • 13. The method recited in claim 1, further comprising training the translation engine to identify the annotation in the source document using annotated entries in the translation memory database.
  • 14. The method recited in claim 1, wherein the associated annotated segment of text is adjacent the annotation.
  • 15. The method recited in claim 1, wherein the translating of the identified strings using the translation engine trained using the translation memory is performed without reference to the annotation.
  • 16. The method recited in claim 1, wherein the translation engine is further trained with the output context associated with the annotation.
  • 17. The method recited in claim 1, wherein the output context comprises one or more words in the target document proximate to the annotation.
  • 18. The method recited in claim 1, wherein the output context comprises a defined semantic behavior for at least one of a date, a number and a product name.
  • 19. A system for translating a document, comprising: defined translation rules associated with annotations occurring in a translation memory database, wherein the translation rules comprise an output context;a communications interface configured to receive a source document in a source language, the source document comprising a string and an annotated segment of text, the annotated segment of text comprising text and an instance of an annotation;a statistical machine translation engine trained for statistical machine translation using both parallel segments, the annotation integrated into the parallel segments, and a translation memory comprising the annotation, to modify statistical probability values used in the statistical machine translation engine, the modified statistical probability values stored for use in the statistical machine translation by the statistical machine translation engine;a translation memory database including translation rules integrated into the statistical machine translation used by the statistical machine translation engine, the integration including training the statistical translation engine to recognize the annotations in the translation memory while performing the statistical machine translation; anda processor configured to translate the source document as a whole using the statistical machine translation engine without breaking the source document into segments that are translated according to whether a match appears in the translation memory database, the statistical machine translation engine configured to: identify the annotations and the associated annotated segments of the text in the source document to be processed using the translation rules, and the strings in the source document to be translated using statistical machine translation,translate the identified strings in the source document using statistical machine translation,process the identified instances of the annotations and the associated annotated segments of text according to the translation rules in the translation memory database, at least one of the translation rules being associated with the annotation, andgenerate a target document in a target language based on the translated string and the translated text associated with the annotation.
  • 20. The system recited in claim 19, wherein the annotation indicates a word class.
  • 21. The system recited in claim 20, wherein the word class is associated with a value.
  • 22. The system recited in claim 20, wherein the output context is associated with the word class.
  • 23. The system recited in claim 19, wherein the annotation indicates a boundary.
  • 24. The system recited in claim 23, wherein the processor is configured to translate text occurring after the instance of the annotation separately from text occurring before the instance of the annotation.
  • 25. The system recited in claim 19, wherein the processor is configured to preserve a segment of the source document in the source language.
  • 26. The system recited in claim 19, wherein the processor is configured to preserve a number of spaces around the text associated with the annotation in the target document.
  • 27. The system recited in claim 19, wherein the processor is configured to preserve the annotation in the target document.
  • 28. The system recited in claim 19, wherein the annotation comprises an extensible markup language tag.
  • 29. The system recited in claim 19, wherein the annotation is associated with the source language.
  • 30. The system recited in claim 19, wherein the annotation is associated with the target language.
  • 31. The system recited in claim 19, wherein the processor is further configured to train the statistical machine translation engine to identify the annotation in the source document using annotated entries in the translation memory database.
  • 32. The system recited in claim 19, wherein the processor is configured to translate the identified string using the statistical machine translation engine without reference to the annotation.
  • 33. A non-transitory computer readable storage medium having embodied thereon a computer program having instructions executable by a computer to perform a method for translating a document, the method comprising the steps: defining translation rules associated with annotations occurring in a translation memory database, wherein the translation rules comprise an output context;integrating the translation rules in the translation memory database into statistical machine translation used by a translation engine, the integration including training the translation engine to recognize annotations in the translation memory database while performing statistical machine translation;training the statistical machine translation of the translation engine using both the translation memory and parallel segments to modify statistical probability values;storing the statistical probability values modified during the training, the stored values for use in the statistical machine translation by the translation engine;receiving a source document in a source language, the source document comprising a string and an annotated segment of text, the annotated segment of text comprising text and an instance of an annotation;translating the source document as a whole using the translation engine without breaking the source document into segments that are translated according to whether a match appears in the translation memory database, the translation engine configured for: identifying annotations and associated annotated segments of the text in the source document to be processed using the translation rules, and strings in the source document to be translated using the statistical machine translation,translating the identified strings in the source document using the statistical machine translation, andprocessing the identified instances of the annotations and the associated annotated segments of text according to the translation rules using the translation memory database, at least one of the translation rules being associated with the annotation; andgenerating a target document in a target language based on the translated string and the translated text associated with the annotation.
  • 34. The non-transitory computer readable storage medium recited in claim 33, wherein the annotation indicates a word class.
  • 35. The non-transitory computer readable storage medium recited in claim 34, wherein the word class is associated with a value.
  • 36. The non-transitory computer readable storage medium recited in claim 34, wherein the output context is associated with the word class.
  • 37. The non-transitory computer readable storage medium recited in claim 33, wherein the annotation indicates a boundary.
  • 38. The non-transitory computer readable storage medium recited in claim 37, further comprising an instruction executable by the computer for translating text occurring after the instance of the annotation separately from text occurring before the instance of the annotation.
  • 39. The non-transitory computer readable storage medium recited in claim 33, further comprising an instruction executable by the computer for preserving a segment of the source document in the source language.
  • 40. The non-transitory computer readable storage medium recited in claim 33, further comprising an instruction for preserving a number of spaces around the translated text associated with the annotation in the target document.
  • 41. The non-transitory computer readable storage medium recited in claim 33, further comprising an instruction for preserving the annotation in the target document.
  • 42. The non-transitory computer readable storage medium recited in claim 33, wherein the annotation comprises an extensible markup language tag.
  • 43. The non-transitory computer readable storage medium recited in claim 33, wherein the annotation is associated with the source language.
  • 44. The non-transitory computer readable storage medium recited in claim 33, wherein the annotation is associated with the target language.
  • 45. The non-transitory computer readable storage medium recited in claim 33, further comprising an instruction executable by the computer training the translation engine to identify the annotation in the source document using annotated entries in the translation memory database.
  • 46. The non-transitory computer readable storage medium recited in claim 33, wherein the translating of the identified string using the translation engine trained using the translation memory is performed without reference to the annotation.
US Referenced Citations (455)
Number Name Date Kind
4502128 Okajima et al. Feb 1985 A
4599691 Sakaki et al. Jul 1986 A
4615002 Innes Sep 1986 A
4661924 Okamoto et al. Apr 1987 A
4787038 Doi et al. Nov 1988 A
4791587 Doi Dec 1988 A
4800522 Miyao et al. Jan 1989 A
4814987 Miyao et al. Mar 1989 A
4942526 Okajima et al. Jul 1990 A
4980829 Okajima et al. Dec 1990 A
5020112 Chou May 1991 A
5088038 Tanaka et al. Feb 1992 A
5091876 Kumano et al. Feb 1992 A
5146405 Church Sep 1992 A
5167504 Mann Dec 1992 A
5175684 Chong Dec 1992 A
5181163 Nakajima et al. Jan 1993 A
5212730 Wheatley et al. May 1993 A
5218537 Hemphill et al. Jun 1993 A
5220503 Suzuki et al. Jun 1993 A
5267156 Nomiyama Nov 1993 A
5268839 Kaji Dec 1993 A
5295068 Nishino et al. Mar 1994 A
5302132 Corder Apr 1994 A
5311429 Tominaga May 1994 A
5387104 Corder Feb 1995 A
5408410 Kaji Apr 1995 A
5432948 Davis et al. Jul 1995 A
5442546 Kaji et al. Aug 1995 A
5477450 Takeda et al. Dec 1995 A
5477451 Brown et al. Dec 1995 A
5488725 Turtle et al. Jan 1996 A
5495413 Kutsumi et al. Feb 1996 A
5497319 Chong et al. Mar 1996 A
5510981 Berger et al. Apr 1996 A
5528491 Kuno et al. Jun 1996 A
5535120 Chong et al. Jul 1996 A
5541836 Church et al. Jul 1996 A
5541837 Fushimoto Jul 1996 A
5548508 Nagami Aug 1996 A
5587902 Kugimiya Dec 1996 A
5644774 Fukumochi et al. Jul 1997 A
5675815 Yamauchi et al. Oct 1997 A
5687383 Nakayama et al. Nov 1997 A
5696980 Brew Dec 1997 A
5724593 Hargrave, III et al. Mar 1998 A
5752052 Richardson et al. May 1998 A
5754972 Baker et al. May 1998 A
5761631 Nasukawa Jun 1998 A
5761689 Rayson et al. Jun 1998 A
5768603 Brown et al. Jun 1998 A
5779486 Ho et al. Jul 1998 A
5781884 Pereira et al. Jul 1998 A
5794178 Caid et al. Aug 1998 A
5805832 Brown et al. Sep 1998 A
5806032 Sproat Sep 1998 A
5819265 Ravin et al. Oct 1998 A
5826219 Kutsumi Oct 1998 A
5826220 Takeda et al. Oct 1998 A
5845143 Yamauchi et al. Dec 1998 A
5848385 Poznanski et al. Dec 1998 A
5848386 Motoyama Dec 1998 A
5850561 Church et al. Dec 1998 A
5855015 Shoham Dec 1998 A
5864788 Kutsumi Jan 1999 A
5867811 O'Donoghue Feb 1999 A
5870706 Alshawi Feb 1999 A
5893134 O'Donoghue et al. Apr 1999 A
5903858 Saraki May 1999 A
5907821 Kaji et al. May 1999 A
5909681 Passera et al. Jun 1999 A
5930746 Ting Jul 1999 A
5963205 Sotomayor Oct 1999 A
5966685 Flanagan et al. Oct 1999 A
5966686 Heidorn et al. Oct 1999 A
5983169 Kozma Nov 1999 A
5987402 Murata et al. Nov 1999 A
5987404 Della Pietra et al. Nov 1999 A
5991710 Papineni et al. Nov 1999 A
5995922 Penteroudakis et al. Nov 1999 A
6018617 Sweitzer et al. Jan 2000 A
6031984 Walser Feb 2000 A
6032111 Mohri Feb 2000 A
6047252 Kumano et al. Apr 2000 A
6064819 Franssen et al. May 2000 A
6064951 Park et al. May 2000 A
6073143 Nishikawa et al. Jun 2000 A
6077085 Parry et al. Jun 2000 A
6092034 McCarley et al. Jul 2000 A
6119077 Shinozaki Sep 2000 A
6119078 Kobayakawa et al. Sep 2000 A
6131082 Hargrave, III et al. Oct 2000 A
6161082 Goldberg et al. Dec 2000 A
6182014 Kenyon et al. Jan 2001 B1
6182027 Nasukawa et al. Jan 2001 B1
6185524 Carus et al. Feb 2001 B1
6205456 Nakao Mar 2001 B1
6206700 Brown et al. Mar 2001 B1
6223150 Duan et al. Apr 2001 B1
6233544 Alshawi May 2001 B1
6233545 Datig May 2001 B1
6233546 Datig May 2001 B1
6236958 Lange et al. May 2001 B1
6269351 Black Jul 2001 B1
6275789 Moser et al. Aug 2001 B1
6278967 Akers et al. Aug 2001 B1
6278969 King et al. Aug 2001 B1
6285978 Bernth et al. Sep 2001 B1
6289302 Kuo Sep 2001 B1
6304841 Berger et al. Oct 2001 B1
6311152 Bai et al. Oct 2001 B1
6317708 Witbrock et al. Nov 2001 B1
6327568 Joost Dec 2001 B1
6330529 Ito Dec 2001 B1
6330530 Horiguchi et al. Dec 2001 B1
6356864 Foltz et al. Mar 2002 B1
6360196 Poznanski et al. Mar 2002 B1
6389387 Poznanski et al. May 2002 B1
6393388 Franz et al. May 2002 B1
6393389 Chanod et al. May 2002 B1
6415250 van den Akker Jul 2002 B1
6460015 Hetherington et al. Oct 2002 B1
6470306 Pringle et al. Oct 2002 B1
6473729 Gastaldo et al. Oct 2002 B1
6473896 Hicken et al. Oct 2002 B1
6480698 Ho et al. Nov 2002 B2
6490549 Ulicny et al. Dec 2002 B1
6498921 Ho et al. Dec 2002 B1
6502064 Miyahira et al. Dec 2002 B1
6529865 Duan et al. Mar 2003 B1
6535842 Roche et al. Mar 2003 B1
6587844 Mohri Jul 2003 B1
6598046 Goldberg et al. Jul 2003 B1
6604101 Chan et al. Aug 2003 B1
6609087 Miller et al. Aug 2003 B1
6647364 Yumura et al. Nov 2003 B1
6691279 Yoden et al. Feb 2004 B2
6745161 Arnold et al. Jun 2004 B1
6745176 Probert, Jr. et al. Jun 2004 B2
6757646 Marchisio Jun 2004 B2
6778949 Duan et al. Aug 2004 B2
6782356 Lopke Aug 2004 B1
6810374 Kang Oct 2004 B2
6848080 Lee et al. Jan 2005 B1
6857022 Scanlan Feb 2005 B1
6885985 Hull Apr 2005 B2
6901361 Portilla May 2005 B1
6904402 Wang et al. Jun 2005 B1
6910003 Arnold et al. Jun 2005 B1
6952665 Shimomura et al. Oct 2005 B1
6983239 Epstein Jan 2006 B1
6993473 Cartus Jan 2006 B2
6996518 Jones et al. Feb 2006 B2
6996520 Levin Feb 2006 B2
6999925 Fischer et al. Feb 2006 B2
7013262 Tokuda et al. Mar 2006 B2
7016827 Ramaswamy et al. Mar 2006 B1
7016977 Dunsmoir et al. Mar 2006 B1
7024351 Wang Apr 2006 B2
7031911 Zhou et al. Apr 2006 B2
7050964 Menzes et al. May 2006 B2
7054803 Eisele May 2006 B2
7085708 Manson Aug 2006 B2
7089493 Hatori et al. Aug 2006 B2
7103531 Moore Sep 2006 B2
7107204 Liu et al. Sep 2006 B1
7107215 Ghali Sep 2006 B2
7113903 Riccardi et al. Sep 2006 B1
7143036 Weise Nov 2006 B2
7146358 Gravano et al. Dec 2006 B1
7149688 Schalkwyk Dec 2006 B2
7171348 Scanlan Jan 2007 B2
7174289 Sukehiro Feb 2007 B2
7177792 Knight et al. Feb 2007 B2
7191115 Moore Mar 2007 B2
7194403 Okura et al. Mar 2007 B2
7197451 Carter et al. Mar 2007 B1
7200550 Menezes et al. Apr 2007 B2
7206736 Moore Apr 2007 B2
7209875 Quirk et al. Apr 2007 B2
7219051 Moore May 2007 B2
7239998 Xun Jul 2007 B2
7249012 Moore Jul 2007 B2
7249013 Al-Onaizan et al. Jul 2007 B2
7283950 Pournasseh et al. Oct 2007 B2
7295962 Marcu Nov 2007 B2
7295963 Richardson et al. Nov 2007 B2
7302392 Thenthiruperai et al. Nov 2007 B1
7319949 Pinkham Jan 2008 B2
7328156 Meliksetian et al. Feb 2008 B2
7340388 Soricut et al. Mar 2008 B2
7346487 Li Mar 2008 B2
7346493 Ringger et al. Mar 2008 B2
7349839 Moore Mar 2008 B2
7349845 Coffman et al. Mar 2008 B2
7356457 Pinkham et al. Apr 2008 B2
7369998 Sarich et al. May 2008 B2
7373291 Garst May 2008 B2
7383542 Richardson et al. Jun 2008 B2
7389222 Langmead et al. Jun 2008 B1
7389234 Schmid et al. Jun 2008 B2
7403890 Roushar Jul 2008 B2
7409332 Moore Aug 2008 B2
7409333 Wilkinson et al. Aug 2008 B2
7447623 Appleby Nov 2008 B2
7454326 Marcu et al. Nov 2008 B2
7496497 Liu Feb 2009 B2
7533013 Marcu May 2009 B2
7536295 Cancedda et al. May 2009 B2
7546235 Brockett et al. Jun 2009 B2
7552053 Gao et al. Jun 2009 B2
7565281 Appleby Jul 2009 B2
7574347 Wang Aug 2009 B2
7580828 D'Agostini Aug 2009 B2
7580830 Al-Onaizan et al. Aug 2009 B2
7584092 Brockett et al. Sep 2009 B2
7587307 Cancedda et al. Sep 2009 B2
7620538 Marcu et al. Nov 2009 B2
7620632 Andrews Nov 2009 B2
7624005 Koehn et al. Nov 2009 B2
7624020 Yamada et al. Nov 2009 B2
7627479 Travieso et al. Dec 2009 B2
7636656 Nieh Dec 2009 B1
7680646 Lux-Pogodalla et al. Mar 2010 B2
7689405 Marcu Mar 2010 B2
7698124 Menezes et al. Apr 2010 B2
7698125 Graehl et al. Apr 2010 B2
7707025 Whitelock Apr 2010 B2
7711545 Koehn May 2010 B2
7716037 Precoda et al. May 2010 B2
7801720 Satake et al. Sep 2010 B2
7813918 Muslea et al. Oct 2010 B2
7822596 Elgazzar et al. Oct 2010 B2
7925494 Cheng et al. Apr 2011 B2
7957953 Moore Jun 2011 B2
7974833 Soricut et al. Jul 2011 B2
7974976 Yahia et al. Jul 2011 B2
8060360 He Nov 2011 B2
8145472 Shore et al. Mar 2012 B2
8214196 Yamada et al. Jul 2012 B2
8219382 Kim et al. Jul 2012 B2
8234106 Marcu et al. Jul 2012 B2
8244519 Bicici et al. Aug 2012 B2
8249854 Nikitin et al. Aug 2012 B2
8265923 Chatterjee et al. Sep 2012 B2
8275600 Bilac et al. Sep 2012 B2
8296127 Marcu et al. Oct 2012 B2
8315850 Furuuchi et al. Nov 2012 B2
8326598 Macherey et al. Dec 2012 B1
8380486 Soricut et al. Feb 2013 B2
8433556 Fraser et al. Apr 2013 B2
8442813 Popat May 2013 B1
8468149 Lung et al. Jun 2013 B1
8504351 Waibel et al. Aug 2013 B2
8543563 Nikoulina et al. Sep 2013 B1
8548794 Koehn Oct 2013 B2
8600728 Knight et al. Dec 2013 B2
8615389 Marcu Dec 2013 B1
8655642 Fux Feb 2014 B2
8666725 Och Mar 2014 B2
8676563 Soricut et al. Mar 2014 B2
8694303 Hopkins et al. Apr 2014 B2
8762128 Brants et al. Jun 2014 B1
8825466 Wang et al. Sep 2014 B1
8831928 Marcu et al. Sep 2014 B2
8886515 Van Assche Nov 2014 B2
8886517 Soricut et al. Nov 2014 B2
8886518 Wang et al. Nov 2014 B1
8942973 Viswanathan Jan 2015 B2
8943080 Marcu et al. Jan 2015 B2
8977536 Och Mar 2015 B2
8990064 Marcu et al. Mar 2015 B2
20010009009 Iizuka Jul 2001 A1
20010029455 Chin et al. Oct 2001 A1
20020002451 Sukehiro Jan 2002 A1
20020013693 Fuji Jan 2002 A1
20020040292 Marcu Apr 2002 A1
20020046018 Marcu et al. Apr 2002 A1
20020046262 Heilig et al. Apr 2002 A1
20020059566 Delcambre et al. May 2002 A1
20020078091 Vu et al. Jun 2002 A1
20020083029 Chun et al. Jun 2002 A1
20020087313 Lee et al. Jul 2002 A1
20020099744 Coden et al. Jul 2002 A1
20020107683 Eisele Aug 2002 A1
20020111788 Kimpara Aug 2002 A1
20020111789 Hull Aug 2002 A1
20020111967 Nagase Aug 2002 A1
20020143537 Ozawa et al. Oct 2002 A1
20020152063 Tokieda et al. Oct 2002 A1
20020169592 Aityan Nov 2002 A1
20020188438 Knight et al. Dec 2002 A1
20020188439 Marcu Dec 2002 A1
20020198699 Greene et al. Dec 2002 A1
20020198701 Moore Dec 2002 A1
20020198713 Franz et al. Dec 2002 A1
20030009322 Marcu Jan 2003 A1
20030023423 Yamada et al. Jan 2003 A1
20030040900 D'Agostini Feb 2003 A1
20030061022 Reinders Mar 2003 A1
20030129571 Kim Jul 2003 A1
20030144832 Harris Jul 2003 A1
20030154071 Shreve Aug 2003 A1
20030158723 Masuichi et al. Aug 2003 A1
20030176995 Sukehiro Sep 2003 A1
20030182102 Corston-Oliver et al. Sep 2003 A1
20030191626 Al-Onaizan et al. Oct 2003 A1
20030204400 Marcu et al. Oct 2003 A1
20030216905 Chelba et al. Nov 2003 A1
20030217052 Rubenczyk et al. Nov 2003 A1
20030233222 Soricut et al. Dec 2003 A1
20040006560 Chan et al. Jan 2004 A1
20040015342 Garst Jan 2004 A1
20040023193 Wen et al. Feb 2004 A1
20040024581 Koehn et al. Feb 2004 A1
20040030551 Marcu et al. Feb 2004 A1
20040035055 Zhu et al. Feb 2004 A1
20040044530 Moore Mar 2004 A1
20040059708 Dean et al. Mar 2004 A1
20040068411 Scanlan Apr 2004 A1
20040098247 Moore May 2004 A1
20040102956 Levin May 2004 A1
20040102957 Levin May 2004 A1
20040111253 Luo et al. Jun 2004 A1
20040115597 Butt Jun 2004 A1
20040122656 Abir Jun 2004 A1
20040167768 Travieso et al. Aug 2004 A1
20040167784 Travieso et al. Aug 2004 A1
20040193401 Ringger et al. Sep 2004 A1
20040230418 Kitamura Nov 2004 A1
20040237044 Travieso et al. Nov 2004 A1
20040260532 Richardson et al. Dec 2004 A1
20050021322 Richardson et al. Jan 2005 A1
20050021323 Li Jan 2005 A1
20050021517 Marchisio Jan 2005 A1
20050026131 Elzinga et al. Feb 2005 A1
20050033565 Koehn Feb 2005 A1
20050038643 Koehn Feb 2005 A1
20050055199 Ryzchachkin et al. Mar 2005 A1
20050055217 Sumita et al. Mar 2005 A1
20050060160 Roh et al. Mar 2005 A1
20050075858 Pournasseh et al. Apr 2005 A1
20050086226 Krachman Apr 2005 A1
20050102130 Quirk et al. May 2005 A1
20050125218 Rajput et al. Jun 2005 A1
20050149315 Flanagan et al. Jul 2005 A1
20050171757 Appleby Aug 2005 A1
20050204002 Friend Sep 2005 A1
20050228640 Aue et al. Oct 2005 A1
20050228642 Mau et al. Oct 2005 A1
20050228643 Munteanu et al. Oct 2005 A1
20050234701 Graehl et al. Oct 2005 A1
20050267738 Wilkinson et al. Dec 2005 A1
20060004563 Campbell et al. Jan 2006 A1
20060015320 Och Jan 2006 A1
20060015323 Udupa et al. Jan 2006 A1
20060018541 Chelba et al. Jan 2006 A1
20060020448 Chelba et al. Jan 2006 A1
20060041428 Fritsch et al. Feb 2006 A1
20060095248 Menezes et al. May 2006 A1
20060111891 Menezes et al. May 2006 A1
20060111892 Menezes et al. May 2006 A1
20060111896 Menezes et al. May 2006 A1
20060129424 Chan Jun 2006 A1
20060136824 Lin Jun 2006 A1
20060142995 Knight et al. Jun 2006 A1
20060150069 Chang Jul 2006 A1
20060165040 Rathod et al. Jul 2006 A1
20060167984 Fellenstein et al. Jul 2006 A1
20060190241 Goutte et al. Aug 2006 A1
20070015121 Johnson et al. Jan 2007 A1
20070016400 Soricutt et al. Jan 2007 A1
20070016401 Ehsani et al. Jan 2007 A1
20070033001 Muslea et al. Feb 2007 A1
20070043553 Dolan Feb 2007 A1
20070050182 Sneddon et al. Mar 2007 A1
20070078654 Moore Apr 2007 A1
20070078845 Scott et al. Apr 2007 A1
20070083357 Moore et al. Apr 2007 A1
20070094169 Yamada et al. Apr 2007 A1
20070112553 Jacobson May 2007 A1
20070112555 Lavi et al. May 2007 A1
20070112556 Lavi et al. May 2007 A1
20070122792 Galley et al. May 2007 A1
20070168202 Changela et al. Jul 2007 A1
20070168450 Prajapat et al. Jul 2007 A1
20070180373 Bauman et al. Aug 2007 A1
20070208719 Tran Sep 2007 A1
20070219774 Quirk et al. Sep 2007 A1
20070233460 Lancaster et al. Oct 2007 A1
20070233547 Younger et al. Oct 2007 A1
20070250306 Marcu et al. Oct 2007 A1
20070265825 Cancedda et al. Nov 2007 A1
20070265826 Chen et al. Nov 2007 A1
20070269775 Andreev et al. Nov 2007 A1
20070294076 Shore et al. Dec 2007 A1
20080040095 Sinha et al. Feb 2008 A1
20080052061 Kim et al. Feb 2008 A1
20080065478 Kohlmeier et al. Mar 2008 A1
20080109209 Fraser et al. May 2008 A1
20080114583 Al-Onaizan et al. May 2008 A1
20080154581 Lavi et al. Jun 2008 A1
20080183555 Walk Jul 2008 A1
20080195461 Li et al. Aug 2008 A1
20080215418 Kolve et al. Sep 2008 A1
20080249760 Marcu et al. Oct 2008 A1
20080270109 Och Oct 2008 A1
20080270112 Shimohata Oct 2008 A1
20080281578 Kumaran et al. Nov 2008 A1
20080300857 Barbaiani et al. Dec 2008 A1
20080307481 Panje Dec 2008 A1
20090076792 Lawson-Tancred Mar 2009 A1
20090083023 Foster et al. Mar 2009 A1
20090106017 D'Agostini Apr 2009 A1
20090119091 Sarig May 2009 A1
20090125497 Jiang et al. May 2009 A1
20090198487 Wong et al. Aug 2009 A1
20090234634 Chen et al. Sep 2009 A1
20090234635 Bhatt et al. Sep 2009 A1
20090241115 Raffo et al. Sep 2009 A1
20090248662 Murdock Oct 2009 A1
20090313006 Tang Dec 2009 A1
20090326912 Ueffing Dec 2009 A1
20090326913 Simard et al. Dec 2009 A1
20100005086 Wang et al. Jan 2010 A1
20100017293 Lung et al. Jan 2010 A1
20100042398 Marcu et al. Feb 2010 A1
20100138210 Seo et al. Jun 2010 A1
20100138213 Bicici et al. Jun 2010 A1
20100174524 Koehn Jul 2010 A1
20110029300 Marcu et al. Feb 2011 A1
20110066643 Cooper et al. Mar 2011 A1
20110082683 Soricut et al. Apr 2011 A1
20110082684 Soricut et al. Apr 2011 A1
20110191410 Refuah et al. Aug 2011 A1
20110225104 Soricut et al. Sep 2011 A1
20120016657 He et al. Jan 2012 A1
20120096019 Manickam et al. Apr 2012 A1
20120116751 Bernardini et al. May 2012 A1
20120136646 Kraenzel et al. May 2012 A1
20120150529 Kim et al. Jun 2012 A1
20120253783 Castelli et al. Oct 2012 A1
20120265711 Assche Oct 2012 A1
20120278302 Choudhury et al. Nov 2012 A1
20120323554 Hopkins et al. Dec 2012 A1
20130018650 Moore et al. Jan 2013 A1
20130024184 Vogel et al. Jan 2013 A1
20130103381 Assche Apr 2013 A1
20130238310 Viswanathan Sep 2013 A1
20130290339 Luvogt et al. Oct 2013 A1
20140006003 Soricut et al. Jan 2014 A1
20140019114 Travieso et al. Jan 2014 A1
20140149102 Marcu et al. May 2014 A1
20140188453 Marcu et al. Jul 2014 A1
20150106076 Hieber et al. Apr 2015 A1
Foreign Referenced Citations (29)
Number Date Country
2408819 Nov 2006 CA
2475857 Dec 2008 CA
2480398 Jun 2011 CA
1488338 Apr 2010 DE
202005022113.9 Feb 2014 DE
0469884 Feb 1992 EP
0715265 Jun 1996 EP
0933712 Aug 1999 EP
0933712 Jan 2001 EP
1488338 Sep 2004 EP
1488338 Apr 2010 EP
1488338 Apr 2010 ES
1488338 Apr 2010 FR
1488338 Apr 2010 GB
1072987 Feb 2006 HK
1072987 Sep 2010 HK
07244666 Sep 1995 JP
10011447 Jan 1998 JP
11272672 Oct 1999 JP
2004501429 Jan 2004 JP
2004062726 Feb 2004 JP
2008101837 May 2008 JP
5452868 Jan 2014 JP
03083710 Oct 2003 WO
WO03083709 Oct 2003 WO
2004042615 May 2004 WO
2007056563 May 2007 WO
2011041675 Apr 2011 WO
2011162947 Dec 2011 WO
Non-Patent Literature Citations (269)
Entry
Ueffing et al, Using pos information for statistical machine translation into morphologically rich languages. In EACL '03: Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics, pp. 347-354.
Niessen et al, “Statistical machine translation with scarce resources using morphosyntactic information”, Jun. 2004, Computational Linguistics, vol. 30, issue 2, pp. 181-204.
Ueffing et al “Using POS Information for Statistical Machine Translation into Morphologically Rich Languages”, Apr. 12-17, 2003, In Proc. 10th Conference of the European Chapter of the Association for Computational Linguistics (EACL), pp. 347-354.
Koehn, “Noun Phrase Translation”, 2003, Ph.D. thesis, University of Southern California, pp. i-105.
“Abney, Steven P. , ““Parsing by Chunks,”” 1991, Principle-Based Parsing: Computation and Psycholinguistics, vol. 44,pp. 257-279.”
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.
Al-Onaizan et al., “Statistical Machine Translation,” 1999, JHU Summer Tech Workshop, Final Report, pp. 1-42.
“Al-Onaizan et al., ““Translating with Scarce Resources,”” 2000, 17th National Conference of the American Associationfor Artificial Intelligence, Austin, TX, pp. 672-678.”
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.
“Al-Onaizan, Y. and Knight, K., ““Named Entity Translation: Extended Abstract””, 2002, Proceedings of HLT-02, SanDiego, CA.”
“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.”
“Alshawi et al., ““Learning Dependency Translation Models as Collections of Finite-State Head Transducers,”” 2000, Computational Linguistics, vol. 26, pp. 45-60.”
Alshawi, Hiyan, “Head Automata for Speech Translation”, Proceedings of the ICSLP 96, 1996, Philadelphia, Pennslyvania.
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.
“Arbabi et al., ““Algorithms for Arabic name transliteration,”” Mar. 1994, IBM Journal of Research and Development,vol. 38, Issue 2, pp. 183-194.”
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.
Ballesteros, L. et al., “Phrasal Translation and Query Expansion Techniques for Cross-Language Information Retrieval,” SIGIR 97, Philadelphia, PA, © 1997, pp. 84-91.
“Bangalore, S. and Rambow, O., ““Evaluation Metrics for Generation,”” 2000, Proc. of the 1st International NaturalLanguage Generation Conf., vol. 14, pp. 1-8.”
“Bangalore, S. and Rambow, O., ““Using TAGs, a Tree Model, and a Language Model for Generation,”” May 2000,Workshop TAG+5, Paris.”
“Bangalore, S. and Rambow, O., ““Corpus-Based Lexical Choice in Natural Language Generation,”” 2000, Proc. ofthe 38th Annual ACL, Hong Kong, pp. 464-471.”
“Bangalore, S. and Rambow, O., ““Exploiting a Probabilistic Hierarchical Model for Generation,”” 2000, Proc. of 18thconf. on Computational Linguistics, vol. 1, pp. 42-48.”
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.
“Barnett et al., ““Knowledge and Natural Language Processing,”” Aug. 1990, Communications of the ACM, vol. 33,Issue 8, pp. 50-71.”
“Baum, Leonard, ““An Inequality and Associated Maximization Technique in Statistical Estimation for ProbabilisticFunctions of Markov Processes””, 1972, Inequalities 3:1-8.”
Berhe, G. et al., “Modeling Service-based Multimedia Content Adaptation in Pervasive Computing,” CF '04 (Ischia, Italy) Apr. 14-16, 2004, pp. 60-69.
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.
“Brants, Thorsten, ““TnT—A Statistical Part-of-Speech Tagger,”” 2000, Proc. of the 6th Applied Natural LanguageProcessing Conference, Seattle.”
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.
“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.”
“Brown et al., ““A Statistical Approach to Machine Translation,”” Jun. 1990, Computational Linguistics, vol. 16, No. 2, pp. 79-85.”
Brown et al., “Word-Sense Disambiguation Using Statistical Methods,” 1991, Proc. of 29th Annual ACL, pp. 264-270.
“Brown et al., ““The Mathematics of Statistical Machine Translation: Parameter Estimation,”” 1993, ComputationalLinguistics, vol. 19, Issue 2, pp. 263-311.”
“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.”
“Callan et al., ““TREC and TIPSTER 'Experiments with Inquery,”” 1994, Information Processing and Management,vol. 31, Issue 3, pp. 327-343.”
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.
“Carl, Michael. ““A Constructivist Approach to Machine Translation,”” 1998, New Methods of Language Processingand Computational Natural Language Learning, pp. 247-256.”
“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.”
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.
Cheung et al., “Sentence Alignment in Parallel, Comparable, and Quasi-comparable Corpora”, In Proceedings of LREC, 2004, pp. 30-33.
Chinchor, Nancy, “MUC-7 Named Entity Task Definition,” 1997, Version 3.5.
“Clarkson, P. and Rosenfeld, R., ““Statistical Language Modeling Using the CMU-Cambridge Toolkit””, 1997, Proc. ESCA Eurospeech, Rhodes, Greece, pp. 2707-2710.”
Cohen et al., “Spectral Bloom Filters,” SIGMOD 2003, Jun. 9-12, 2003, ACM pp. 241-252.
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.
Cohen, Yossi, “Interpreter for FUF,” (available at ftp:/ilftp.cs.bgu.ac.il/ pUb/people/elhadad/fuf-life.lf) (downloaded Jun. 1, 2008).
“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.”
Covington, “An Algorithm to Align Words for Historical Comparison”, Computational Linguistics, 1996,vol. 22, No. 4, pp. 481-496.
“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.”
“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.”
“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).”
“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.”
Eisner, Jason, “Learning Non-Isomorphic Tree Mappings for Machine Translation,” 2003, in Proc. of the 41st Meeting of the ACL, pp. 205-208.
Elhadad et al., “Floating Constraints in Lexical Choice”, 1996, ACL, vol. 23 No. 2, pp. 195-239.
“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.”
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.
“Elhadad, Michael, ““FUF: the Universal Unifier User Manual Version 5.2””, 1993, Department of Computer Science,Ben Gurion University, Beer Sheva, Israel.”
“Elhadad, Michael, ““Using Argumentation to Control Lexical Choice: A Functional Unification Implementation””,1992, Ph.D. Thesis, Graduate School of Arts and Sciences, Columbia University.”
“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),”
Fleming, Michael et al., “Mixed-Initiative Translation of Web Pages,” AMTA 2000, LNAI 1934, Springer-Verlag, Berlin, Germany, 2000, pp. 25-29.
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.
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.
Fung et al, “Mining Very-Non-Parallel Corpora: Parallel Sentence and Lexicon Extraction via Bootstrapping and EM”, In EMNLP 2004.
“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.”
“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.”
“Gale, W. and Church, K., ““A Program for Aligning Sentences in Bilingual Corpora,”” 1991, 29th Annual Meeting ofthe ACL, pp. 177-183.”
Gale, W. and Church, K., “A Program for Aligning Sentences in Bilingual Corpora,” 1993, Computational Linguisitcs, vol. 19, No. 1, pp. 177-184.
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.
Galley et al., “What's in a translation rule?”, 2004, in Proc. of HLT/NAACL '04, pp. 1-8.
Gaussier et al, “A Geometric View on Bilingual Lexicon Extraction from Comparable Corpora”, In Proceedings of ACL 2004, July.
“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.”
“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.”
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.
“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.”
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.
Gupta et al., “Kelips: Building an Efficient and Stable P2P DHT thorough Increased Memory and Background Overhead,” 2003 IPTPS, LNCS 2735, pp. 160-169.
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.
“Hatzivassiloglou, V. et al., ““Unification-Based Glossing””, 1995, Proc. of the International Joint Conference onArtificial Intelligence, pp. 1382-1389.”
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.
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.
Bikel, D., Schwartz, R., and Weischedei, R., “An Algorithm that Learns What's in a Name,” Machine Learning 34, 211-231 (1999).
Imamura et al., “Feedback Cleaning of Machine Translation Rules Using Automatic Evaluation,” 2003 Computational Linguistics, pp. 447-454.
Imamura, Kenji, “Hierarchical Phrase Alignment Harmonized with Parsing”, 2001, in Proc. of NLPRS, Tokyo.
“Jelinek, F., ““Fast Sequential Decoding Algorithm Using a Stack””, Nov. 1969, IBM J. Res. Develop., vol. 13, No. 6, pp. 675-685.”
“Jones, K. Sparck, ““Experiments in Relevance Weighting of Search Terms””, 1979, Information Processing &Management, vol. 15, Pergamon Press Ltd., UK, pp. 133-144.”
Klein et al., “Accurate Unlexicalized Parsing,” Jul. 2003, in Proc. of the 41st Annual Meeting of the ACL, pp. 423-430.
“Knight et al., ““Integrating Knowledge Bases and Statistics in MT,”” 1994, Proc. of the Conference of the Associationfor Machine Translation in the Americas.”
“Knight et al., ““Filling Knowledge Gaps in a Broad-Coverage Machine Translation System””, 1995, Proc. ofthe14th International Joint Conference on Artificial Intelligence, Montreal, Canada, vol. 2, pp. 1390-1396.”
“Knight, K. and Al-Onaizan, Y., ““A Primer on Finite-State Software for Natural Language Processing””, 1999 (available at http://www.isLedullicensed-sw/carmel).”
Knight, K. and Al-Onaizan, Y., “Translation with Finite-State Devices,” Proceedings of the 4th AMTA Conference, 1998.
“Knight, K. and Chander, I., ““Automated Postediting of Documents,””1994, Proc. of the 12th Conference on ArtificialIntelligence, pp. 779-784.”
Knight, K. and Graehl, J., “Machine Transliteration”, 1997, Proc. of the ACL-97, Madrid, Spain, pp. 128-135.
“Knight, K. and Hatzivassiloglou, V., ““Two-Level, Many-Paths Generation,”” 1995, Proc. of the 33rd AnnualConference of the ACL, pp. 252-260.”
“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.”
“Knight, K. and Marcu, D., ““Statistics-Based Summarization—Step One: Sentence Compression,”” 2000, AmericanAssociation for Artificial Intelligence Conference, pp. 703-710.”
“Knight, K. and Yamada, K., ““A Computational Approach to Deciphering Unknown Scripts,”” 1999, Proc. of the ACLWorkshop on Unsupervised Learning in Natural Language Processing.”
“Knight, Kevin, ““A Statistical MT Tutorial Workbook,”” 1999, JHU Summer Workshop (available at http://www.isLedu/natural-language/mUwkbk.rtf).”
Knight, Kevin, “Automating Knowledge Acquisition for Machine Translation,” 1997, AI Magazine, vol. 18, No. 4.
“Knight, Kevin, ““Connectionist Ideas and Algorithms,”” Nov. 1990, Communications of the ACM, vol. 33, No. 11, pp. 59-74.”
“Knight, Kevin, ““Decoding Complexity in Word-Replacement Translation Models””, 1999, Computational Linguistics, vol. 25, No. 4.”
“Knight, Kevin, ““Integrating Knowledge Acquisition and Language Acquisition””, May 1992, Journal of Appliedlntelligence, vol. 1, No. 4.”
“Knight, Kevin, ”“Learning Word Meanings by Instruction,-1996, Proc. of the D National Conference on Artificiallntelligence, vol. 1, pp. 447-454.”
Knight, Kevin, “Unification: A Multidisciplinary Survey,” 1989, ACM Computing Surveys, vol. 21, No. 1.
Koehn, Philipp, “Noun Phrase Translation,” A PhD Dissertation for the University of Southern California, pp. xiii, 23, 25-57, 72-81, Dec. 2003.
“Koehn, P. and Knight, K., ““ChunkMT: Statistical Machine Translation with Richer Linguistic Knowledge,”” Apr. 2002,Information Sciences Institution.”
“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.”
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.
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.
Yasuda et al., “Automatic Machine Translation Selection Scheme to Output the Best Result,” Proc of LREC, 2002, pp. 525-528.
Huang et al. Automatic Extraction of Named Entity Translingual Equivalence Based on Multi-Feature Cost Minimization. In Proceedings of the ACL 2003 Workshop on Multilingual and Mixed-Language Name Entry Recognition.
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.
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.
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.
Proz.com, Rates for proofreading versus Translating, http://www.proz.comfforum/business—issues/202-rates—for—proofreading—versus—translating.html, Apr. 23, 2009, retrieved Jul. 13, 2012.
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.
Graehl, J and Knight, K, May 2004, Training Tree Transducers, In NAACL-HLT (2004), pp. 105-112.
Liu et al., “Context Discovery Using Attenuated Bloom Filters in Ad-Hoc Networks,” Springer, pp. 13-25, 2006.
First Office Action mailed Jun. 7, 2004 in Canadian Patent Application 2408819, filed May 11, 2001.
First Office Action mailed Jun. 14, 2007 in Canadian Patent Application 2475857, filed Mar. 11, 2003.
Office Action mailed Mar. 26, 2012 in German Patent Application 10392450.7, filed Mar. 28, 2003.
First Office Action mailed Nov. 5, 2008 in Canadian Patent Application 2408398, filed Mar. 27, 2003.
Second Office Action mailed Sep. 25, 2009 in Canadian Patent Application 2408398, filed Mar. 27, 2003.
First Office Action mailed Jan. 3, 2005 in European Patent Application No. 03716920.8, filed Mar. 27, 2003.
Second Office Action mailed Nov. 9, 2006 in European Patent Application No. 03716920.8, filed Mar. 27, 2003.
Third Office Action mailed Apr. 30, 2008 in European Patent Application No. 03716920.8, filed Mar. 27, 2003.
Office Action mailed Oct. 25, 2011 in Japanese Patent Application 2007-536911 filed Oct. 12, 2005.
Office Action mailed Jul. 24, 2012 in Japanese Patent Application 2007-536911 filed Oct. 12, 2005.
Final Office Action mailed Apr. 1, 2013 in Japanese Patent Application 2007-536911 filed Oct. 12, 2005.
Office Action mailed May 13, 2005 in Chinese Patent Application 1812317.1, filed May 11, 2001.
Office Action mailed Apr. 21, 2006 in Chinese Patent Application 1812317.1, filed May 11, 2001.
Office Action mailed Jul. 19, 2006 in Japanese Patent Application 2003-577155, filed Mar. 11, 2003.
Office Action mailed 2007 in Chinese Patent Application 3805749.2, filed Mar. 11, 2003.
Office Action mailed Feb. 27, 2007 in Japanese Patent Application 2002-590018, filed May 13, 2002.
Office Action mailed Jan. 26, 2007 in Chinese Patent Application 3807018.9, filed Mar. 27, 2003.
Office Action mailed Dec. 7, 2005 in Indian Patent Application 2283/DELNP/2004, filed Mar. 11, 2003.
Office Action mailed Mar. 31, 2009 in European Patent Application 3714080.3, filed Mar. 11, 2003.
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.
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.
Office Action mailed Aug. 29, 2006 in Japanese Patent Application 2003-581064, filed Mar. 27, 2003.
Office Action mailed Jan. 26, 2007 in Chinese Patent Application 3807027.8, filed Mar. 28, 2003.
Office Action mailed Jul. 25, 2006 in Japanese Patent Application 2003-581063, filed Mar. 28, 2003.
Huang et al., “A syntax-directed translator with extended domain of locality,” Jun. 9, 2006, In Proceedings of the Workshop on Computationally Hard Problems and Joint Inference in Speech and Language Processing, pp. 1-8, New York City, New York, Association for Computational Linguistics.
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/.
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.
Huang et al., “Statistical syntax-directed translation with extended domain of locality,” Jun. 9, 2006, In Proceedings of AMTA, pp. 1-8.
Notice of Allowance mailed Dec. 10, 2013 in Japanese Patent Application 2007-536911, filed Oct. 12, 2005.
Makoushina, J. “Translation Quality Assurance Tools: Current State and Future Approaches.” Translating and the Computer, Dec. 17, 2007, 29, 1-39, retrieved at <http://www.palex.ru/fc/98/Translation%20Quality%Assurance%20Tools.pdf>.
Specia et al. “Improving the Confidence of Machine Translation Quality Estimates,” MT Summit XII, Ottawa, Canada, 2009, 8 pages.
Soricut et al., “TrustRank: Inducing Trust in Automatic Translations via Ranking”, published in Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (Jul. 2010), pp. 612-621.
U.S. non-provisional patent U.S. Appl. No. 11/454,212, filed Jun. 15, 2006.
Editorial Free Lancer Association, Guidelines for Fees, https://web.archive.org/web/20090604130631/http://www.the-efa.org/res/code—2.php, Jun. 4, 2009, retrieved Aug. 9, 2014.
Lynn Wasnak, “Beyond the Basics How Much should I Charge”, https://web.archive.org/web/20070121231531/http://www.writersmarket.com/assets/pdf/How—Much—Should—I—Charge.pdf, Jan. 21, 2007, retrieved Aug. 19, 2014.
Summons to Attend Oral Proceedings mailed Sep. 18, 2014 in German Patent Application 10392450.7, filed Mar. 28, 2003.
Examination Report mailed Jul. 22,2013 in German Patent Application 112005002534.9, filed Oct. 12, 2005.
Leusch et al.. , “A Novel String-to-String Distance Measure with Applications to Machine Translation Evaluation”, 2003, https://www-i6.informatik.rwth-aachen.de, pp. 1-8.
Oflazer, Kemal., “Error-tolerant Finite-state Recognition with Application to Morphological Analysis and Spelling Correction”, 1996, https://www.ucrel.lancs.ac.uk, pp. 1-18.
Snover et al., “A Study of Translation Edit Rate with Targeted Human Annotation”, 2006, https://www.cs.umd.edu/˜snover/pub/amta06/ter—amta.pdf, pp. 1-9.
Levenshtein, V.I., “Binary Codes Capable of Correcting Deletions, Insertions, and Reversals”, 1966, Doklady Akademii Nauk SSSR, vol. 163, No. 4, pp. 707-710.
Office Action mailed Feb. 2, 2015 in German Patent Application 10392450.7, filed Mar. 28, 2003.
Abney, Steven P. , “Parsing by Chunks,” 1994, Bell Communications Research, pp. 1-18.
“Rapp, Reinhard, ““Identifying Word Translations in Non-Parallel Texts,”” 1995, 33rd Annual Meeting of the ACL, pp. 320-322.”
Rayner et al.,“Hybrid Language Processing in the Spoken Language Translator,” IEEE, pp. 107-110. Apr 1997.
“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.”
“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.”
“Resnik, Philip, ““Mining the Web for Bilingual Text,”” 1999, 37th Annual Meeting of the ACL, College Park, MD, pp. 527-534.”
Rich, E. and Knight, K., “Artificial Intelligence, Second Edition,” 1991, McGraw-Hili Book Company [redacted].
“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.”
“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.”
Rogati et al., “Resource Selection for Domain-Specific Cross-Lingual IR,” ACM 2004, pp. 154-161.
Zhang, R. et al., “The NiCT-ATR Statistical Machine Translation System for the IWLST 2006 Evaluation,” submitted to IWSLT, 2006.
“Russell, S. and Norvig, P., ““Artificial Intelligence: A Modern Approach,”” 1995, Prentice-Hall, Inc., New Jersey [redacted—table of contents].”
“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.”
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.
“Schutze, Hinrich, ““Automatic Word Sense Discrimination,”” 1998, Computational Linguistics, Special Issue on WordSense Disambiguation, vol. 24, Issue 1, pp. 97-123.”
“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.”
Kumar, S. and Byrne, W., “Minimum Bayes-Risk Decoding for Statistical Machine Translation.” HLTNACCL Conference. Mar. 2004, 8 pages.
“Shapiro, Stuart (ed.), ““Encyclopedia of Artificial Intelligence, 2nd edition—, vol.D 2,1992, John Wiley & Sons Inc;” Unification” article, K. Knight, pp. 1630-1637.”
Shirai, S., “A Hybrid Rule and Example-based Method for Machine Translation,” NTT Communication Science Laboratories, pp. 1-5, Dec. 1997.
“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.”
“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.”
“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.”
“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.”
“Sun et al., ““Chinese Named Entity Identification Using Class-based Language Model,”” 2002, Proc. of 19th International Conference on Computational Linguistics, Taipei, Taiwan, vol. 1, pp. 1-7.”
Tanaka, K. and Iwasaki, H. “Extraction of Lexical Translations from Non-Aligned Corpora,” Proceedings of COLING 1996.
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.
“Taylor et al., ““The Penn Treebank: An Overview,”” In A. Abeill (ed.), D Treebanks: Building and Using ParsedCorpora, 2003, pp. 5-22.”
“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.”
“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.”
“Tillmann et al., ““A DP Based Search Using Monotone Alignments in Statistical Translation,”” 1997, Proc. of theAnnual Meeting of the ACL, pp. 366-372.”
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.
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.
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).
“Ueffing et al., ““Generation of Word Graphs in Statistical Machine Translation,”” 2002, Proc. of Empirical Methods inNatural Language Processing (EMNLP), pp. 156-163.”
Varga et al., “Parallel Corpora for Medium Density Languages”, In Proceedings of RANLP 2005, pp. 590-596.
“Veale, T. and Way, A., ““Gaijin: A Bootstrapping, Template-Driven Approach to Example-Based MT,”” 1997, Proc. ofNew Methods in Natural Language Processing (NEMPLP97), Sofia, Bulgaria.”
Vogel et al., “The CMU Statistical Machine Translation System,” 2003, Machine Translation Summit IX, New Orleans, LA.
“Vogel et al., ““The Statistical Translation Module in the Verbmobil System,”” 2000, Workshop on Multi-Lingual SpeechCommunication, pp. 69-74.”
“Vogel, S. and Ney, H., ““Construction of a Hierarchical Translation Memory,”” 2000, Proc. of Cooling 2000, Saarbrucken, Germany, pp. 1131-1135.”
“Wang, Y. and Waibel, A., ““Decoding Algorithm in Statistical Machine Translation,”” 1996, Proc. of the 35th AnnualMeeting of the ACL, pp. 366-372.”
“Wang, Ye-Yi, ““Grammar Inference and Statistical Machine Translation,”” 1998, Ph.D Thesis, Carnegie MellonUniversity, Pittsburgh, PA.”
“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.”
“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.”
“Wu, Dekai, ““A Polynomial-Time Algorithm for Statistical Machine Translation,”” 1996, Proc. of 34th Annual Meeting ofthe ACL, pp. 152-158.”
“Wu, Dekai, ““Stochastic Inversion Transduction Grammars and Bilingual Parsing of Parallel Corpora,”” 1997, Computational Linguistics, vol. 23, Issue 3, pp. 377-403.”
“Yamada, K. and Knight, K. ““A Syntax-Based Statistical Translation Model,”” 2001, Proc. of the 39th AnnualMeeting of the ACL, pp. 523-530.”
“Yamada, K. and Knight, K., ““A Decoder for Syntax-Based Statistical MT,”” 2001, Proceedings of the 40th AnnualMeeting of the ACL, pp. 303-310.”
Yamada K., “A Syntax-Based Statistical Translation Model,” 2002 PhD Dissertation, pp. 1-141.
“Yamamoto et al., ““A Comparative Study on Translation Units for Bilingual Lexicon Extraction,”” 2001, JapanAcademic Association for Copyright Clearance, Tokyo, Japan.”
Yamamoto et al, “Acquisition of Phrase-level Bilingual Correspondence using Dependency Structure” In Proceedings of COLING-2000, pp. 933-939.
“Yarowsky, David, ““Unsupervised Word Sense Disambiguation Rivaling Supervised Methods,”” 1995, 33rd AnnualMeeting of the ACL, pp. 189-196.”
“Koehn, P. and Knight, K., ““Knowledge Sources for Word-Level Translation Models,”” 2001, Conference on EmpiricalMethods in Natural Language Processing.”
“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.”
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.
“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.”
“Langkilde, I. and Knight, K., ““Generation that Exploits Corpus-Based Statistical Knowledge,”” 1998, Proc. of theCOLING-ACL, pp. 704-710.”
“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.”
“Langkilde, Irene, ““Forest-Based Statistical Sentence Generation,”” 2000, Proc. of the 1st Conference on NorthAmerican chapter of the ACL, Seattle, WA, pp. 170-177.”
“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.”
“Langkilde-Geary, Irene, ““An Empirical Verification of Coverage and Correctness for a General-PurposeSentence Generator,”” 1998, Proc. 2nd Int'l Natural Language Generation Conference.”
“Lee-Y.S.,““Neural Network Approach to Adaptive Learning: with an Application to Chinese HomophoneDisambiguation,”” IEEE pp. 1521-1526”, Jul. 2001.
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, Jul. 2003.
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/font11, pp. 1-4.
“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.”
“Manning, C. and Schutze, H., ““Foundations of Statistical Natural Language Processing,”” 2000, The MIT Press, Cambridge, MA [redacted].”
“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.”
“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.”
“Marcu, Daniel, ““Discourse trees are good indicators of importance in text,”” 1999, Advances in Automatic TextSummarization, The MIT Press, Cambridge, MA.”
“Marcu, Daniel, ““Instructions for Manually Annotating the Discourse Structures of Texts,”” 1999, DiscourseAnnotation, pp. 1-49.”
“Marcu, Daniel, ““The Rhetorical Parsing of Natural Language Texts,”” 1997, Proceedings of ACLIEACL '97, pp. 96-103.”
“Marcu, Daniel, ““The Rhetorical Parsing, Summarization, and Generation of Natural Language Texts,”” 1997, Ph. D.Thesis, Graduate Department of Computer Science, University of Toronto.”
“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.”
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.
McDevitt, K. et al., “Designing of a Community-based Translation Center,” Technical Report TR-03-30, Computer Science, Virginia Tech, © 2003, pp. 1-8.
“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.”
“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.”
“Melamed, I. Dan, ““Empirical Methods for Exploiting Parallel Texts,”” 2001, MIT Press, Cambridge, MA [table ofcontents].”
“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.”
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.
“Mikheev et al., ““Named Entity Recognition without Gazeteers,”” 1999, Proc. of European Chapter of the ACL, Bergen,Norway, pp. 1-8.”
“Miike et al., ““A Full-Text Retrieval System with a Dynamic Abstract Generation Function,”” 1994, Proceedings of SIGIR'94, pp. 152-161.”
“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.”
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.
“Monasson et al., ““Determining Computational Complexity from Characteristic ‘Phase Transitions’,”” Jul. 1999, NatureMagazine, vol. 400, pp. 133-137.”
“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.”
Nagao, K. et al., “Semantic Annotation and Transcoding: Making Web Content More Accessible,” IEEE Multimedia, vol. 8, Issue Apr. 2-Jun. 2001, pp. 69-81.
“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.”
“Niessen, 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.”
Norvig, Peter, “Techniques for Automatic Memoization with Applications to Context-Free Parsing”, Compuational Linguistics,1991, pp. 91-98, vol. 17, No. 1.
“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.”
Och et al. “A Smorgasbord of Features for Statistical Machine Translation.” HLTNACCL Conference. Mar. 2004, 8 pages.
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.
“Och, F. and Ney, H, ““Improved Statistical Alignment Models,”” 2000, 38th Annual Meeting of the ACL, Hong Kong, pp. 440-447.”
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.
Och, F. and Ney, H., “A Systematic Comparison of Various Statistical Alignment Models,” Computational Linguistics, 2003, 29:1, 19-51.
Papineni et al., ““Bleu: A Method for Automatic Evaluation of Machine Translation,”” 2001, IBM Research Report.
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.
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.
“PLA et al., ““Tagging and Chunking with Bigrams,”” 2000, Proc. of the 18th Conference on Computational Linguistics, vol. 2, pp. 614-620”
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.
Rapp, Reinhard, Automatic Identification of Word Translations from Unrelated English and German Corpora, 1999, 37th Annual Meeting of the ACL, pp. 519-526.
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.
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.
“Patent Cooperation Treaty International Preliminary Report on Patentability and The Written Opinion, Internationalapplication No. PCT/US2008/004296, Oct. 6, 2009, 5 pgs.”
Document, Wikipedia.com, web.archive.org (Feb. 24, 2004) <http://web.archive.org/web/20040222202831 /http://en.wikipedia.org/wikiiDocument>, Feb. 24, 2004.
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>.
Koehn, P. et al, “Statistical Phrase-Based Translation,” Proceedings of HLT-NAACL 2003 Main Papers , pp. 48-54 Edmonton, May-Jun. 2003.
Abney, S.P., “Stochastic Attribute Value Grammars”, Association for Computional Linguistics, 1997, pp. 597-618.
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.Idc.upenn.edu/W/W02/W02-1039.pdf>.
Tillman, C., et al, “Word Reordering and a Dynamic Programming Beam Search Algorithm for Statistical Machine Translation” <URL: http://acl.ldc.upenn.edu/J/J03/J03-1005.pdf> Mar. 1, 2003.
Wang, W., et al. “Capitalizing Machine Translation” In HLT-NAACL '06 Proceedings Jun. 2006. <http://www.isi.edu/natural-language/mt/hlt-naac1-06-wang.pdf>.
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.Idc.upenn.edu/W/W00/W00-0507.pdf>.