Intelligent routing services and systems

Information

  • Patent Grant
  • 11475227
  • Patent Number
    11,475,227
  • Date Filed
    Thursday, October 22, 2020
    4 years ago
  • Date Issued
    Tuesday, October 18, 2022
    2 years ago
Abstract
A source content routing system is described for distributing source content received from clients such as documents, to translators for performing translation services on the source content. The routing system extracts source content features, which may be represented as vectors. The vectors may be assembled into an input matrix, which may be processed using an artificial neural network, classifier, perceptron, CRF model, and/or the like, to select a translator such as a machine translation system and/or human. The translator provides translation services translation from a source language to a target language, post translation editing, proof reading, quality analysis of a machine, quality analysis of human translation, and/or the like and returns the product to the content routing system or clients.
Description
FIELD OF THE PRESENT TECHNOLOGY

The present disclosure relates to the technical field of machine translation systems and methods. More particularly, the present invention is in the technical field of distribution of documents between machine translators, human translators, and post translation editors.


BACKGROUND

The translation process in a typical language service provider is orchestrated by a human Project Manager who collects requests from customers or prospects. The project manager then analyzes content of the source documents to price the work. The project manage then makes a decision based on personal experience and knowledge of available translators on how best distribute the source documents to the translators. The project manager is also responsible for ensuring delivery of the completed work back to the customer. Currently, tools do not exist for equipping project managers to make fast and accurate decisions.


SUMMARY

Various embodiments of the present technology include a hardware solution for a way of improving the routing of source content such as documents to translators for translation services. The present technology improves on a human selection of a translator manually based personal experience with known translators and a cursory read of a source document to develop an impression of the content. Instead, the claimed technology provides a way of selecting of routing a document that includes performing a stochastic analysis of the source content to extract source content feature and generate vectors from the extracted features. These feature vectors may then be assembled into an input matrix representing source content features. A router may use an artificial neural network including hidden layers along with weight matrixes representing connections between layers and a target matrix representing translators for processing the input matrix to select a translator, and may transfer the document to the selected translator for translation services.





BRIEF DESCRIPTION OF THE DRAWINGS

Certain embodiments of the present technology are illustrated by the accompanying figures. It will be understood that the figures are not necessarily to scale and that details not necessary for an understanding of the technology or that render other details difficult to perceive may be omitted. It will be understood that the technology is not necessarily limited to the particular embodiments illustrated herein.



FIG. 1 is a block diagram illustrating an environment for routing documents to translators, in accordance with aspects of the technology.



FIG. 2 is a block diagram illustrating a server for routing source content to translators, in accordance with aspects of the technology.



FIG. 3 is a block diagram illustrating exemplary details of the content analyzer of FIG. 2.



FIG. 4 illustrates an algorithm for summarizing source content.



FIG. 5 is an illustration of a multilayer perceptron.



FIG. 6 is a diagram of an undirected probabilistic graphical CRF model for entity recognition using CFR.



FIG. 7 is a diagrammatic representation of an example machine in the form of a computer system, within which a set of instructions for causing the machine to perform any of one or more of the methodologies discussed herein may be executed.





DETAILED DESCRIPTION

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the present technology. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more of the same or other features, integers, steps, operations, elements, components, and/or groups thereof.


It will be understood that like or analogous elements and/or components referred to herein may be identified throughout the drawings with like reference characters. It will be further understood that several of the figures are merely schematic representations and/or block diagrams of the present technology. As such, some of the components may have been distorted from their actual scale for pictorial clarity.



FIG. 1 is a block diagram illustrating an environment 100 for routing documents to translators. The environment 100 of FIG. 1 includes a network 110, a content distribution server 112, source content 102, profiles of a plurality of translators (translators profiles 104), a job profile 106, and a plurality of translators 1-N, i.e., translators 116. The content distribution server 112 is a special purpose computer system configured specifically to receive source content 102 and route the source content 102 to one or more of the plurality of translators 116. In some embodiments, the content distribution server 112 is configured to receive source content 102 via a network 110. The server may also receive translator profiles 104, and a job profile 106 via the network 110. The content distribution server 112 may route the source content 102 to one or more translators 116 via the network 110 based on an analysis of the source content 102, the translator profiles 104, and the job profile.


In various embodiments, translation services include translation from a source language to a target language, post translation editing, proof reading, quality analysis of a machine, quality analysis of human translation, and/or the like. Translators 116 include machine translation systems, human translators using machine-assisted translation platforms, interactive adaptive machine translations systems, and/or the like.


In various embodiments, the source content 102 includes text, a document, a batch of documents, or a portion of a document. Documents include various combinations of text, images, graphs, drawings, videos, audio, animation, media, web pages, links to web pages, web objects, and/or the like.


The translator profiles include information about translators 116, such as previous work content, quality, speed, schedule, time zone, target language skills (speed, quality, etc.) for one or more target languages, post editing skills (speed, quality, etc.), domain skills for one or more domains, source content in progress, and/or the like. Additional information about the translators 116 includes previous association of a translator with the type of document the job requires (e.g., familiarity with a document may enhance the speed of delivery and consistency); domain preference (e.g., efficiency within a domain); association with a document or similar document; translator native language. Translator quality features include overall quality/rating, translator quality/rating on a given domain/content type, translator experience/qualification, reliability and consistency, translator workload, translator availability, translator preference (comfortable with MT Post Editing). The translators profiles 104 may include information about all the translators 116 or some of the translators 116. In some embodiment the translators profiles 104 include information about translators that are not included in the translators 116.


In various embodiments the job profile 106 includes information about how the job is to be processed, such as target language, cost, margin, time, deadlines, desired quality, translation, post translation editing, inspection, and/or the like.


The content distribution server 112 may route the entire source content 102 to a single translator 116, or a portion of the source content 102 may be routed to the single translator 116. In some embodiments the source content 102 is separated into portions of the content are routed multiple translators 116. For example, source content 102 may include a batch of documents, and the documents may be routed to translators 116 such that part of the documents are routed to a machine translation system, part of the documents are routed to a first human translator 116, part to a second human translator 116, and so on.


It may be appreciated that one or more of the source content 102, translators profiles 104, and/or the job profile 106 may be communicated directly to the content distribution server 112 or may be generated at the content distribution server 112. It may be further appreciated that one or more translators 1-N (translators 116) may be in direct communication with the content distribution server 112. In some embodiments, one or more translators 116 are a part of the content distribution server 112, for example, in the case of a translator that includes machine translation services. The content distribution server 112 may route the source content 102 directly to one or more of the translators 116.


In some embodiments one or more of the network 110, content distribution server 112, source content 102, translators profiles 104, job profiles 106, and a plurality of translators 116 (e.g., machine translator systems) FIG. 1 are implemented within a cloud-based computing environment (not illustrated) In general, a cloud-based computing environment is a resource that typically combines the computational power of a large model of processors and/or that combines the storage capacity of a large model of computer memories or storage devices. For example, systems that provide a cloud resource may be utilized exclusively by their owners; or such systems may be accessible to outside users who deploy applications within the computing infrastructure to obtain the benefit of large computational or storage resources.


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



FIG. 2 is a block diagram illustrating exemplary details of a content distribution server 112 for routing the source content 102 to the translators 116. As discussed elsewhere herein, the content distribution server 112 is a special purpose computer system that includes specific components for accomplishing special tasks. The content distribution server 112 of FIG. 2 includes a content analyzer 200, source content features 202, translators features 204, job features 206, and a router 210. The content analyzer 200 is configured to extract source content features 202 from the source content 102. In various embodiments, the source content features 202 include a summary of the source content 102, keywords in the source content 102, key-phrases in the source content 102, one or more domains identified as being related to the source content 102, one or more entities being recognized as a source of the source content 102, a complexity of the source content 102, a suitability of the source content 102 for machine translation, and/or the like. Each of the source content features 202 may be represented as a vector of the features (content feature vector). In various embodiments, content feature vectors include a summary vector, keywords and key-phrases vector, domains vector, entities vector, complexity vector, and MT suitability vector. In some embodiments, the source content features 202 are represented as a matrix. Each of the content feature vectors (summary vector, keywords and key-phrases vector, domains vector, entities vector, complexity vector, and MT suitability vector) may be used as a column or row of the matrix.


The translators features 204 may be extracted from the translators profiles 104 at the content distribution server 112. In some embodiments, the translators features 204 are generated at the translators profiles 104 and then received from the translators profiles 104. In various embodiments, the translators features 204 include previous work content, quality, speed, schedule, time zone, target language skills (speed, quality, etc.) for one or more target languages, post editing skills (speed, quality, etc.), domain skills for one or more domains, source content 102 in progress, and/or the like. The translators features 204 may be represented as a vector of the features (translator feature vector). In various embodiments, the translator feature vectors represent the previous work content, quality, speed, schedule, time zone, target language skills, post editing skills, domain skills, load, etc. Each of a plurality of translators may be represented by a translator feature vector. The translators features 204 may include a plurality of translator feature vectors, one for each of a plurality of translators. In some embodiments, the translators features 204 are represented as a matrix. Each of the translator feature vectors may be used as a column or row of the matrix.


The job features 206 may be extracted from the job profile 106 at the content distribution server 112. In some embodiments, the job features are generated at the job profile 106 and then received from the job profile 106. In various embodiments, the job features 206 include job information, such as cost, margin, time, quality, target language, and/or the like. The job features 206 may be represented as a vector of the features such as the cost, margin, time, quality, target language, etc.


The router 210 is configured to select translators and route content to the translators. The router 210 may receive the source content features 202, the translators features 204, and the job features 206 as input. The router may select one or more translators 116 based on the source content features 202, translators features 204, and job features 206. The source content features 202 may be received as a matrix or as one or more vectors. Similarly, the translators features 204 and/or the job features 206 may be received as a matrix or one or more vectors. In some embodiments, the router 210 is a special purpose processor for using the source content features 202 in conjunction with translators features 204 and the job features 206 for selecting a translator 116 and routing the source content 102 to the selected translator 116. The source content 102 may be divided into a plurality of portions. The router 210 may select a plurality of translators 116 and one or more portions of the source content 102 may be routed to each of the selected translators 116.


While the content analyzer 200, source content features 202, translators features 204, job features 206, and router 210 of FIG. 2 are illustrated as being components of a content distribution server 112, any combination of one or more of these components may be disposed in a standalone computer system, a mobile device, a cloud-based computing environment, and/or the like. For example, the content analyzer 200 and source content features 202 may be components of the source content 102. Similarly the translator features 204 may be component of the translators profiles 104 and/or a job features 206 may be a component of the job profile 106. While the content distribution server 112 of FIG. 2 is illustrated as including the content analyzer 200, source content features 202, translators features 204, job features 206, and router 210, more or fewer components may be included in the content distribution server 112. For example, the content distribution server 112 may include a machine translation system.



FIG. 3 is a block diagram illustrating exemplary details of the content analyzer 200 of FIG. 2. The content analyzer 200 includes means for extracting source content features 202 represented by vectors from the source content 102. The content analyzer 200 is a special purpose computer system configured specifically to receive source content 102, extract source content features 202 from the received source content 102, and generate vectors representing the extracted source content features 202. The content analyzer 200 of FIG. 3 includes a summarization module 302, a keywords and key-phrases module 304, a domains module 306, an entities module 308, a complexity module 310, and a machine translation suitability module 312. More or fewer modules may be included in the content analyzer 200.


The summarization module 302 includes a means for extracting sentences from the source content 102. The extracted sentences may be represented in the form of vectors for use as source content features 202. The summary features may comprise vector representations of sentences selected from the source content 102. The summarization module 302 may use a centroid based approach that includes neural vector representations of text segments.



FIG. 4 illustrates an algorithm for summarizing source content 102. At 410 each sentence in the source text may be encoded into a vector representation. At step 420, a centroid vector may be computed as a sum of the sentence vector representations encoded in step 410. At step 430, sentences with highest cosine similarity to the centroid vector may be selected for inclusion in summary. The summary features may comprise vector representations of the selected sentences. Persons having ordinary skill in the relevant arts would understand with the present application before them how to use a special purpose computer module to encode sentence text as vector representations, compute centroid vectors from sentence vector representations and determining cosine similarity between sentences, and centroid vectors for use as source content features 202.


The keywords and key-phrases module 304 includes means for extracting keywords and key-phrases from the source content 102. The extracted keywords and key-phrases may be represented in the form of vectors for use as source content features 202. An example of means for extracting keywords and/or key-phrases is nonparametric spherical topic modeling of the source content 102 with word embeddings for extracting keywords and/or key-phrases. Another example is non-parametric latent Dirichlet analysis of the source content 102, for example a hierarchical Dirichlet process mixture model, which allows the number of keywords and/or key-phrases for topics to be unbounded and learned from data. Yet another example is classifying the source content 102 using numerical statistical analysis including term frequency-inverse document frequency (Tf-Idf), for example, to calculate the importance of words and/or word phrases in the source content 102 and rank the words and phrases. The keyword and key-phrase features may comprise vector representations of key words and key-phrases. Persons having ordinary skill in the relevant arts would understand with the present application before them how to construct and use a special purpose computer module to extract keywords and key-phrases using techniques such as nonparametric spherical topic modeling with word embeddings, non-parametric latent Dirichlet analysis, and Tf-Idf technologies applied to source content 102. Persons having ordinary skill in the relevant arts would understand with the present application before them how to generate a vector representation of a plurality of keywords and/or key-phrases for use as a source content feature 202.


The domain identification module 306 includes means for identifying one or more domain of source content 102. The identified domains may be represented in the form of vectors for use as source content features 202. In various embodiments the means includes a multilayer perceptron, a Term Frequency, an Inverse Document Frequency, and a weighted bag of words to generate a domain feature vector. The domain feature vector may include values representing one or more domains that the source content 102 is related to.



FIG. 5 is an illustration of a multilayer perceptron 500. The multilayer perceptron 500 of FIG. 5 includes as inputs the source content 102 and as output the domain feature vector 506. The domain feature vector 506 may include an array of one or more values. Each value may represent a score or probability that the source content 102 is related to a specific domain. In various embodiments, the hidden layers 504 include a weighted bag of words layer, TF layer, IDF layer, and/or the like. Persons having ordinary skill in the relevant arts would understand with the present application before them how to use a special purpose computer module to identify one or more domains for the source content 102 using various combinations of multilayer perceptron 500 and hidden layers 504 including TF, layers, IDF layers, weighted bag of words layers, and/or like technologies, to generate domain feature vectors for use as source content features 202.


The entity recognition module 308 includes means for recognizing named entities in source content 102. The named entities may be represented in the form of vectors for use as source content features 202. In various embodiments the means includes Conditional Random Field model (CFR) and entity recognition technology. CRFs are a type of discriminative undirected probabilistic graphical model. CRF's may be used to encode known relationships between observations and construct consistent interpretations. CRF's are often used for labeling or parsing of sequential data, such as natural language processing. Specifically, CRFs find applications in named entity recognition. Entity recognition (also known as named entity recognition(NER), entity identification, entity chunking and entity extraction) is a subtask of information extraction that seeks to locate and classify named entities occurring in unstructured text, into pre-defined categories such as the person names, organizations, locations, medical codes, time expressions, quantities, monetary values, percentages, etc. The entity feature vector includes values representing one or more categories of entities that occur in the source content 102.



FIG. 6 is a diagram 600 of an undirected probabilistic graphical CRF model for entity recognition using CFR. The diagram 600 includes as inputs the source content 102, which may encode relationships between the source content 102 and sequential data including as observation data in the form of an entity feature vector 602. The entity feature vector 602 may include an array of one or more values. Each value may represent a score or probability that an entity has been recognized or identified in the source content 102. In some embodiments, encoding relationships between the source content 102 and the entity feature vector 602 includes hand crafting the relationships. Persons having ordinary skill in the relevant arts would understand with the present application before them how to use a special purpose computer module to recognize or identify one or more entities in the source content 102 using CFR applied to recognition technologies, to generate entity feature vectors for use as source content features 202.


The complexity module 310 includes means for calculating complexity of the source content 102. The calculated complexity may be represented in the form of vectors for use as source content features 202. In various embodiments the means for calculating complexity of the source content 102 include means for calculating syntactic complexity, lexical complexity, uber index complexity, Flesch Kincade complexity score, and overall complexity, of the source content 102.


Syntactic complexity may be calculated from various combinations of a part of speech ratio, constituency tree depth ration and constituent ratio.


Lexical complexity (sometimes referred to as lexical richness) may be calculated for the source content 102, for example using a Herdan ratio:






TTR
=

V
N





where TTR is a type-token ratio, V is vocabulary, and N is text length. A normalized Herdan Index H may also be calculated from:






H
=


log





V


log





N






Examples of modifications of a Herdan index include those proposed by:







Guiraud





G

=

V

N









Dugast
:




D

=


log





V


log


(

log





N

)










Brunet
:




B

=

N

V

-
k







An Uber index may be calculated from:






UberIndex
=



(

log





tokens

)

2



log





tokens

-

log





types







A Flesch Kincaid score F (or Flesch reading-ease score) may be calculated from a formula:






F
=


2

0


6
.
8


3

5

-


1
.
0


1

5



T
words


T
sentences



-

8


4
.
6




T
syllables


T
words









Where “Twords” is the total number of words, “Tsentencess” is the total number of sentences and “Tsyllables” is the total number of syllables in the source content 102. The meaning of the score F may be indicated by table 1 below.











TABLE 1





Score
School level
Notes







100.0-90.0
5th grade
Very easy to read. Easily understood




by an average 11-year-old student.


 90.0-80.0
6th grade
Easy to read. Conversational English




for consumers.


 80.0-70.0
7th grade
Fairly easy to read.


 70.0-60.0
8th & 9th
Plain English. Easily understood by 13-



grade
to 15-year-old students


 60.0-50.0
10th to 12th
Fairly difficult to read.



grade



 50.0-30.0
College
Difficult to read.


30.0-0.0
College
Very difficult to read. Best understood



graduate
by university graduates.









The complexity features may comprise vector representations of complexity scores. Persons having ordinary skill in the relevant arts would understand with the present application before them how to construct and use a special purpose computer module to calculate complexity scores for syntactic complexity, lexical complexity, Uber index, FleschKincaid score, and overall complexity using information about the source content 102 and techniques including POS ratio, Constituency tree depth ration, constituent ratio, vocabulary size, text length, normalized Herdan Index log tokens, log types, total words, total sentences, total syllables applied to source content 102 to generate complexity vectors for use as source content features 202.


The machine translation (MT) suitability module 312 includes means for calculating machine translation suitability of the source content 102. The calculated MT suitability may be represented in the form of vectors for use as source content features 202. In various embodiments the means for calculating machine translatability include calculating a MT suitability score where:


Twords is the total number of words in source content 102


P=probability of each sentence of source content 102


Raw LM score per sentence is LM=−log(P)


The Document perplexity may be calculated from the relation:






Perplexity
=




Sentences


LM


e





T
words








The ME suitability score may be calculated as:







MT
suitability

=

max


(

5
,

min


(


5
-

4



Perplexity
-
10


7

0




,
1

)



)







where the scaled document perplexity is calculated using a language model trained on NMT parallel data resources.


The MT suitability features may comprise vector representations of the suitability of the source content 102 for translation using one or more machine translation technologies. Persons having ordinary skill in the relevant arts would understand with the present application before them how to construct and use a special purpose computer module to calculate a MT suitability score using techniques such as sentence probability, LM score, document Perplexity and the equation for MT suitability score applied to source content 102 to generate vector representations of MT suitability for use as source content features 202. A different MT suitability score may be generated from the source content 102 for each of a plurality of types of machine translators. It is noteworthy that MT suitability is an important feature to use in determining where to route a document because machine translation is substantially faster and less expensive than human translation.


In various embodiments, the router 210 is a neural network, a classifier, a matrix, a search engine, decision tree, a finite state acceptor, and/or the like. In the example of the router 210 being a neural network, the source content features 202 may be received by the router 210 from the content analyzer 200 as an input matrix representing the source content features 202, or as a plurality of feature vectors representing the source content features 202.


For example, each of the source features generated by the content analyzer 200 using modules 302-312 may be represented as one or more feature vectors. The router 210 may receive the plurality of feature vectors from the content analyzer 200 and assemble the feature vectors into an input matrix including columns comprising the feature vectors. In some embodiments, the content analyzer 200 assembles the generated feature vectors into columns of the input matrix. Input matrix is then received from the content analyzer 200 by the router 210 as a representation of the source content features 202. The router 210 may also assemble feature vectors for the translators features 204 and/or the job features 206 into additional columns of the input matrix.


The router 210 may be an artificial neural network (e.g., a multi-layer perceptron) for processing complex inputs such as presented by the input matrix assembled from feature vectors generated by the content analyzer 200 and representing source content features 202. Connections between one or more layers of the neural network may be represented by a weight matrix or more than one weight matrix. A target matrix may be formed, e.g., having columns for the translators 116. The translator columns may be vectors that include weights representing delivery predictions for features such as cost, margin, time, quality. Persons having ordinary skill in the relevant arts would understand with the present application before them how to construct and use a special purpose computer router 210 using artificial neural network technology to train a weight matrix and process to process an input matrix and target matrix for selecting one or more translators 116 to provide translation services for source content 102.


In some embodiments, a router 210 is a classifier that ranks translators based on the source content 102 and/or the source content features 202, translators features 204, and job features 206. The router 210 may output a delivery prediction score for each of various categories of delivery prediction for each translator. Delivery prediction categories for each translator 116 may include cost, margin, time, quality, and/or the like. The delivery prediction scores may be used for selecting a translator 116.



FIG. 7 is a diagrammatic representation of an example machine in the form of a computer system 700, within which a set of instructions for causing the machine to perform any of one or more of the methodologies discussed herein may be executed. In various example embodiments, the machine operates as a standalone device (e.g. content distribution server 112, MT translator 116, content analyzer 200, router 210, and/or other components described in the figures and specification) or may be connected (e.g., networked) to other machines. In a networked deployment, the machine may operate in the capacity of a server (e.g. content distribution server 112) or a client machine, in a server-client network environment, or as a peer machine in a peer-to-peer (or distributed) network environment. The machine may be a personal computer (PC), a tablet PC, a set-top box (STB), a personal digital assistant (PDA), a cellular telephone, a portable music player (e.g., a portable hard drive audio device such as an Moving Picture Experts Group Audio Layer 3 (MP3) player), a web appliance, a network router, switch or bridge, or any machine capable of executing a set of instructions (sequential or otherwise) that specify actions to be taken by that machine. Further, while only a single machine is illustrated in FIG. 7, the term “machine” shall also be taken to include any collection of machines that individually or jointly execute a set (or multiple sets) of instructions to perform any one or more of the methodologies discussed herein


The example computer system 700 includes a processor or multiple processor(s) 702 (e.g., a central processing unit (CPU), a graphics processing unit (GPU), or both), and a main memory 706 and static memory 708, which communicate with each other via a bus 722. The computer system 700 may further include a video display 712 (e.g., a liquid crystal display (LCD)). The computer system 700 may also include an input/output device(s) 714 including alpha-numeric input devices (e.g., a keyboard), a cursor control device (e.g., a mouse, trackball, touchpad, touch screen, etc.), a voice recognition or biometric verification unit (not shown), a drive unit 716 (also referred to as disk drive unit). Input devices may include interfaces for receiving source content 102 via the network 110 and/or directly from clients, and output interfaces for routing source content 102 via the network 110 and/or directly to translators 116. The computer system 700 may further include a signal generation device 720 (e.g., a speaker) and a network interface device 710.


The disk drive unit 716 includes a computer or machine-readable medium 718 on which is stored one or more sets of instructions and data structures (e.g., instructions 704) embodying or utilizing any one or more of the methodologies or functions described herein. The instructions 704 may also reside, completely or at least partially, within the main memory 706 and/or within the processor(s) 702 during execution thereof by the computer system 700. The main memory 706 and the processor(s) 702 may also constitute machine-readable media.


The instructions 704 may further be transmitted or received over a network (e.g., network 110, see FIG. 1) via the network interface device 710 utilizing any one of a number of well-known transfer protocols (e.g., Hyper Text Transfer Protocol (HTTP)). While the machine-readable medium 718 is shown in an example embodiment to be a single medium, the term “computer-readable medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database and/or associated caches and servers) that store the one or more sets of instructions. The term “computer-readable medium” shall also be taken to include any medium that is capable of storing, encoding, or carrying a set of instructions for execution by the machine and that causes the machine to perform any one or more of the methodologies of the present application, or that is capable of storing, encoding, or carrying data structures utilized by or associated with such a set of instructions. The term “computer-readable medium” shall accordingly be taken to include, but not be limited to, solid-state memories, optical and magnetic media, and carrier wave signals. Such media may also include, without limitation, hard disks, floppy disks, flash memory cards, digital video disks, random access memory (RAM), read only memory (ROM), and/or the like. The example embodiments described herein may be implemented in an operating environment comprising software installed on a computer, in hardware, or in a combination of software and hardware.


One skilled in the art will recognize that the Internet service may be configured to provide Internet access to one or more computing devices that are coupled to the Internet service, and that the computing devices may include one or more processors, buses, memory devices, display devices, input/output devices, and the like. Furthermore, those skilled in the art may appreciate that the Internet service may be coupled to one or more databases, repositories, servers, and the like, which may be utilized in order to implement any of the embodiments of the disclosure as described herein.


The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present technology has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the present technology in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the present technology. Exemplary embodiments were chosen and described in order to best explain the principles of the present technology and its practical application, and to enable others of ordinary skill in the art to understand the present technology for various embodiments with various modifications as are suited to the particular use contemplated.


Aspects of the present technology are described above with reference to flow diagram illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the present technology. It will be understood that each block of the flow diagram illustrations and/or block diagrams, and combinations of blocks in the flow diagram illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flow diagram and/or block diagram block or blocks.


These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flow diagram and/or block diagram block or blocks.


The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flow diagram and/or block diagram block or blocks.


The flow diagram and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present technology. In this regard, each block in the flow diagram or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flow diagram illustration, and combinations of blocks in the block diagrams and/or flow diagram illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.


In the following description, for purposes of explanation and not limitation, specific details are set forth, such as particular embodiments, procedures, techniques, etc. in order to provide a thorough understanding of the present invention. However, it will be apparent to one skilled in the art that the present invention may be practiced in other embodiments that depart from these specific details.


Reference throughout this specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, the appearances of the phrases “in one embodiment” or “in an embodiment” or “according to one embodiment” (or other phrases having similar import) at various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. Furthermore, depending on the context of discussion herein, a singular term may include its plural forms and a plural term may include its singular form. Similarly, a hyphenated term (e.g., “on-demand”) may be occasionally interchangeably used with its non-hyphenated version (e.g., “on demand”), a capitalized entry (e.g., “Software”) may be interchangeably used with its non-capitalized version (e.g., “software”), a plural term may be indicated with or without an apostrophe (e.g., PE's or PEs), and an italicized term (e.g., “N+1”) may be interchangeably used with its non-italicized version (e.g., “N+1”). Such occasional interchangeable uses shall not be considered inconsistent with each other.


The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a,” “an,” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.


It is noted at the outset that the terms “coupled,” “connected,” “connecting,” “electrically connected,” etc., are used interchangeably herein to generally refer to the condition of being electrically/electronically connected. Similarly, a first entity is considered to be in “communication” with a second entity (or entities) when the first entity electrically sends and/or receives (whether through wireline or wireless means) information signals (whether containing data information or non-data/control information) to the second entity regardless of the type (analog or digital) of those signals. It is further noted that various figures (including component diagrams) shown and discussed herein are for illustrative purpose only, and are not drawn to scale.


While specific embodiments of, and examples for, the system are described above for illustrative purposes, various equivalent modifications are possible within the scope of the system, as those skilled in the relevant art with the instant application before them will recognize. For example, while processes or steps are presented in a given order, alternative embodiments may perform routines having steps in a different order, and some processes or steps may be deleted, moved, added, subdivided, combined, and/or modified to provide alternative or sub-combinations. Each of these processes or steps may be implemented in a variety of different ways. Also, while processes or steps are at times shown as being performed in series, these processes or steps may instead be performed in parallel, or may be performed at different times.


While various embodiments have been described above, it should be understood that they have been presented by way of example only, and not limitation. The descriptions are not intended to limit the scope of the invention to the particular forms set forth herein. To the contrary, the present descriptions are intended to cover such alternatives, modifications, and equivalents as may be included within the spirit and scope of the invention as defined by the appended claims and otherwise appreciated by one of ordinary skill in the art. Thus, the breadth and scope of a preferred embodiment should not be limited by any of the above-described exemplary embodiments.

Claims
  • 1. A router for distributing source content from clients to translators for translation services, the router comprising a processor and memory, the processor executing instructions in the memory to: obtain extracted source content feature vectors from source content feature vectors of source content received from a client;select a translator using a weight matrix representing connections between layers of a neural network, the neural network configured to receive a target matrix and an input matrix, the input matrix based on the extracted source content feature vectors, and generate a selection of a translator from the target matrix; anda server for receiving the source content feature vectors from the client, and for transferring the received source content to the selected translator for performing translation services.
  • 2. The router of claim 1, wherein the processor is configured to assemble the input matrix from the source content feature vectors by using the extracted source content feature vectors as input for columns of the input matrix.
  • 3. The router of claim 1, wherein the processor is configured to use a summarization module, a keywords and key-phrases module, a domains module, an entities module, a complexity module, and a machine translation suitability module.
  • 4. The router of claim 1, wherein the router is a component of a server that includes a network interface configured for receiving the source content from the client via a network and routing the source content to the selected translator via the network.
  • 5. The router of claim 1, wherein the processor is configured to: receive a translator feature for each of a plurality of translators;receive a plurality of job features; andreceive the source content for the translation services.
  • 6. The router of claim 5, wherein the processor is configured to process the input matrix using the target matrix and the weight matrix for the neural network to select the translator from the plurality of translators.
  • 7. The router of claim 6, wherein the source content feature vectors include a summarization of the source content, a plurality of keywords and key-phrases in the source content, an identification of a domain of the source content, a recognition of a plurality of named entities in the source content, a calculation of complexity of the source content, and a calculation of suitability of the source content for machine translation.
  • 8. The router of claim 7, wherein the processor is configured to: generate a translator feature vector for each of the plurality of translators, each translator feature vector including one or more values representing a feature of the translator; andassemble the target matrix using each translator feature vector as input for columns of the matrix.
  • 9. The router of claim 1, wherein the source content feature vectors include a plurality of summarization features of a document including selecting sentences from the source content.
  • 10. The router of claim 1, wherein the processor is configured to: select a plurality of sentences representing a document summary feature for inclusion in a summary vector, the sentences selected by: encoding each sentence of the document into a vector representation;obtaining a ‘centroid’ vector as a sum of these vector representations; andselecting sentences having a highest cosine similarity to the centroid for inclusion in the summary vector; andassemble the input matrix using the summary vector as input for a column of the matrix.
  • 11. The router of claim 1, wherein the processor is configured to: select a plurality of keywords and key-phrases;generate a keyword vector representation of the plurality of keywords and key-phrases; andassemble the input matrix using the keyword vector as input for a column of the matrix.
  • 12. The router of claim 11, wherein the processor is configured to use at least one of nonparametric spherical topic modeling with word embeddings, non-parametric latent Dirichlet analysis, and Tf/Idf analysis.
  • 13. The router of claim 1, wherein the processor is configured to: identify one or more domains using multilayer perceptron with inverse document frequency weighted bag-of-words feature vector;generate a domain feature vector representation of the one or more identified domains; andassemble the input matrix using the domain feature vector as input for a column of the matrix.
  • 14. The router of claim 1, wherein the processor is configured to: identify one or more named entities using a Conditional Random Field model for entity recognition;generate an entity feature vector representation of the one or more identified named entities; andassemble the input matrix using the entity feature vector as input for a column of the matrix.
  • 15. The router of claim 1, wherein the processor is configured to: calculate a plurality of complexity values;generate a complexity feature vector including the plurality of complexity values; andassemble the input matrix using the complexity feature vector as input for a column of the matrix.
  • 16. The router of claim 15, wherein the processor is configured to calculate a syntactic complexity, a lexical complexity, an uber index, a Flesch Kincaid score, and an overall complexity.
  • 17. A system for routing source content to translators for translation services, the system comprising: a router including an artificial neural network and a weight matrix representing connections between layers of the artificial neural network, the router configured to receive a target matrix and an input matrix for a source document; and generate a selection of a translator from the target matrix; anda server that transfers the source content to the selected translator for performing translation services.
  • 18. The system of claim 17, wherein the router uses source content feature vectors of the source document as input for columns of the input matrix.
  • 19. The system of claim 18, wherein the router is configured to receive a job vector representing a plurality of features and using the job vector as a column of the input matrix.
  • 20. The system of claim 19, wherein the router is configured to: receive a plurality of translator feature vectors, each translator feature vector representing a plurality of translation features for a translator of a plurality of translators; andassemble the target matrix using the translator feature vectors as columns of the target matrix.
CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation of U.S. patent application Ser. No. 16/226,419, filed on Dec. 19, 2018 and titled “Intelligent Routing Services and Systems,” which claims priority and benefit to U.S. provisional patent application Ser. No. 62/610,591 filed on Dec. 27, 2017 and titled “Intelligent Routing Services and Systems,” which are all incorporated by reference herein in their entirety.

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