Content page URL translation

Information

  • Patent Grant
  • 8942973
  • Patent Number
    8,942,973
  • Date Filed
    Friday, March 9, 2012
    12 years ago
  • Date Issued
    Tuesday, January 27, 2015
    9 years ago
Abstract
The present technology may translate a content of a web page such as content locator (e.g., a uniform resource locator (URL)) from a source language to a target language. The content locator may be associated with a content page. The translation may involve dividing the content locator into segment tokens in a first language, followed by translating, transliterating or not changing a segment token. The processed tokens are then reassembled in a second language. The translation may be provided by a translation module through a content page provided by a network browser.
Description
BACKGROUND OF THE INVENTION

The widespread use of the Internet allows people to view information from all over the world. People in one country may view web pages that are based in another country. Though this provides for widespread sharing of information, international web browsing may result in users of one country using one language viewing web content in a web page using a different language. As a result, people may not be able to read web page content from different countries using a different language.


Translation services for web pages exist but have several disadvantages. Typical web page translation services provide a translation of a sentence by detecting parts of the sentence, such as a noun, verb or other part. The translation of the sentence often relies on grammar rules for each language. Existing translation techniques do not apply well to content not having the structure of a sentence.


What is needed is an improved translation technique for web-based content.


SUMMARY OF THE INVENTION

The present technology may translate a content of a web page such as content locator (e.g., a uniform resource locator (URL)) from a source language to a target language. The content locator may be associated with a content page such as a web page or a portion of content page. The translation may involve dividing the content locator into segment tokens in a first language, followed by translating, transliterating or not changing a segment token. The processed tokens are then reassembled in a second language. The translation may be provided by a translation module, such as a network browser plug in, through a content page provided by a network browser. The translation may be performed based on translation account settings associated with the user. The account may be maintained by a remote machine translation service.


In an embodiment, a content locator may be translated by receiving a request by a network browser for a content page located at a content locator. A content page and the content locator may be associated with a first language. Next, a translation may automatically be provided for the content locator in a second language by the network browser. The network browser may include a translation module configured to provide the translation of the content locator to the network browser.


According to some embodiments, the present technology may be directed to methods for translating a content locator. The methods may comprise: (a) determining at least one segment of the content locator; (b) transforming the at least one segment from a source language into a target language by at least one of translation or transliteration; and (c) transmitting the transformed at least one segment in the target language for display on a network browser of a client device.


According to other embodiments, the present technology may be directed to systems for translating a content locator. The systems may include: (a) a memory for storing executable instructions; (b) a processor for executing the executable instructions; (c) a translation module stored in memory and executable by the processor to: (i) determine at least one segment of the content locator; and (ii) transform the at least one segment from a source language into a target language by at least one of translation or transliteration; and (d) a communications module stored in memory and executable by the processor to transmit the transformed at least one segment in the target language for display on a network browser of a client device.


According to additional embodiments, the present technology may be directed to non-transitory computer readable storage media having a computer program embodied thereon, the computer program may be executed by a processor in a computing system to perform a method for translating a content locator. The method may comprise: (a) determining at least one segment of the content locator; (b) transforming the at least one segment from a source language into a target language by at least one of translation or transliteration; and (c) transmitting the transformed at least one segment in the target language for display on a network browser of a client device.





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 illustrates an exemplary network browser interface with content locator translations.



FIG. 2A is a block diagram of an exemplary system for providing machine translation.



FIG. 2B is a block diagram of an exemplary network-based translation application.



FIG. 3 is a flowchart of an exemplary method for providing a translation of a content locator.



FIG. 4 is a flowchart of an exemplary method for translating a content locator.



FIG. 5 is a flowchart of an exemplary method for translating a content locator.



FIG. 6 is a block diagram of an exemplary computing device.





DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS

Generally speaking, the use of non-roman characters in content locators such as uniform resource locators URLs has recently gained the approval of Internet authorities. Non-limiting examples of content locators include uniform resource indicators, uniform resource locators, uniform resource names, domain names, and so forth. One non-limiting example of a URL that comprises only roman characters includes http://www.example.com.


An exemplary content locator such as a domain name with non-roman characters may include www.custom character.com. End users who browse the Internet may encounter such URLs and may not be able to understand them. Such non-roman URLs may confuse end users who are only familiar with roman character URLs, or those not familiar with the language of the URL.


Translation of these non-standard URLs may not be amicable to typical Machine Translation (MT) systems and methods because such technology translates content in traditional sentence formats. Often times, web addresses are not in any discernible sentence format. Web addresses may include multiple combined words, abbreviations, and other combinations of characters that may or may not have a sentence structure.


The present technology may transform non-roman URLs from a source language into one or more target languages. The term transformation may include, but is not limited to, methods for converting characters or groups of characters from a source language into one or more target languages such as translation, transliteration, along with other processes that would be known to one of ordinary skill in the art with the present disclosure before them. Exemplary uses for such technology may include situations when an end user encounters a foreign web page (e.g., web page with content and content locators in a different language from their natural language) and is unable to read the URL. The present technology may provide mechanisms by which the end user may mouse over the URL box and generate a translation of the URL into one or more additional languages (for example, the language specified in the language preference of the browser). In additional embodiments, the present technology may automatically convert the content locators.


The present technology may translate a content of a web page such as content locator from a source language to a target language. The content locator may be associated with a content page such as a web page or a portion of content page. The translation may involve dividing the content locator into segment tokens in a first language, followed by translating, transliterating, or not changing a segment token. The processed tokens are then reassembled in a second language. The translation may be provided by a translation module, such as a network browser plugin, through a content page provided by a network browser. The translation may be performed based on translation account settings associated with the user or a common corporate account. Once downloaded and installed, the plugin may link to the account of a specific user within the company, and in other embodiments the plugin may be pointed to link to a common corporate account.



FIG. 1 illustrates an exemplary network browser interface with content locator translations. FIG. 1 includes an interface consisting of a content page 100 provided by a network browser.


Generally speaking, prior to accessing the content page 100, a translation plugin may be installed into the network browser. Examples of a network browser include “Internet Explorer” by Microsoft Corporation, “Firefox” by Mozilla, and other applications used for browsing content over a world wide web.


Once the plugin is installed, an end user may direct the translation plugin to “auto detect and translate to/from their source language setting (e.g., English)”. A plurality of selectable target languages may be available for selection from a dropdown list.


For the duration of a browsing session, or until the preference is changed, the system may automatically translate content locators from a source language to one or more target languages. That is, once the end user has specified one or more target languages, the end user may enter a URL into the network browser, in source language such as English. The end user may then click on the plugin, which causes the system to automatically translate the URL into the closest match based on how the URL is segmented, along with which segments are transliterated, translated, and which segments remain unchanged.


It will be understood that if an end user directs the network browser to a URL that is in a different language from the target language specified in the plugin and/or encounter a URL embedded in a web page where the URL is in another language, mousing over the URL should provide same combined translation/transliteration/no change combination visual output in the target language.


Content page 100 may include content page drop down menu 110, translation module menu 120, content page operation buttons 130, content locator window 140, text box 144, a first content window 150, a second content window 160, and a third content window 170.


Content page 100 of FIG. 1 may include typical features of a network browser. For example, content page drop down menu 110 may include menus for file commands, edit commands, browsing history commands and bookmark commands. The drop down menus are used to configure the content page and the network browser operation. Content page operation buttons 130 may include a back button, forward button, refresh button, stop button and home button. These buttons are typical to those provided in a network browser interface.


Translation module menu 120 may be provided by a translation module and allows a user of the network browser to indicate a language in which to provide a translation of a content locator. The translation module menu 120 may be a “pull down” menu with a list of languages. A user may select a target language from translation module menu 120. Translated content will be provided in the selected target language.


Content locator window 140 may provide the content locator for the current page provided through the network browser. In some embodiments, the content locator window 140 may provide a uniform resource locator (URL) for the current content page provided by the network browser. For example, when a cursor is placed over the content locator window 140 as indicated in FIG. 1, a text box may be presented with a translation of the content locator in a target language as indicated by a text box 144. The translation of the content locator is part translator token and part copy. In some embodiments, the translation of the content locator may be presented to the user in a different way, such as within content locator window 140. The translation may be initiated by another type of input or event.


The first content window 150 indicates textual content which reads “all right kandalz”. The second content window 160 illustrates four graphic images 162, 164, 166, and 168 depicting different types of candles. The third content window 170 includes a list of items associated with links. A corresponding content locator text box is provided for selected links. The text links are associated with different content pages, in this case within the domain of the present content page. When a cursor is placed over a link, or an object associated with a link, a translation for the link is provided in a target language. For example, the list includes “Holiday Candles”, “Kandalz Locations”, “No Scent” and a “contact” text. Cursor 175 is placed over the “Holiday Candles” text. Accordingly, a content locator text box with a translation of the link associated with the text is provided as text box 176. Cursor 177 is placed over the “No Scent” text, and a content locator text box 178 is provided with a translation of the corresponding link.



FIG. 2A is a block diagram of an exemplary system 200 for providing machine translation. The system of FIG. 2A included computing device 205, network 225, third party web server 250, web server 230 and application server 235.


Computing device 205 communicates with network 225 and includes network browser 210. Computing device 205 may also include client translation application 220, which may operate similarly to network-based translation application 240 on the application server 235. Network browser 210 may be used to provide an interface such as that shown in FIG. 1. Examples of a network browser include “Internet Explorer” by Microsoft Corporation, “Firefox” by Mozilla, and other applications used for browsing content over a world wide web.


Translation module 215 may be used to coordinate a translation of a content locator or other content provided through a network browser interface including a content page, such as a URL processed with network browser 210. The translation module 215 may determine a target language to translate the content locator to, manage the translation and provide the translation through the network browser 210.


Network 225 may be a public or private local area network, wide area network, cloud-based networks or other network, or combinations of networks for facilitating the transfer of data between one or more devices or servers.


Third party web server 250 may include content page data provided through network browser 210. In particular, third party web server 250 may include third party web site content 255, which is provided through network browser 210. The content page data may be associated with a content locator.


Web server 230 may communicate with network 225 and application server 235 and may process requests received from computing device 205 over network 225. Web server 230 may process requests for content itself and request that application server 235 to process a received request. Application server 235 may provide a web-based application such as network-based translation application 240. Network-based translation application 240 may be an application server 235 or may be implemented as a client application (such as client translation application 220).



FIG. 2B is a block diagram of an exemplary network-based translation application 240. Network-based translation application 240 may perform a translation in response to information received from translation module 215 of computing device 205.


Network-based translation application 240 may include communications module 260, interface module 265, translation engine 270, and quality prediction engine 275. Network-based translation application 240 may be executed to manage communication with a customer through customer computing device 205, interface with remote devices, translate a document to generate translated content, and provide a quality prediction of a generated translation. It is noteworthy that the network-based translation application 240 may include additional or fewer modules, engines, or components, and still fall within the scope of the present technology. As used herein, the term “module” may also refer to any of an application-specific integrated circuit (ASIC), an electronic circuit, a processor (shared, dedicated, or group) that executes one or more software or firmware programs, a combinational logic circuit, and/or other suitable components that provide the described functionality.


Communications module 260 may be executed to allow an indication to be received via a user interface to provide a translation of a document from a source language to a target language, as well as a prediction of a trust level of the translation. The communications module 260 may also facilitate accessing the document to be translated such as in response to an indication by a user.


The interface module 265 can be executed to provide a graphical user interface through a network browser 210, for example as a content page provided by a web browser, which enables a user to request the translation and corresponding trust-level prediction.


The translation engine 270 comprises a machine translation engine capable of translating from a source language to a target language. Such translation capability may result from training the translation engine 270 on various training data. In some embodiments, the network-based translation application 240 may include more than one translation engine 270. Additionally, the translation engine 270 may be based on statistical-translation techniques, non-statistical-translation techniques, or a combination thereof.


As depicted in FIG. 2B, the translation engine 270 is associated with the training dataset 280. According to other exemplary embodiments, the translation engine 270 can be associated with any number of training datasets. The training dataset 280 may comprise documents in source languages and corresponding translations of those documents in target languages (i.e., parallel corpora). The translated documents may be human-generated or machine-generated. The training dataset 280 may be domain-specific or generic.


According to exemplary embodiments, the quality-prediction engine 275 is executable to predict a trust level of a translation provided by the translation engine 270. The trust-level prediction is indicative of translational accuracy of translations generated by the translation engine 270. The granularity of the trust-level prediction may extend from translations or transliterations of single characters, segments of characters, or an entire content locator. The trust level is predicted independent of a human-generated translation or other human intervention.


An example of network-based translation application 240 is described in U.S. patent application Ser. No. 12/572,021, entitled “Providing Machine-Generated Translation and Corresponding Trust Levels,” which was filed on Oct. 1, 2009, and is incorporated herein by reference in its entirety.



FIG. 3 is a flowchart of an exemplary method 300 for providing a translation of a content locator. First, translation settings for a user account are set at step 310. It will be understood that in embodiments where the translation module 215 includes a plugin, the establishment of a user account may or may not be required. The translation settings may be set through a web service, for example, through web server 230 and stored by application server 235. The settings may identify translation and parameters for performing a translation on behalf of methods to a particular user, such as use of a dictionary, training system, weighting information, and other data. Translation settings may also include settings associated with quality level of a translation and other parameters of a translation.


A translation module 215 may be configured with a second language for a network browser 210 at step 320. A translation module, such as translation module 215 within a network browser 210, may receive input of a target language selection to which a URL or content locator may be translated. A translation module 215 may be implemented as a network browser plugin and may provide a drop down menu or other input mechanism for a user to select one or more target languages. In other embodiments, the translation module 215 may be implemented as an add in, script code or another suitable implementation (either hardware or software) within the network browser 210 or in communication with network browser 210 on computing device 205. When executed, the translation module 215 may accept an input of a selected language to utilize for translating content.


A request may be received for a content page located at a content locator at step 330. The request may be received as an input URL entered into the content locator window 140 of the content page 100, selection of a link or other content page portion that requires the content page be provided with a network browser 210, or a portion of a page such as an updated image or a frame within a content browser. The content locator may be an address or location at which content is stored, such as, for example, a URL.


A content page (or portion thereof) associated with a first language may be retrieved by a network browser 210 at step 340. The request may be sent to a web server 230 over a network. The web server 230 receives the request, processes the request and sends a content page to the requesting device back over the network, such as network 225. Processing the request may include providing the requested content directly via web server 230 or for web server 230 to query application server 235 for the requested content.


A content page may be provided in a first language through a network browser at step 350. At step 360, a content locator translation may be automatically provided in a second language by a network browser 210. The content locator translation may be provided based on several settings. The content locator may be translated according to one or more settings made by a user in their translation account. The content locator may be translated based on the target language selected by the user through preferences specified in a network browser 210 and the resulting content locator will be provided through the network browser interface. The content locator translation may provide a response to an input, such as placing a cursor over a URL window, or may be provided automatically. More detail for providing a content locator translation in a second window by a network browser 210 is discussed below with respect to the method of FIG. 4.


A selection is received with a portion of a content page associated with a second content locator at step 370. The selection may be a selection of a link, image, content page frame or some other portion of a content page. The content locator may be associated with the selected content page portion. At step 380, the translation of the second content locator is automatically provided. The second content locator may be associated with the selected content page portion. The second content locator may be translated similarly to the first content locator translation as discussed above with respect to step 360.



FIG. 4 is a flowchart of an exemplary method for translating a content locator. In some embodiments, the method of FIG. 4 provides more detail for step 360 in the method of FIG. 3. A content locator is accessed at step 410. The content locator may be accessed by translation module 215. The translation module 215 may then send the content locator data as well as the selected target language, such as an indicator of the target language, to network-based translation application 240.


The content locator may be parsed into segment tokens based on translation settings at step 420. The translation may be performed by network-based translation application 240. The URL or content locator may be parsed to identify any recognized words in a first language within the content locator. Parsing may be performed within domain levels (for example, within back slashes of the content locator expression). Words may be identified by, for example using a dictionary, training sets of texts, and other data.


According to some embodiments, characters or segments not identified as a word within the content locator may then be analyzed to determine if they can be transliterated. Transliteration is a process which identifies a character in one language which may be translated into one or more characters of another language. Portions of the content locator which cannot be translated or transliterated may then be copied without translation.


In some instances, it may be appropriate to select a best translation for a segment token, such as when multiple possible translations for a content locator are determined by the translation module. Therefore, the method may include a step 430 of determining a best translation of the segment token may. The best translation may be based on known words, the context of the segment token, translations and/or transliteration, weighting, and other information. Determining a best translation of segment tokens is discussed in more detail below with respect to the method of FIG. 5.


A content locator may be provided in the form of a best translation of segment tokens within a content page at step 440. The content locator may be provided in a content page 100, for example within a text box 144, a content locator window 140 or URL window, or in some other manner.



FIG. 5 is a flowchart of an exemplary method for translating a content locator. In some embodiments, the method of FIG. 5 provides more detail for step 430 in the method of FIG. 4. Translation of a content locator may be based on several factors, such as a known translation, context information, and other features. The method of FIG. 5 utilizes both known translation and context information to optimize the translation of a content locator.


A combination of the token segments with the most words for the translation tokens is determined at step 510. Each token may have multiple translations, such as a word translation or transliteration, or multiple words or transliterations based on a probability structure. This plurality of translations may be referred to as a plurality of possible translations. A combination of token translations with the most known words is determined for the content locator at step 510.


Next, a context score is determined based on content page text and content locator text at step 520. The context score may be based on a match of a word to the subject matter of the content page, a word match, or other information. For example, a particular web page may be associated with a travel type subject matter, and thus words in the URL associated with travel may be determined to be a higher context score than words not associated with travel. Context may also be determined by matching identified words or transliteration content in the content locator to words detected in a content page, other tokens in web sites associated with the current domain and other related data.


A combination of tokens is determined that is most relevant to the context at step 530. The most relevant combination may be determined based on page content, other URLs, subject matters of a trained system and other data. The most relevant combination has the most words determined to match the content or have the highest average relevancy score.


The weighting of known words vs. most relevant words is retrieved as part of the translation settings for the user at step 540. Different weightings may be set for a recognized word, relevant word or other segment token or other content comprising the translation. The weightings may be retrieved as part of the account settings for a particular user. The weightings may be applied for each known word or relevant token translation within the content locator.


Content locator words are selected based on weighting and settings for a user at step 550. The combination with the highest score may be selected as the content locator translation.



FIG. 6 is a block diagram of an exemplary computing device. The computing device of FIG. 6 may be used to implement computing device 205, web server 230, application server 235 and third party web server 250. The computing system 600 includes one or more processors 610 and main memory 620. Main memory 620 stores, in part, instructions and data for execution by processor 610. Main memory 620 can store the executable code when in operation. The computing system 600 further includes a mass storage device 630, portable storage medium drive(s) 640, output devices 650, user input devices 660, a display system 670, and peripheral device(s) 680.


The components shown in FIG. 6 are depicted as being connected via a single bus 690. The components may be connected through one or more data transport means. The processor 610 and the main memory 620 may be connected via a local microprocessor bus, and the mass storage device 630, the peripheral devices 680, the portable storage medium drive(s) 640, and display system 670 may be connected via one or more input/output (I/O) buses.


The mass storage device 630, which may be implemented with a magnetic disk drive or an optical disk drive, is a non-volatile storage device for storing data and instructions for use by the processor 610. The mass storage device 630 can store the system software for implementing embodiments of the present technology for purposes of loading that software into the main memory 620.


The portable storage medium drive(s) 640 operates in conjunction with a portable non-volatile storage medium, such as a floppy disk, compact disk, digital video disc, or Universal Serial Bus (USB) storage device, to input and output data and code to and from the computer system 600 of FIG. 6. The system software for implementing embodiments of the present technology may be stored on such a portable medium and input to the computer system 600 via the portable storage medium drive(s) 640.


The input devices 660 provide a portion of a user interface. The input devices 660 may include an alpha-numeric keypad, such as a keyboard, for inputting alpha-numeric and other information, or a pointing device, such as a mouse, a trackball, stylus, or cursor direction keys. Additionally, the computing system 600 as shown in FIG. 6 includes the output devices 650. Suitable output devices include speakers, printers, network interfaces, and monitors.


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


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


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


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


Various forms of transmission media may be involved in carrying one or more sequences of one or more instructions to a CPU for execution. A bus carries the data to system RAM, from which a CPU retrieves and executes the instructions. The instructions received by system RAM can optionally be stored on a fixed disk either before or after execution by a CPU.


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

Claims
  • 1. A method for translating a content locator, the method comprising: determining at least one segment of the content locator;generating a plurality of possible transformations of the at least one segment;calculating a context score for each of the plurality of possible transformations by comparing each of the possible transformations to subject matter included in a document associated with the content locator;ranking each of the plurality of possible transformations by comparing the context scores of the plurality of possible transformations to one another;transforming the at least one segment from a source language into a target language by at least one of translation or transliteration; andtransmitting the transformed at least one segment in the target language for display on a network browser of a client device.
  • 2. The method according to claim 1, wherein determining comprises: determining one or more words included in the content locator that are to be translated from the source language into the target language, each of the one or more words being separated from the content locator as a segment; andanalyzing the remaining portion of the content locator to determine one or more characters or words that are to be transliterated from the source language into the target language.
  • 3. The method according to claim 1, further comprising: integrating back into the content locator, the at least one segment which was transformed; andtransmitting the content locator having the integrated at least one segment to the client device.
  • 4. The method according to claim 1, further comprising receiving an indication of a content locator that is to be translated, the indication generated by selection of the content locator by an input device coupled to the client device.
  • 5. The method according to claim 1, wherein transformation comprises: generating a trust value for the transformation of the at least one segment, the trust value including an accuracy for the transformation; andutilizing the transformation of the at least one segment if the trust value for the at least one segment meets or exceeds a threshold value.
  • 6. The method according to claim 1, wherein the content locator includes any of a uniform resource locator, a uniform resource indicator, a uniform resource name, a domain name, and combinations thereof.
  • 7. The method according to claim 1, further comprising: assigning a weight to each of the plurality of possible transformations, the weight being based upon a relative comparison of a possible transformation to a word in a parallel corpora; andselecting a possible transformation with the highest weight based upon the comparison.
  • 8. A method for transforming a content locator, the method comprising: determining the content locator into two or more segments;generating a plurality of possible transformations of the two or more segments;calculating a context score for each of the plurality of possible transformations by comparing each of the possible transformations to subject matter included in a document associated with the content locator;ranking each of the plurality of possible transformations by comparing the context scores of the plurality of possible transformations to one another;transforming at least one of the two or more segments from a source language into at least one target language by at least one of translation or transliteration; andcombining the two or more segments together before transmitting the combined segments to a client device.
  • 9. A system for translating a content locator, the system comprising: a memory for storing executable instructions; a processor for executing the executable instructions;a translation module stored in memory and executable by the processor to: determine at least one segment of the content locator; andtransform the at least one segment from a source language into a target language by at least one of translation or transliteration;a quality prediction engine that: calculates a context score for each of a plurality of possible transformations by comparing each of the possible transformations to subject matter included in a document associated with the content locator; andranks each of the plurality of possible transformations by comparing the context scores of the plurality of possible transformations to one another; anda communications module stored in memory and executable by the processor to transmit the transformed at least one segment in the target language for display on a network browser of a client device.
  • 10. The system according to claim 9, wherein the translation module further: determines one or more words included in the content locator that are to be translated from the source language into the target language, each of the one or more words being identified as a segment; andanalyzes the remaining portion of the content locator to determine one or more characters or words that are to be transliterated from the source language into the target language.
  • 11. The system according to claim 9, wherein the translation module further integrates into the content locator the at least one segment which was transformed; and the communications module transmits the content locator having at least a portion that has been transformed from the source language into the target language.
  • 12. The system according to claim 9, wherein the communications module receives an indication of a content locator that is to be translated, the indication generated by selection of the content locator by an input device coupled to the client device.
  • 13. The system according to claim 9, wherein the quality prediction engine: generates a trust value for the transformation of the at least one segment, the trust value including an accuracy for the transformation; andutilizes the transformation of the at least one segment if the trust value for the at least one segment meets or exceeds a threshold value.
  • 14. The system according to claim 13, wherein the quality prediction engine further: assigns a weight to each of the plurality of possible transformations, the weight being based upon a relative comparison of a possible transformation to a word in a parallel corpora; andselects a possible transformation with the highest weight based upon the comparison.
  • 15. The system according to claim 9, wherein the content locator includes any of a uniform resource locator, a uniform resource indicator, a uniform resource name, a domain name, and combinations thereof.
  • 16. The system according to claim 9, wherein the translation module includes a plugin that cooperates with a network browser that resides on the client device.
  • 17. A non-transitory computer readable storage medium having a computer program embodied thereon, the computer program executable by a processor in a computing system to perform a method for translating a content locator, the method comprising: determining at least one segment of the content locator;generating a plurality of possible transformations of the at least one segment;calculating a context score for each of the plurality of possible transformations by comparing each of the transformations to subject matter included in a document associated with the content locator;ranking each of the plurality of possible transformations by comparing the context scores of the plurality of possible transformations to one another;transforming the at least one segment from a source language into a target language by at least one of translation or transliteration; andtransmitting the transformed at least one segment in the target language for display on a network browser of a client device.
US Referenced Citations (395)
Number Name Date Kind
4502128 Okajima et al. Feb 1985 A
4599691 Sakaki et al. Jul 1986 A
4615002 Innes Sep 1986 A
4661924 Okamoto et al. Apr 1987 A
4787038 Doi et al. Nov 1988 A
4791587 Doi Dec 1988 A
4800522 Miyao et al. Jan 1989 A
4814987 Miyao et al. Mar 1989 A
4942526 Okajima et al. Jul 1990 A
4980829 Okajima et al. Dec 1990 A
5020112 Chou May 1991 A
5088038 Tanaka et al. Feb 1992 A
5091876 Kumano et al. Feb 1992 A
5146405 Church Sep 1992 A
5167504 Mann Dec 1992 A
5181163 Nakajima et al. Jan 1993 A
5212730 Wheatley et al. May 1993 A
5218537 Hemphill et al. Jun 1993 A
5220503 Suzuki et al. Jun 1993 A
5267156 Nomiyama Nov 1993 A
5268839 Kaji Dec 1993 A
5295068 Nishino et al. Mar 1994 A
5302132 Corder Apr 1994 A
5311429 Tominaga May 1994 A
5387104 Corder Feb 1995 A
5408410 Kaji Apr 1995 A
5432948 Davis et al. Jul 1995 A
5442546 Kaji et al. Aug 1995 A
5477450 Takeda et al. Dec 1995 A
5477451 Brown et al. Dec 1995 A
5495413 Kutsumi et al. Feb 1996 A
5497319 Chong et al. Mar 1996 A
5510981 Berger et al. Apr 1996 A
5528491 Kuno et al. Jun 1996 A
5535120 Chong et al. Jul 1996 A
5541836 Church et al. Jul 1996 A
5541837 Fushimoto Jul 1996 A
5548508 Nagami Aug 1996 A
5644774 Fukumochi et al. Jul 1997 A
5675815 Yamauchi et al. Oct 1997 A
5687383 Nakayama et al. Nov 1997 A
5696980 Brew Dec 1997 A
5724593 Hargrave, III et al. Mar 1998 A
5752052 Richardson et al. May 1998 A
5754972 Baker et al. May 1998 A
5761631 Nasukawa Jun 1998 A
5761689 Rayson et al. Jun 1998 A
5768603 Brown et al. Jun 1998 A
5779486 Ho et al. Jul 1998 A
5781884 Pereira et al. Jul 1998 A
5794178 Caid et al. Aug 1998 A
5805832 Brown et al. Sep 1998 A
5806032 Sproat Sep 1998 A
5819265 Ravin et al. Oct 1998 A
5826219 Kutsumi Oct 1998 A
5826220 Takeda et al. Oct 1998 A
5845143 Yamauchi et al. Dec 1998 A
5848385 Poznanski et al. Dec 1998 A
5848386 Motoyama Dec 1998 A
5855015 Shoham Dec 1998 A
5864788 Kutsumi Jan 1999 A
5867811 O'Donoghue Feb 1999 A
5870706 Alshawi Feb 1999 A
5893134 O'Donoghue et al. Apr 1999 A
5903858 Saraki May 1999 A
5907821 Kaji et al. May 1999 A
5909681 Passera et al. Jun 1999 A
5930746 Ting Jul 1999 A
5966685 Flanagan et al. Oct 1999 A
5966686 Heidorn et al. Oct 1999 A
5983169 Kozma Nov 1999 A
5987402 Murata et al. Nov 1999 A
5987404 Della Pietra et al. Nov 1999 A
5991710 Papineni et al. Nov 1999 A
5995922 Penteroudakis et al. Nov 1999 A
6018617 Sweitzer et al. Jan 2000 A
6031984 Walser Feb 2000 A
6032111 Mohri Feb 2000 A
6047252 Kumano et al. Apr 2000 A
6064819 Franssen et al. May 2000 A
6064951 Park et al. May 2000 A
6073143 Nishikawa et al. Jun 2000 A
6077085 Parry et al. Jun 2000 A
6092034 McCarley et al. Jul 2000 A
6119077 Shinozaki Sep 2000 A
6119078 Kobayakawa et al. Sep 2000 A
6131082 Hargrave, III et al. Oct 2000 A
6161082 Goldberg et al. Dec 2000 A
6182014 Kenyon et al. Jan 2001 B1
6182027 Nasukawa et al. Jan 2001 B1
6185524 Carus et al. Feb 2001 B1
6205456 Nakao Mar 2001 B1
6206700 Brown et al. Mar 2001 B1
6223150 Duan et al. Apr 2001 B1
6233544 Alshawi May 2001 B1
6233545 Datig May 2001 B1
6233546 Datig May 2001 B1
6236958 Lange et al. May 2001 B1
6269351 Black Jul 2001 B1
6275789 Moser et al. Aug 2001 B1
6278967 Akers et al. Aug 2001 B1
6278969 King et al. Aug 2001 B1
6285978 Bernth et al. Sep 2001 B1
6289302 Kuo Sep 2001 B1
6304841 Berger et al. Oct 2001 B1
6311152 Bai et al. Oct 2001 B1
6317708 Witbrock et al. Nov 2001 B1
6327568 Joost Dec 2001 B1
6330529 Ito Dec 2001 B1
6330530 Horiguchi et al. Dec 2001 B1
6356864 Foltz et al. Mar 2002 B1
6360196 Poznanski et al. Mar 2002 B1
6389387 Poznanski et al. May 2002 B1
6393388 Franz et al. May 2002 B1
6393389 Chanod et al. May 2002 B1
6415250 van den Akker Jul 2002 B1
6460015 Hetherington et al. Oct 2002 B1
6470306 Pringle et al. Oct 2002 B1
6473729 Gastaldo et al. Oct 2002 B1
6473896 Hicken et al. Oct 2002 B1
6480698 Ho et al. Nov 2002 B2
6490549 Ulicny et al. Dec 2002 B1
6498921 Ho et al. Dec 2002 B1
6502064 Miyahira et al. Dec 2002 B1
6529865 Duan et al. Mar 2003 B1
6535842 Roche et al. Mar 2003 B1
6587844 Mohri Jul 2003 B1
6604101 Chan et al. Aug 2003 B1
6609087 Miller et al. Aug 2003 B1
6647364 Yumura et al. Nov 2003 B1
6691279 Yoden et al. Feb 2004 B2
6745161 Arnold et al. Jun 2004 B1
6745176 Probert, Jr. et al. Jun 2004 B2
6757646 Marchisio Jun 2004 B2
6778949 Duan et al. Aug 2004 B2
6782356 Lopke Aug 2004 B1
6810374 Kang Oct 2004 B2
6848080 Lee et al. Jan 2005 B1
6857022 Scanlan Feb 2005 B1
6885985 Hull Apr 2005 B2
6901361 Portilla May 2005 B1
6904402 Wang et al. Jun 2005 B1
6952665 Shimomura et al. Oct 2005 B1
6983239 Epstein Jan 2006 B1
6993473 Cartus Jan 2006 B2
6996518 Jones et al. Feb 2006 B2
6996520 Levin Feb 2006 B2
6999925 Fischer et al. Feb 2006 B2
7013262 Tokuda et al. Mar 2006 B2
7016827 Ramaswamy et al. Mar 2006 B1
7016977 Dunsmoir et al. Mar 2006 B1
7024351 Wang Apr 2006 B2
7031911 Zhou et al. Apr 2006 B2
7050964 Menzes et al. May 2006 B2
7085708 Manson Aug 2006 B2
7089493 Hatori et al. Aug 2006 B2
7103531 Moore Sep 2006 B2
7107204 Liu et al. Sep 2006 B1
7107215 Ghali Sep 2006 B2
7113903 Riccardi et al. Sep 2006 B1
7143036 Weise Nov 2006 B2
7146358 Gravano et al. Dec 2006 B1
7149688 Schalkwyk Dec 2006 B2
7171348 Scanlan Jan 2007 B2
7174289 Sukehiro Feb 2007 B2
7177792 Knight et al. Feb 2007 B2
7191115 Moore Mar 2007 B2
7194403 Okura et al. Mar 2007 B2
7197451 Carter et al. Mar 2007 B1
7206736 Moore Apr 2007 B2
7209875 Quirk et al. Apr 2007 B2
7219051 Moore May 2007 B2
7239998 Xun Jul 2007 B2
7249012 Moore Jul 2007 B2
7249013 Al-Onaizan et al. Jul 2007 B2
7283950 Pournasseh et al. Oct 2007 B2
7295962 Marcu Nov 2007 B2
7295963 Richardson et al. Nov 2007 B2
7302392 Thenthiruperai et al. Nov 2007 B1
7319949 Pinkham Jan 2008 B2
7340388 Soricut et al. Mar 2008 B2
7346487 Li Mar 2008 B2
7346493 Ringger et al. Mar 2008 B2
7349839 Moore Mar 2008 B2
7349845 Coffman et al. Mar 2008 B2
7356457 Pinkham et al. Apr 2008 B2
7369998 Sarich et al. May 2008 B2
7373291 Garst May 2008 B2
7383542 Richardson et al. Jun 2008 B2
7389222 Langmead et al. Jun 2008 B1
7389234 Schmid et al. Jun 2008 B2
7403890 Roushar Jul 2008 B2
7409332 Moore Aug 2008 B2
7409333 Wilkinson et al. Aug 2008 B2
7447623 Appleby Nov 2008 B2
7454326 Marcu et al. Nov 2008 B2
7496497 Liu Feb 2009 B2
7533013 Marcu May 2009 B2
7536295 Cancedda et al. May 2009 B2
7546235 Brockett et al. Jun 2009 B2
7552053 Gao et al. Jun 2009 B2
7565281 Appleby Jul 2009 B2
7574347 Wang Aug 2009 B2
7580828 D'Agostini Aug 2009 B2
7580830 Al-Onaizan et al. Aug 2009 B2
7587307 Cancedda et al. Sep 2009 B2
7620538 Marcu et al. Nov 2009 B2
7620632 Andrews Nov 2009 B2
7624005 Koehn et al. Nov 2009 B2
7624020 Yamada et al. Nov 2009 B2
7627479 Travieso et al. Dec 2009 B2
7680646 Lux-Pogodalla et al. Mar 2010 B2
7689405 Marcu Mar 2010 B2
7698124 Menezes et al. Apr 2010 B2
7698125 Graehl et al. Apr 2010 B2
7707025 Whitelock Apr 2010 B2
7711545 Koehn May 2010 B2
7716037 Precoda et al. May 2010 B2
7801720 Satake et al. Sep 2010 B2
7813918 Muslea et al. Oct 2010 B2
7822596 Elgazzar et al. Oct 2010 B2
7925494 Cheng et al. Apr 2011 B2
7957953 Moore Jun 2011 B2
7974833 Soricut et al. Jul 2011 B2
8060360 He Nov 2011 B2
8145472 Shore et al. Mar 2012 B2
8214196 Yamada et al. Jul 2012 B2
8234106 Marcu et al. Jul 2012 B2
8244519 Bicici et al. Aug 2012 B2
8265923 Chatterjee et al. Sep 2012 B2
8275600 Bilac et al. Sep 2012 B2
8296127 Marcu et al. Oct 2012 B2
8315850 Furuuchi et al. Nov 2012 B2
8380486 Soricut et al. Feb 2013 B2
8433556 Fraser et al. Apr 2013 B2
8468149 Lung et al. Jun 2013 B1
8548794 Koehn Oct 2013 B2
8600728 Knight et al. Dec 2013 B2
8615389 Marcu Dec 2013 B1
8655642 Fux Feb 2014 B2
8666725 Och Mar 2014 B2
8676563 Soricut et al. Mar 2014 B2
20010009009 Iizuka Jul 2001 A1
20010029455 Chin et al. Oct 2001 A1
20020002451 Sukehiro Jan 2002 A1
20020013693 Fuji Jan 2002 A1
20020040292 Marcu Apr 2002 A1
20020046018 Marcu et al. Apr 2002 A1
20020046262 Heilig et al. Apr 2002 A1
20020059566 Delcambre et al. May 2002 A1
20020078091 Vu et al. Jun 2002 A1
20020083029 Chun et al. Jun 2002 A1
20020087313 Lee et al. Jul 2002 A1
20020099744 Coden et al. Jul 2002 A1
20020111788 Kimpara Aug 2002 A1
20020111789 Hull Aug 2002 A1
20020111967 Nagase Aug 2002 A1
20020143537 Ozawa et al. Oct 2002 A1
20020152063 Tokieda et al. Oct 2002 A1
20020169592 Aityan Nov 2002 A1
20020188438 Knight et al. Dec 2002 A1
20020188439 Marcu Dec 2002 A1
20020198699 Greene et al. Dec 2002 A1
20020198701 Moore Dec 2002 A1
20020198713 Franz et al. Dec 2002 A1
20030009322 Marcu Jan 2003 A1
20030023423 Yamada et al. Jan 2003 A1
20030040900 D'Agostini Feb 2003 A1
20030061022 Reinders Mar 2003 A1
20030144832 Harris Jul 2003 A1
20030154071 Shreve Aug 2003 A1
20030158723 Masuichi et al. Aug 2003 A1
20030176995 Sukehiro Sep 2003 A1
20030182102 Corston-Oliver et al. Sep 2003 A1
20030191626 Al-Onaizan et al. Oct 2003 A1
20030204400 Marcu et al. Oct 2003 A1
20030216905 Chelba et al. Nov 2003 A1
20030217052 Rubenczyk et al. Nov 2003 A1
20030233222 Soricut et al. Dec 2003 A1
20040006560 Chan et al. Jan 2004 A1
20040015342 Garst Jan 2004 A1
20040024581 Koehn et al. Feb 2004 A1
20040030551 Marcu et al. Feb 2004 A1
20040035055 Zhu et al. Feb 2004 A1
20040044530 Moore Mar 2004 A1
20040059708 Dean et al. Mar 2004 A1
20040068411 Scanlan Apr 2004 A1
20040098247 Moore May 2004 A1
20040102956 Levin May 2004 A1
20040102957 Levin May 2004 A1
20040111253 Luo et al. Jun 2004 A1
20040115597 Butt Jun 2004 A1
20040122656 Abir Jun 2004 A1
20040167768 Travieso et al. Aug 2004 A1
20040167784 Travieso et al. Aug 2004 A1
20040193401 Ringger et al. Sep 2004 A1
20040230418 Kitamura Nov 2004 A1
20040237044 Travieso et al. Nov 2004 A1
20040260532 Richardson et al. Dec 2004 A1
20050021322 Richardson et al. Jan 2005 A1
20050021517 Marchisio Jan 2005 A1
20050026131 Elzinga et al. Feb 2005 A1
20050033565 Koehn Feb 2005 A1
20050038643 Koehn Feb 2005 A1
20050055199 Ryzchachkin et al. Mar 2005 A1
20050055217 Sumita et al. Mar 2005 A1
20050060160 Roh et al. Mar 2005 A1
20050075858 Pournasseh et al. Apr 2005 A1
20050086226 Krachman Apr 2005 A1
20050102130 Quirk et al. May 2005 A1
20050125218 Rajput et al. Jun 2005 A1
20050149315 Flanagan et al. Jul 2005 A1
20050171757 Appleby Aug 2005 A1
20050204002 Friend Sep 2005 A1
20050228640 Aue et al. Oct 2005 A1
20050228642 Mau et al. Oct 2005 A1
20050228643 Munteanu et al. Oct 2005 A1
20050234701 Graehl et al. Oct 2005 A1
20050267738 Wilkinson et al. Dec 2005 A1
20060004563 Campbell et al. Jan 2006 A1
20060015320 Och Jan 2006 A1
20060015323 Udupa et al. Jan 2006 A1
20060018541 Chelba et al. Jan 2006 A1
20060020448 Chelba et al. Jan 2006 A1
20060041428 Fritsch et al. Feb 2006 A1
20060095248 Menezes et al. May 2006 A1
20060111891 Menezes et al. May 2006 A1
20060111892 Menezes et al. May 2006 A1
20060111896 Menezes et al. May 2006 A1
20060129424 Chan Jun 2006 A1
20060142995 Knight et al. Jun 2006 A1
20060150069 Chang Jul 2006 A1
20060167984 Fellenstein et al. Jul 2006 A1
20060190241 Goutte et al. Aug 2006 A1
20070016400 Soricutt et al. Jan 2007 A1
20070016401 Ehsani et al. Jan 2007 A1
20070033001 Muslea et al. Feb 2007 A1
20070050182 Sneddon et al. Mar 2007 A1
20070078654 Moore Apr 2007 A1
20070078845 Scott et al. Apr 2007 A1
20070083357 Moore et al. Apr 2007 A1
20070094169 Yamada et al. Apr 2007 A1
20070112553 Jacobson May 2007 A1
20070112555 Lavi et al. May 2007 A1
20070112556 Lavi et al. May 2007 A1
20070122792 Galley et al. May 2007 A1
20070168202 Changela et al. Jul 2007 A1
20070168450 Prajapat et al. Jul 2007 A1
20070180373 Bauman et al. Aug 2007 A1
20070219774 Quirk et al. Sep 2007 A1
20070250306 Marcu et al. Oct 2007 A1
20070265825 Cancedda et al. Nov 2007 A1
20070265826 Chen et al. Nov 2007 A1
20070269775 Andreev et al. Nov 2007 A1
20070294076 Shore et al. Dec 2007 A1
20080052061 Kim et al. Feb 2008 A1
20080065478 Kohlmeier et al. Mar 2008 A1
20080109209 Fraser et al. May 2008 A1
20080114583 Al-Onaizan et al. May 2008 A1
20080154581 Lavi et al. Jun 2008 A1
20080183555 Walk Jul 2008 A1
20080215418 Kolve et al. Sep 2008 A1
20080249760 Marcu et al. Oct 2008 A1
20080270109 Och Oct 2008 A1
20080270112 Shimohata Oct 2008 A1
20080281578 Kumaran et al. Nov 2008 A1
20080307481 Panje Dec 2008 A1
20090076792 Lawson-Tancred Mar 2009 A1
20090083023 Foster et al. Mar 2009 A1
20090106017 D'Agostini Apr 2009 A1
20090119091 Sarig May 2009 A1
20090125497 Jiang et al. May 2009 A1
20090234634 Chen et al. Sep 2009 A1
20090241115 Raffo et al. Sep 2009 A1
20090326912 Ueffing Dec 2009 A1
20090326913 Simard et al. Dec 2009 A1
20100005086 Wang et al. Jan 2010 A1
20100017293 Lung et al. Jan 2010 A1
20100042398 Marcu et al. Feb 2010 A1
20100138210 Seo et al. Jun 2010 A1
20100138213 Bicici et al. Jun 2010 A1
20100174524 Koehn Jul 2010 A1
20110029300 Marcu et al. Feb 2011 A1
20110066643 Cooper et al. Mar 2011 A1
20110082683 Soricut et al. Apr 2011 A1
20110082684 Soricut et al. Apr 2011 A1
20110191410 Refuah et al. Aug 2011 A1
20110225104 Soricut et al. Sep 2011 A1
20120096019 Manickam et al. Apr 2012 A1
20120253783 Castelli et al. Oct 2012 A1
20120265711 Assche Oct 2012 A1
20120278302 Choudhury et al. Nov 2012 A1
20120323554 Hopkins et al. Dec 2012 A1
20130103381 Assche Apr 2013 A1
20140019114 Travieso et al. Jan 2014 A1
Foreign Referenced Citations (26)
Number Date Country
2408819 Nov 2001 CA
2475857 Sep 2003 CA
2480398 Oct 2003 CA
1488338 Apr 2010 DE
202005022113.9 Feb 2014 DE
0469884 Feb 1992 EP
0715265 Jun 1996 EP
0933712 Aug 1999 EP
0933712 Jan 2001 EP
1488338 Dec 2004 EP
1488338 Apr 2010 ES
1488338 Jul 1967 FR
1488338 Apr 2010 GB
1072987 Sep 2010 HK
07244666 Sep 1995 JP
10011447 Jan 1998 JP
11272672 Oct 1999 JP
2004501429 Jan 2004 JP
2004062726 Feb 2004 JP
2008101837 May 2008 JP
5452868 Jan 2014 JP
WO03083709 Oct 2003 WO
WO03083710 Oct 2003 WO
WO2007056563 May 2007 WO
WO2011041675 Apr 2011 WO
WO2011162947 Dec 2011 WO
Non-Patent Literature Citations (255)
Entry
“Abney, Steven P. , “Parsing by Chunks,” 1991, Principle-Based Parsing: Computation and Psycholinguistics, vol. 44,pp. 257-279.”
Agbago, A., et al., “True-casing for the Portage System,” In Recent Advances in Natural Language Processing (Borovets, Bulgaria), Sep. 21-23, 2005, pp. 21-24.
Al-Onaizan et al., “Statistical Machine Translation,” 1999, JHU Summer Tech Workshop, Final Report, pp. 1-42.
“Al-Onaizan et al., “Translating with Scarce Resources,” 2000, 17th National Conference of the American Associationfor Artificial Intelligence, Austin, TX, pp. 672-678.”
Al-Onaizan, Y. and Knight K., “Machine Transliteration of Names in Arabic Text,”Proceedings of ACL Workshop on Computational Approaches to Semitic Languages. Philadelphia, 2002.
“Al-Onaizan, Y. and Knight, K., “Named Entity Translation: Extended Abstract”, 2002, Proceedings of HLT-02, SanDiego, CA.”
“Al-Onaizan, Y. and Knight, K., “Translating Named Entities Using Monolingual and Bilingual Resources,” 2002, Proc. of the 40th Annual Meeting of the ACL, pp. 400-408.”
“Alshawi et al., “Learning Dependency Translation Models as Collections of Finite-State Head Transducers,” 2000, Computational Linguistics, vol. 26, pp. 45-60.”
Alshawi, Hiyan, “Head Automata for Speech Translation”, Proceedings of the ICSLP 96, 1996, Philadelphia, Pennslyvania.
Ambati, V., “Dependency Structure Trees in Syntax Based Machine Translation,” Spring 2008 Report <http://www.cs.cmu.edu/˜vamshi/publications/DependencyMT—report.pdf>, pp. 1-8.
“Arbabi et al., “Algorithms for Arabic name transliteration,” Mar. 1994, IBM Journal of Research and Development,vol. 38, Issue 2, pp. 183-194.”
Arun, A., et al., “Edinburgh System Description for the 2006 TC-STAR Spoken Language Translation Evaluation,” in TC-STAR Workshop on Speech-to-Speech Translation (Barcelona, Spain), Jun. 2006, pp. 37-41.
Ballesteros, L. et al., “Phrasal Translation and Query Expansion Techniques for Cross-Language Information Retrieval,” SIGIR 97, Philadelphia, PA, © 1997, pp. 84-91.
“Bangalore, S. and Rambow, O., “Evaluation Metrics for Generation,” 2000, Proc. of the 1st International NaturalLanguage Generation Conf., vol. 14, pp. 1-8.”
“Bangalore, S. and Rambow, O., “Using TAGs, a Tree Model, and a Language Model for Generation,” May 2000,Workshop TAG+5, Paris.”
“Bangalore, S. and Rambow, O., “Corpus-Based Lexical Choice in Natural Language Generation,” 2000, Proc. of the 38th Annual ACL, Hong Kong, pp. 464-471.”
“Bangalore, S. and Rambow, O., “Exploiting a Probabilistic Hierarchical Model for Generation,” 2000, Proc. of 18thconf. on Computational Linguistics, vol. 1, pp. 42-48.”
Bannard, C. and Callison-Burch, C., “Paraphrasing with Bilingual Parallel Corpora,” In Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics (Ann Arbor, MI, Jun. 25-30, 2005). Annual Meeting of the ACL Assoc. for Computational Linguistics, Morristown, NJ, 597-604. DOI=http://dx.doi.org/10.3115/1219840.
“Barnett et al., “Knowledge and Natural Language Processing,” Aug. 1990, Communications of the ACM, vol. 33,Issue 8, pp. 50-71.”
“Baum, Leonard, “An Inequality and Associated Maximization Technique in Statistical Estimation for ProbabilisticFunctions of Markov Processes”, 1972, Inequalities 3:1-8.”
Berhe, G. et al., “Modeling Service-based Multimedia Content Adaptation in Pervasive Computing,” CF '04 (Ischia, Italy) Apr. 14-16, 2004, pp. 60-69.
Boitet, C. et al., “Main Research Issues in Building Web Services for Mutualized, Non-Commercial Translation,” Proc. of the 6th Symposium on Natural Language Processing, Human and Computer Processing of Language and Speech, © 2005, pp. 1-11.
“Brants, Thorsten, “TnT—A Statistical Part-of-Speech Tagger,” 2000, Proc. of the 6th Applied Natural LanguageProcessing Conference, Seattle.”
Brill, Eric, “Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part of Speech Tagging”, 1995, Assocation for Computational Linguistics, vol. 21, No. 4, pp. 1-37.
“Brill, Eric. “Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Partof Speech Tagging”,1995, Computational Linguistics, vol. 21, No. 4, pp. 543-565.”
“Brown et al., “A Statistical Approach to Machine Translation,” Jun. 1990, Computational Linguistics, vol. 16, No. 2, pp. 79-85.”
Brown et al., “Word-Sense Disambiguation Using Statistical Methods,” 1991, Proc. of 29th Annual ACL, pp. 264-270.
“Brown et al., “The Mathematics of Statistical Machine Translation: Parameter Estimation,” 1993, ComputationalLinguistics, vol. 19, Issue 2, pp. 263-311.”
“Brown, Ralf, “Automated Dictionary Extraction for “Knowledge-Free” Example-Based Translation,” 1997, Proc. of 7th Int'l Cont. on Theoretical and Methodological Issues in MT, Santa Fe, NM, pp. 111-118.”
“Callan et al., “TREC and TIPSTER Experiments with INQUERY,” 1994, Information Processing and Management,vol. 31, Issue 3, pp. 327-343.”
Callison-Burch, C. et al., “Statistical Machine Translation with Word- and Sentence-aligned Parallel Corpora,” In Proceedings of the 42nd Meeting on Assoc. for Computational Linguistics (Barcelona, Spain, Jul. 21-26, 2004). Annual Meeting of the ACL. Assoc. for Computational Linguistics, Morristown, NJ, 1.
“Carl, Michael. “A Constructivist Approach to Machine Translation,” 1998, New Methods of Language Processingand Computational Natural Language Learning, pp. 247-256.”
“Chen, K. and Chen, H., “Machine Translation: An Integrated Approach,” 1995, Proc. of 6th Int'l Cont. on Theoreticaland Methodological Issue in MT, pp. 287-294.”
Cheng, P. et al., “Creating Multilingual Translation Lexicons with Regional Variations Using Web Corpora,” In Proceedings of the 42nd Annual Meeting on Assoc. for Computational Linguistics (Barcelona, Spain, Jul. 21-26, 2004). Annual Meeting of the ACL. Assoc. for Computational Linguistics, Morristown, NJ, 53.
Cheung et al., “Sentence Alignment in Parallel, Comparable, and Quasi-comparable Corpora”, In Proceedings of LREC, 2004, pp. 30-33.
Chinchor, Nancy, “MUC-7 Named Entity Task Definition,” 1997, Version 3.5.
“Clarkson, P. and Rosenfeld, R., “Statistical Language Modeling Using the CMU-Cambridge Toolkit”, 1997, Proc. ESCA Eurospeech, Rhodes, Greece, pp. 2707-2710.”
Cohen et al., “Spectral Bloom Filters,” SIGMOD 2003, Jun. 9-12, 2003, ACM pp. 241-252.
Cohen, “Hardware-Assisted Algorithm for Full-text Large-Dictionary String Matching Using n-gram Hashing,” 1998, Information Processing and Management, vol. 34, No. 4, pp. 443-464.
Cohen, Yossi, “Interpreter for FUF,” (available at ftp:/lftp.cs.bgu.ac.il/ pUb/people/elhadad/fuf-life.lf).
Corston-Oliver, Simon, “Beyond String Matching and Cue Phrases: Improving Efficiency and Coverage inDiscourse Analysis”, 1998, The AAAI Spring Symposium on Intelligent Text Summarization, pp. 9-15.
Covington, “An Algorithm to Align Words for Historical Comparison”, Computational Linguistics, 1996,vol. 22, No. 4, pp. 481-496.
“Dagan, I. and Itai, A., “Word Sense Disambiguation Using a Second Language Monolingual Corpus”, 1994, Association forComputational Linguistics, vol. 20, No. 4, pp. 563-596.”
“Dempster et al., “Maximum Likelihood from Incomplete Data via the EM Algorithm”, 1977, Journal of the RoyalStatistical Society, vol. 39, No. 1, pp. 1-38.”
“Diab, M. and Finch, S., “A Statistical Word-Level Translation Model for Comparable Corpora,” 2000, In Proc.of theConference on Content Based Multimedia Information Access (RIAO).”
“Diab, Mona, “An Unsupervised Method for Multilingual Word Sense Tagging Using Parallel Corpora: APreliminary Investigation”, 2000, SIGLEX Workshop on Word Senses and Multi-Linguality, pp. 1-9.”
Eisner, Jason, “Learning Non-Isomorphic Tree Mappings for Machine Translation,” 2003, in Proc. of the 41st Meeting of the ACL, pp. 205-208.
Elhadad et al., “Floating Constraints in Lexical Choice”, 1996, ACL, vol. 23 No. 2, pp. 195-239.
“Elhadad, M. and Robin, J., “An Overview of SURGE: a Reusable Comprehensive Syntactic RealizationComponent,” 1996, Technical Report 96-03, Department of Mathematics and Computer Science, Ben GurionUniversity, Beer Sheva, Israel.”
Elhadad, M. and Robin, J., “Controlling Content Realization with Functional Unification Grammars”, 1992, Aspects of Automated Natural Language Generation, Dale et al. (eds)., Springer Verlag, pp. 89-104.
“Koehn, P. and Knight, K., “Knowledge Sources for Word-Level Translation Models,” 2001, Conference on EmpiricalMethods in Natural Language Processing.”
“Kumar, R. and Li, H.,“Integer Programming Approach to Printed Circuit Board Assembly Time Optimization,” 1995,IEEE Transactions on Components, Packaging, and Manufacturing, Part B: Advance Packaging, vol. 18,No. 4. pp. 720-727.”
Kupiec, Julian, “An Algorithm for Finding Noun Phrase Correspondences in Bilingual Corpora,” In Proceedings of the 31st Annual Meeting of the ACL, 1993, pp. 17-22.
“Kurohashi, S. and Nagao, M., “Automatic Detection of Discourse Structure by Checking Surface Information inSentences,” 1994, Proc. of COL-LING '94, vol. 2, pp. 1123-1127.”
“Langkilde, I. and Knight, K., “Generation that Exploits Corpus-Based Statistical Knowledge,” 1998, Proc. of theCOLING-ACL, pp. 704-710.”
“Langkilde, I. and Knight, K., “The Practical Value of N-Grams in Generation,” 1998, Proc. of the 9th InternationalNatural Language Generation Workshop, pp. 248-255.”
“Langkilde, Irene, “Forest-Based Statistical Sentence Generation,” 2000, Proc. of the 1st Conference on NorthAmerican chapter of the ACL, Seattle, WA, pp. 170-177.”
“Langkilde-Geary, Irene, “A Foundation for General-Purpose Natural Language Generation: SentenceRealization Using Probabilistic Models of Language,” 2002, Ph.D. Thesis, Faculty of the Graduate School, Universityof Southern California.”
“Langkilde-Geary, Irene, “An Empirical Verification of Coverage and Correctness for a General-PurposeSentence Generator,” 1998, Proc. 2nd Int'l Natural Language Generation Conference.”
“Lee, Yue-Shi, “Neural Network Approach to Adaptive Learning: with an Application to Chinese Homophone Disambiguation,” IEEE pp. 1521-1526.”
Lita, L., et al., “tRuEcasIng,” Proceedings of the 41st Annual Meeting of the Assoc. for Computational Linguistics (In Hinrichs, E. and Roth, D.—editors), pp. 152-159.
Llitjos, A. F. et al., “The Translation Correction Tool: English-Spanish User Studies,” Citeseer © 2004, downloaded from: http://gs37.sp.cs.cmu.edu/ari/papers/lrec04/font11, pp. 1-4.
“Mann, G. and Yarowsky, D., “Multipath Translation Lexicon Induction via Bridge Languages,” 2001, Proc. of the2nd Conference of the North American Chapter of the ACL, Pittsburgh, PA, pp. 151-158.”
“Manning, C. and Schutze, H., “Foundations of Statistical Natural Language Processing,” 2000, The MIT Press, Cambridge, MA [Front Matter].”
“Marcu, D. and Wong, W., “A Phrase-Based, Joint Probability Model for Statistical Machine Translation,” 2002, Proc.of ACL-2 conference on Empirical Methods in Natural Language Processing, vol. 10, pp. 133-139.”
“Marcu, Daniel, “Building Up Rhetorical Structure Trees,” 1996, Proc. of the National Conference on ArtificialIntelligence and Innovative Applications of Artificial Intelligence Conference, vol. 2, pp. 1069-1074.”
“Marcu, Daniel, “Discourse trees are good indicators of importance in text,” 1999, Advances in Automatic TextSummarization, The MIT Press, Cambridge, MA.”
“Marcu, Daniel, “Instructions for Manually Annotating the Discourse Structures of Texts,” 1999, DiscourseAnnotation, pp. 1-49.”
“Marcu, Daniel, “The Rhetorical Parsing of Natural Language Texts,” 1997, Proceedings of ACLIEACL '97, pp. 96-103.”
“Marcu, Daniel, “The Rhetorical Parsing, Summarization, and Generation of Natural Language Texts,” 1997, Ph. D.Thesis, Graduate Department of Computer Science, University of Toronto.”
“Marcu, Daniel, “Towards a Unified Approach to Memory- and Statistical-Based Machine Translation,” 2001, Proc.of the 39th Annual Meeting of the ACL, pp. 378-385.”
McCallum, A. and Li, W., “Early Results for Named Entity Recognition with Conditional Random Fields, Feature Induction and Web-enhanced Lexicons,” In Proceedings of the Seventh Conference on Natural Language Learning at HLT-NAACL, 2003, vol. 4 (Edmonton, Canada), Assoc. for Computational Linguistics, Morristown, NJ, pp. 188-191.
McDevitt, K. et al., “Designing of a Community-based Translation Center,” Technical Report TR-03-30, Computer Science, Virginia Tech, © 2003, pp. 1-8.
“Melamed, I. Dan, “A Word-to-Word Model of Translational Equivalence,” 1997, Proc. of the 35th Annual Meeting ofthe ACL, Madrid, Spain, pp. 490-497.”
“Melamed, I. Dan, “Automatic Evaluation and Uniform Filter Cascades for Inducing N-Best Translation Lexicons,” 1995, Proc. of the 3rd Workshop on Very Large Corpora, Boston, MA, pp. 184-198.”
“Melamed, I. Dan, “Empirical Methods for Exploiting Parallel Texts,” 2001, MIT Press, Cambridge, MA [table ofcontents].”
“Meng et al.. “Generating Phonetic Cognates to Handle Named Entities in English-Chinese Cross-LanguageSpoken Document Retrieval,” 2001, IEEE Workshop on Automatic Speech Recognition and Understanding. pp. 311-314.”
Metze, F. et al., “The NESPOLE! Speech-to-Speech Translation System,” Proc. of the HLT 2002, 2nd Int'l Conf. on Human Language Technology (San Francisco, CA), © 2002, pp. 378-383.
“Mikheev et al., “Named Entity Recognition without Gazeteers,” 1999, Proc. of European Chapter of the ACL, Bergen,Norway, pp. 1-8.”
“Miike et al., “A Full-Text Retrieval System with a Dynamic Abstract Generation Function,” 1994, Proceedings of SI-GIR'94, pp. 152-161.”
“Mohri, M. and Riley, M., “An Efficient Algorithm for the N-Best-Strings Problem,” 2002, Proc. of the 7th Int. Conf. onSpoken Language Processing (ICSLP'02), Denver, CO, pp. 1313-1316.”
Mohri, Mehryar, “Regular Approximation of Context Free Grammars Through Transformation”, 2000, pp. 251-261, “Robustness in Language and Speech Technology”, Chapter 9, Kluwer Academic Publishers.
“Monasson et al., “Determining Computational Complexity from Characteristic ‘Phase Transitions’,” Jul. 1999, NatureMagazine, vol. 400, pp. 133-137.”
“Mooney, Raymond, “Comparative Experiments on Disambiguating Word Senses: An Illustration of the Role of Biasin Machine Learning,” 1996, Proc. of the Conference on Empirical Methods in Natural Language Processing, pp. 82-91.”
Nagao, K. et al., “Semantic Annotation and Transcoding: Making Web Content More Accessible,” IEEE Multimedia, vol. 8, Issue 2 Apr.-Jun. 2001, pp. 69-81.
“Nederhof, M. and Satta, G., “IDL-Expressions: A Formalism for Representing and Parsing Finite Languages inNatural Language Processing,” 2004, Journal of Artificial Intelligence Research, vol. 21, pp. 281-287.”
“Nieben, S. and Ney, H, “Toward Hierarchical Models for Statistical Machine Translation of Inflected Languages,” 2001,Data-Driven Machine Translation Workshop, Toulouse, France, pp. 47-54.”
Norvig, Peter, “Techniques for Automatic Memoization with Applications to Context-Free Parsing”, Compuational Linguistics,1991, pp. 91-98, vol. 17, No. 1.
“Och et al., “Improved Alignment Models for Statistical Machine Translation,” 1999, Proc. of the Joint Conf. ofEmpirical Methods in Natural Language Processing and Very Large Corpora, pp. 20-28.”
Och et al. “A Smorgasbord of Features for Statistical Machine Translation.” HLTNAACL Conference. Mar. 2004, 8 pages.
Och, F., “Minimum Error Rate Training in Statistical Machine Translation,” In Proceedings of the 41st Annual Meeting on Assoc. for Computational Linguistics—vol. 1 (Sapporo, Japan, Jul. 7-12, 2003). Annual Meeting of the ACL. Assoc. for Computational Linguistics, Morristown, NJ, 160-167. DOI= http://dx.doi.org/10.3115/1075096.
“Och, F. and Ney, H, “Improved Statistical Alignment Models,” 2000, 38th Annual Meeting of the ACL, Hong Kong, pp. 440-447.”
Och, F. and Ney, H., “Discriminative Training and Maximum Entropy Models for Statistical Machine Translation,” 2002, Proc. of the 40th Annual Meeting of the ACL, Philadelphia, PA, pp. 295-302.
Och, F. and Ney, H., “A Systematic Comparison of Various Statistical Alignment Models,” Computational Linguistics, 2003, 29:1, 19-51.
“Papineni et al., “Bleu: a Method for Automatic Evaluation of Machine Translation,” 2001, IBM Research Report, RC22176(WQ102-022).”
Perugini, Saviero et al., “Enhancing Usability in CITIDEL: Multimodal, Multilingual and Interactive Visualization Interfaces,” JCDL '04, Tucson, AZ, Jun. 7-11, 2004, pp. 315-324.
Petrov et al., “Learning Accurate, Compact and Interpretable Tree Annotation,” Jun. 4-9, 2006, in Proc. of the Human Language Technology Conference of the North American Chapter of the ACL, pp. 433-440.
“Pla et al., “Tagging and Chunking with Bigrams,” 2000, Proc. of the 18th Conference on Computational Linguistics, vol. 2, pp. 614-620.”
Qun, Liu, “A Chinese-English Machine Translation System Based on Micro-Engine Architecture,” An Int'l Conference on Translation and Information Technology, Hong Kong, Dec. 2000, pp. 1-10.
Rapp, Reinhard, Automatic Identification of Word Translations from Unrelated English and German Corpora, 1999, 37th Annual Meeting of the ACL, pp. 519-526.
Zhang et al., “Synchronous Binarization for Machine Translations,” Jun. 4-9, 2006, in Proc. of the Human Language Technology Conference of the North American Chapter of the ACL, pp. 256-263.
Zhang et al., “Distributed Language Modeling for N-best List Re-ranking,” In Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (Sydney, Australia, Jul. 22-23, 2006). ACL Workshops. Assoc. for Computational Linguistics, Morristown, NJ, 216-223.
“Patent Cooperation Treaty International Preliminary Report on Patentability and the Written Opinion, Internationalapplication No. PCT/US2008/004296, Oct. 6, 2009, 5 pgs.”
Document, Wikipedia.com, web.archive.org (Feb. 24, 2004) <http://web.archive.org/web/20040222202831 /http://en.wikipedia.org/wikiiDocument>, Feb, 24, 2004.
Identifying, Dictionary.com, wayback.archive.org (Feb. 28, 2007) <http://wayback.archive.org/web/200501 01 OOOOO*/http:////dictionary.reference.com//browse//identifying>, Feb 28, 2005 <http://web.archive.org/web/20070228150533/http://dictionary.reference.com/browse/identifying>.
Koehn, P. et al, “Statistical Phrase-Based Translation,” Proceedings of HLT-NAACL 2003 Main Papers , pp. 48-54 Edmonton, May-Jun. 2003.
Abney, S.P., “Stochastic Attribute Value Grammars”, Association for Computional Linguistics, 1997, pp. 597-618.
Fox, H., “Phrasal Cohesion and Statistical Machine Translation” Proceedings of the Conference on Empirical Methods in Natural Language Processing, Philadelphia, Jul. 2002, pp. 304-311. Association for Computational Linguistics. <URL: http://acl.idc.upenn.edu/W/W02/W02-1039.pdf>.
Tillman, C., et al, “Word Reordering and a Dynamic Programming Beam Search Algorithm for Statistical Machine Translation,” 2003, Association for Computational Linguistics, vol. 29, No. 1, pp. 97-133 <URL: http://acl.ldc.upenn.edu/J/J03/J03-1005.pdf>.
Wang, W., et al. “Capitalizing Machine Translation” in HLT-NAACL '06 Proceedings Jun. 2006. <http://www.isi.edu/natural-language/mt/hlt-naacl-06-wang.pdf>.
Langlais, P. et al., “TransType: a Computer-Aided Translation Typing System” EmbedMT '00 ANLP-NAACL 2000 Workshop: Embedded Machine Translation Systems, 2000, pp. 46-51. <http://aclidc.upenn.edu/W/W00/W00-0507.pdf>.
“Elhadad, Michael, “FUF: the Universal Unifier User Manual Version 5.2”, 1993, Department of Computer Science,Ben Gurion University, Beer Sheva, Israel.”
“Elhadad, Michael, “Using Argumentation to Control Lexical Choice: A Functional Unification Implementation”,1992, Ph.D. Thesis, Graduate School of Arts and Sciences, Columbia University.”
“Elhadad, M. and Robin, J., “SURGE: a Comprehensive Plug-in Syntactic Realization Component for TextGeneration”, 1999 (available at http://www.cs.bgu.ac.il/-elhadad/pub.html)”.
Fleming, Michael et al., “Mixed-Initiative Translation of Web Pages,” AMTA 2000, LNAI 1934, Springer-Verlag, Berlin, Germany, 2000, pp. 25-29.
Och, Franz Josef and Ney, Hermann, “Improved Statistical Alignment Models” ACLOO:Proc. of the 38th Annual Meeting of the Association for Computational Lingustics, ′Online! Oct. 2-6, 2000, pp. 440-447, XP002279144 Hong Kong, China Retrieved from the Internet: <URL:http://www-i6.informatik.rwth-aachen.de/Colleagues/och/ACLOO.ps> retrieved on May 6, 2004! abstract.
Ren, Fuji and Shi, Hongchi, “Parallel Machine Translation: Principles and Practice,” Engineering of Complex Computer Systems, 2001 Proceedings, Seventh IEEE Intl Conference, pp. 249-259, 2001.
Fung et al, “Mining Very-Non-Parallel Corpora: Parallel Sentence and Lexicon Extraction via Bootstrapping and EM”, in EMNLP 2004.
“Fung, P. and Yee, L., “An IR Approach for Translating New Words from Nonparallel, Comparable Texts”, 1998,36th Annual Meeting of the ACL, 17th International Conference on Computational Linguistics, pp. 414-420.”
“Fung, Pascale, “Compiling Bilingual Lexicon Entries From a Non-Parallel English-Chinese Corpus”, 1995, Proc, ofthe Third Workshop on Very Large Corpora, Boston, MA, pp. 173-183.”
“Gale, W. and Church, K., “A Program for Aligning Sentences in Bilingual Corpora,” 1991, 29th Annual Meeting ofthe ACL, pp. 177-183.”
Gale, W. and Church, K., “A Program for Aligning Sentences in Bilingual Corpora,” 1993, Computational Linguisitcs, vol. 19, No. 1, pp. 75-102.
Galley et al., “Scalable Inference and Training of Context-Rich Syntactic Translation Models,” Jul. 2006, in Proc. of the 21st International Conference on Computational Linguistics, pp. 961-968.
Galley et al., “What's in a translation rule?”, 2004, in Proc. of HLT/NAACL '04, pp. 1-8.
Gaussier et al, “A Geometric View on Bilingual Lexicon Extraction from Comparable Corpora”, In Proceedings of ACL Jul. 2004.
“Germann et al., “Fast Decoding and Optimal Decoding for Machine Translation”, 2001, Proc. of the 39th AnnualMeeting of the ACL, Toulouse, France, pp. 228-235.”
“Germann, Ulrich: “Building a Statistical Machine Translation System from Scratch: How Much Bang for theBuck Can We Expect?” Proc. of the Data-Driven MT Workshop of ACL-01, Toulouse, France, 2001.”
Gildea, D., “Loosely Tree-based Alignment for Machine Translation,” In Proceedings of the 41st Annual Meeting on Assoc. for Computational Linguistics—vol. 1 (Sapporo, Japan, Jul. 7-12, 2003). Annual Meeting of the ACL Assoc. for Computational Linguistics, Morristown, NJ, 80-87. DOI=http://dx.doi.org/10.3115/1075096.1075107.
“Grefenstette, Gregory, “The World Wide Web as a Resource for Example-Based Machine TranslationTasks”, 1999, Translating and the Computer 21, Proc. of the 21 st International Cant. on Translating and theComputer. London, UK, 12 pp.”
Grossi et al, “Suffix Trees and Their Applications in String Algorithms”, In. Proceedings of the 1st South American Workshop on String Processing, Sep. 1993, pp. 57-76.
Gupta et al., “Kelips: Building an Efficient and Stable P2P DHT thorough Increased Memory and Background Overhead,” 2003 IPTPS, LNCS 2735, pp. 160-169.
Habash, Nizar, “The Use of a Structural N-gram Language Model in Generation-Heavy Hybrid Machine Translation,” University of Maryland, Univ. Institute for Advance Computer Studies, Sep. 8, 2004.
“Hatzivassiloglou, V. et al., “Unification-Based Glossing”, 1995, Proc. of the International Joint Conference onArtificial Intelligence, pp. 1382-1389.”
Huang et al., “Relabeling Syntax Trees to Improve Syntax-Based Machine Translation Quality,” Jun. 4-9, 2006, in Proc. of the Human Language Techology Conference of the North Americna Chapter of the ACL, pp. 240-247.
Ide, N. and Veronis, J., “Introduction to the Special Issue on Word Sense Disambiguation: The State of the Art”, Mar. 1998, Computational Linguistics, vol. 24, Issue 1, pp. 2-40.
Bikel, D., Schwartz, R., and Weischedei, R., “An Algorithm that Learns What's in a Name,” Machine Learning 34, 211-231 (1999).
Imamura et al., “Feedback Cleaning of Machine Translation Rules Using Automatic Evaluation,” 2003 Computational Linguistics, pp. 447-454.
Imamura, Kenji, “Hierarchical Phrase Alignment Harmonized with Parsing”, 2001, in Proc. of NLPRS, Tokyo.
“Jelinek, F., “Fast Sequential Decoding Algorithm Using a Stack”, Nov. 1969, IBM J. Res. Develop., vol. 13, No. 6, pp. 675-685.”
“Jones, K. Sparck, “Experiments in Relevance Weighting of Search Terms”, 1979, Information Processing &Management, vol. 15, Pergamon Press Ltd., UK, pp. 133-144.”
Klein et al., “Accurate Unlexicalized Parsing,” Jul. 2003, in Proc. of the 41st Annual Meeting of the ACL, pp. 423-430.
“Knight et al., “Integrating Knowledge Bases and Statistics in MT,” 1994, Proc. of the Conference of the Associationfor Machine Translation in the Americas.”
“Knight et al., “Filling Knowledge Gaps in a Broad-Coverage Machine Translation System”, 1995, Proc. ofthel4th International Joint Conference on Artificial Intelligence, Montreal, Canada, vol. 2, pp. 1390-1396.”
“Knight, K. and Al-Onaizan, Y., “A Primer on Finite-State Software for Natural Language Processing”, 1999 (available at http://www.isLedullicensed-sw/carmel).”
Knight, K. and Al-Onaizan, Y., “Translation with Finite-State Devices,” Proceedings of the 4th AMTA Conference, 1998.
“Knight, K. and Chander, I., “Automated Postediting of Documents,” 1994, Proc. of the 12th Conference on ArtificialIntelligence, pp. 779-784.”
Knight, K. and Graehl, J., “Machine Transliteration”, 1997, Proc. of the ACL-97, Madrid, Spain, pp. 128-135.
“Knight, K. and Hatzivassiloglou, V., “Two-Level, Many-Paths Generation,” 1995, Proc. of the 33rd AnnualConference of the ACL, pp. 252-260.”
“Knight, K. and Luk, S., “Building a Large-Scale Knowledge Base for Machine Translation,” 1994, Proc. of the 12thConference on Artificial Intelligence, pp. 773-778.”
“Knight, K. and Marcu, D., “Statistics-Based Summarization—Step One: Sentence Compression,” 2000, AmericanAssociation for Artificial Intelligence Conference, pp. 703-710.”
“Knight, K. and Yamada, K., “A Computational Approach to Deciphering Unknown Scripts,” 1999, Proc. of the ACLWorkshop on Unsupervised Learning in Natural Language Processing.”
“Knight, Kevin,“A Statistical MT Tutorial Workbook,” 1999, JHU Summer Workshop (available at http://www.isLedu/natural-language/mUwkbk.rtf).”
Knight, Kevin, “Automating Knowledge Acquisition for Machine Translation,” 1997, AI Magazine, vol. 18, No. 4.
“Knight, Kevin, “Connectionist Ideas and Algorithms,” Nov. 1990, Communications of the ACM, vol. 33, No. 11, pp. 59-74.”
“Knight, Kevin, “Decoding Complexity in Word-Replacement Translation Models”, 1999, Computational Linguistics, vol. 25, No. 4.”
“Knight, Kevin, “Integrating Knowledge Acquisition and Language Acquisition”, May 1992, Journal of Appliedlntelligence, vol. 1, No. 4.”
“Knight, Kevin, “Learning Word Meanings by Instruction,” 1996, Proc. of the D National Conference on Artificiallntelligence, vol. 1, pp. 447-454.”
Knight, Kevin, “Unification: A Multidisciplinary Survey,” 1989, ACM Computing Surveys, vol. 21, No. 1.
Koehn, Philipp, “Noun Phrase Translation,” A PhD Dissertation for the University of Southern California, pp. xiii, 23, 25-57, 72-81, Dec. 2003.
“Koehn, P. and Knight, K., “ChunkMT: Statistical Machine Translation with Richer Linguistic Knowledge,” Apr. 2002,Information Sciences Institution.”
“Koehn, P. and Knight, K., “Estimating Word Translation Probabilities from Unrelated Monolingual Corpora Usingthe EM Algorithm,” 2000, Proc. of the 17th meeting of the AAAI.”
Ueffing et al., “Using Pos Information for Statistical Machine Translation into Morphologically Rich Languages,” in EACL, 2003: Proceedings of the Tenth Conference on European Chapter of the Association for Computational Linguistics, pp. 347-354.
Frederking et al., “Three Heads are Better Than One,” In Proceedings of the 4th Conference on Applied Natural Language Processing, Stuttgart, Germany, 1994, pp. 95-100.
Och et al., “Discriminative Training and Maximum Entropy Models for Statistical Machine Translation,” In Proc. of the 40th Annual Meeting of the Association for Computational Linguistics (ACL), Philadelphia, PA, 2002.
Yasuda et al., “Automatic Machine Translation Selection Scheme to Output the Best Result,” Proc of LREC, 2002, pp. 525-528.
Papineni et al., “Bleu: a Method for Automatic Evaluation of Machine Translation”, Proc. of the 40th Annual Meeting of the Association for Computational Linguistics (ACL), Jul. 2002, pp. 311-318.
Shaalan et al., “Machine Translation of English Noun Phrases into Arabic”, (2004), vol. 17, No. 2, International Journal of Computer Processing of Oriental Languages, 14 pages.
Isahara et al., “Analysis, Generation and Semantic Representation in CONTRAST—A Context-Based Machine Translation System”, 1995, Systems and Computers in Japan, vol. 26, No. 14, pp. 37-53.
Proz.com, Rates for proofreading versus Translating, http://www.proz.comfforum/business—issues/202-rates—for—proofreading—versus—translating.html, Apr. 23, 2009, retrieved Jul. 13, 2012.
Celine, Volume discounts on large translation project, naked translations, http://www.nakedtranslations.com/en/2007/volume-discounts-on-large-translation-projects/, Aug. 1, 2007, retrieved Jul. 16, 2012.
Graehl, J and Knight, K, May 2004, Training Tree Transducers, In NAACL-HLT (2004), pp. 105-112.
Niessen et al, “Statistical machine translation with scarce resources using morphosyntactic information”, Jun. 2004, Computational Linguistics, vol. 30, issue 2, pp. 181-204.
Liu et al., “Context Discovery Using Attenuated Bloom Filters in Ad-Hoc Networks,” Springer, pp. 13-25, 2006.
First Office Action mailed Jun. 7, 2004 in Canadian Patent Application 2408819, filed May 11, 2001.
First Office Action mailed Jun. 14, 2007 in Canadian Patent Application 2475857, filed Mar. 11, 2003.
Office Action mailed Mar. 26, 2012 in German Patent Application 10392450.7, filed Mar. 28, 2003.
First Office Action mailed Nov. 5, 2008 in Canadian Patent Application 2408398, filed Mar. 27, 2003.
Second Office Action mailed Sep. 25, 2009 in Canadian Patent Application 2408398, filed Mar. 27, 2003.
First Office Action mailed Mar. 1, 2005 in European Patent Application No. 03716920.8, filed Mar. 27, 2003.
Second Office Action mailed Nov. 9, 2006 in European Patent Application No. 03716920.8, filed Mar. 27, 2003.
Third Office Action mailed Apr. 30, 2008 in European Patent Application No. 03716920.8, filed Mar. 27, 2003.
Office Action mailed Oct. 25, 2011 in Japanese Patent Application 2007-536911 filed Oct. 12, 2005.
Office Action mailed Jul. 24, 2012 in Japanese Patent Application 2007-536911 filed Oct. 12, 2005.
Final Office Action mailed Apr. 9, 2013 in Japanese Patent Application 2007-536911 filed Oct. 12, 2005.
Office Action mailed May 13, 2005 in Chinese Patent Application 1812317.1, filed May 11, 2001.
Office Action mailed Apr. 21, 2006 in Chinese Patent Application 1812317.1, filed May 11, 2001.
Office Action mailed Jul. 19, 2006 in Japanese Patent Application 2003-577155, filed Mar. 11, 2003.
Office Action mailed Mar. 1, 2007 in Chinese Patent Application 3805749.2, filed Mar. 11, 2003.
Office Action mailed Feb. 27, 2007 in Japanese Patent Application 2002-590018, filed May 13, 2002.
Office Action mailed Jan. 26, 2007 in Chinese Patent Application 3807018.9, filed Mar. 27, 2003.
Office Action mailed Dec. 7, 2005 in Indian Patent Application 2283/DELNP/2004, filed Mar. 11, 2003.
Office Action mailed Mar. 31, 2009 in European Patent Application 3714080.3, filed Mar. 11, 2003.
Agichtein et al., “Snowball: Extracting Information from Large Plain-Text Collections,” ACM DL '00, the Fifth ACM Conference on Digital Libraries, Jun. 2, 2000, San Antonio, TX, USA.
Satake, Masaomi, “Anaphora Resolution for Named Entity Extraction in Japanese Newspaper Articles,” Master's Thesis [online], Feb. 15, 2002, School of Information Science, JAIST, Nomi, Ishikaw, Japan.
Office Action mailed Aug. 29, 2006 in Japanese Patent Application 2003-581064, filed Mar. 27, 2003.
Office Action mailed Jan. 26, 2007 in Chinese Patent Application 3807027.8, filed Mar. 28, 2003.
Office Action mailed Jul. 25, 2006 in Japanese Patent Application 2003-581063, filed Mar. 28, 2003.
Huang et al., “A syntax-directed translator with extended domain of locality,” Jun. 9, 2006, In Proceedings of the Workshop on Computationally Hard Problems and Joint Inference in Speech and Language Processing, pp. 1-8, New York City, New York, Association for Computational Linguistics.
Melamed et al., “Statistical machine translation by generalized parsing,” 2005, Technical Report 05-001, Proteus Project, New York University, http://nlp.cs.nyu.edu/pubs/.
Galley et al., “Scalable Inference and Training of Context-Rich Syntactic Translation Models,” Jul. 2006, In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the ACL, pp. 961-968.
Huang et al., “Statistical syntax-directed translation with extended domain of locality,” Jun. 9, 2006, In Proceedings of AMTA, pp. 1-8.
“Rapp, Reinhard, “Identifying Word Translations in Non-Parallel Texts,” 1995, 33rd Annual Meeting of the ACL, pp. 320-322.”
Rayner et al., “Hybrid Language Processing in the Spoken Language Translator,” IEEE, pp. 107-110.
“Resnik, P. and Smith, A., “The Web as a Parallel Corpus,” Sep. 2003, Computational Linguistics, SpecialIssue on Web as Corpus, vol. 29, Issue 3, pp. 349-380.”
“Resnik, P. and Yarowsky, D. “A Perspective on Word Sense Disambiguation Methods and Their Evaluation,” 1997, Proceedings of SIGLEX '97, Washington, D.C., pp. 79-86.”
“Resnik, Philip, “Mining the Web for Bilingual Text,” 1999, 37th Annual Meeting of the ACL, College Park, MD, pp. 527-534.”
Rich, E. and Knight, K., “Artificial Intelligence, Second Edition,” 1991, McGraw-Hill Book Company [Front Matter].
“Richard et al., “Visiting the Traveling Salesman Problem with Petri nets and application in the glass industry,” Feb. 1996, IEEE Emerging Technologies and Factory Automation, pp. 238-242.”
“Robin, Jacques, “Revision-Based Generation of Natural Language Summaries Providing Historical Background: Corpus-Based Analysis, Design Implementation and Evaluation,” 1994, Ph.D. Thesis, Columbia University, New York.”
Rogati et al., “Resource Selection for Domain-Specific Cross-Lingual IR,” ACM 2004, pp. 154-161.
Zhang, R. et al., “The NiCT-ATR Statistical Machine Translation System for the IWSLT 2006 Evaluation,” submitted to IWSLT, 2006.
“Russell, S. and Norvig, P., “Artificial Intelligence: A Modern Approach,” 1995, Prentice-Hall, Inc., New Jersey [Front Matter].”
“Sang, E. and Buchholz, S., “Introduction to the CoNLL-2000 Shared Task: Chunking,” 2002, Proc. ofCoNLL-2000 and LLL-2000, Lisbon, Portugal, pp. 127-132.”
Schmid, H., and Schulte im Walde, S., “Robust German Noun Chunking With a Probabilistic Context-Free Grammar,” 2000, Proc. of the 18th Conference on Computational Linguistics, vol. 2, pp. 726-732.
“Schutze, Hinrich, “Automatic Word Sense Discrimination,” 1998, Computational Linguistics, Special Issue on WordSense Disambiguation, vol. 24, Issue 1, pp. 97-123.”
“Selman et al., “A New Method for Solving Hard Satisfiability Problems,” 1992, Proc. of the 10th National Conferenceon Artificial Intelligence, San Jose, CA, pp. 440-446.”
Kumar, S. and Byrne, W., “Minimum Bayes-Risk Decoding for Statistical Machine Translation.” HLTNAACL Conference. Mar. 2004, 8 pages.
“Shapiro, Stuart (ed.), “Encyclopedia of Artificial Intelligence, 2nd edition”, vol. D 2,1992, John Wiley & Sons Inc; “Unification” article, K. Knight, pp. 1630-1637.”
Shirai, S., “A Hybrid Rule and Example-based Method for Machine Translation,” NTT Communication Science Laboratories, pp. 1-5.
“Sobashima et al., “A Bidirectional Transfer-Driven Machine Translation System for Spoken Dialogues,” 1994, Proc.of 15th Conference on Computational Linguistics, vol. 1, pp. 64-68.”
“Soricut et al., “Using a Large Monolingual Corpus to Improve Translation Accuracy,” 2002, Lecture Notes in Computer Science, vol. 2499, Proc. of the 5th Conference of the Association for Machine Translation in theAmericas on Machine Translation: From Research to Real Users, pp. 155-164.”
“Stalls, B. and Knight, K., “Translating Names and Technical Terms in Arabic Text,” 1998, Proc. of the COLING/ACL Workkshop on Computational Approaches to Semitic Language.”
“Sumita et al.,““A Discourse Structure Analyzer for Japanese Text,” 1992, Proc. of the International Conference onFifth Generation Computer Systems,” vol. 2, pp. 1133-1140.”
“Sun et al., “Chinese Named Entity Identification Using Class-based Language Model,” 2002, Proc. of 19thInternational Conference on Computational Linguistics, Taipei, Taiwan, vol. 1, pp. 1-7.”
Tanaka, K. and Iwasaki, H. “Extraction of Lexical Translations from Non-Aligned Corpora,” Proceedings of COLING 1996.
Taskar, B., et al., “A Discriminative Matching Approach to Word Alignment,” In Proceedings of the Conference on Human Language Technology and Empirical Methods in Natural Language Processing (Vancouver, BC, Canada, Oct. 6-8, 2005). Human Language Technology Conference. Assoc. for Computational Linguistics, Morristown, NJ.
“Taylor et al., “The Penn Treebank: An Overview,” in A. Abeill (ed.), D Treebanks: Building and Using ParsedCorpora, 2003, pp. 5-22.”
“Tiedemann, Jorg, “Automatic Construction of Weighted String Similarity Measures,” 1999, In Proceedings ofthe Joint SIGDAT Conference on Emperical Methods in Natural Language Processing and Very Large Corpora.”
“Tillman, C. and Xia, F., “A Phrase-Based Unigram Model for Statistical Machine Translation,” 2003, Proc. of theNorth American Chapter of the ACL on Human Language Technology, vol. 2, pp. 106-108.”
“Tillmann et al., “A DP Based Search Using Monotone Alignments in Statistical Translation,” 1997, Proc. Of theAnnual Meeting of the ACL, pp. 366-372.”
Tomas, J., “Binary Feature Classification for Word Disambiguation in Statistical Machine Translation,” Proceedings of the 2nd Int'l. Workshop on Pattern Recognition, 2002, pp. 1-12.
Uchimoto, K. et al., “Word Translation by Combining Example-Based Methods and Machine Learning Models,” Natural LanguageProcessing (Shizen Gengo Shori), vol. 10, No. 3, Apr. 2003, pp. 87-114.
Uchimoto, K. et al., “Word Translation by Combining Example-based Methods and Machine Learning Models,” Natural LanguageProcessing (Shizen Gengo Shori), vol. 10, No. 3, Apr. 2003, pp. 87-114. (English Translation).
“Ueffing et al., “Generation of Word Graphs in Statistical Machine Translation,” 2002, Proc. of Empirical Methods inNatural Language Processing (EMNLP), pp. 156-163.”
Varga et al., “Parallel Corpora for Medium Density Languages”, In Proceedings of RANLP 2005, pp. 590-596.
“Veale, T. and Way, A., “Gaijin: A Bootstrapping, Template-Driven Approach to Example-Based MT,” 1997, Proc. ofNew Methods in Natural Language Processing (NEMPLP97), Sofia, Bulgaria.”
Vogel et al., “The CMU Statistical Machine Translation System,” 2003, Machine Translation Summit IX, New Orleans, LA.
“Vogel et al., “The Statistical Translation Module in the Verbmobil System,” 2000, Workshop on Multi-Lingual SpeechCommunication, pp. 69-74.”
“Vogel, S. and Ney, H., “Construction of a Hierarchical Translation Memory,” 2000, Proc. of Cooling 2000, Saarbrucken, Germany, pp. 1131-1135.”
“Wang, Y. and Waibel, A., “Decoding Algorithm in Statistical Machine Translation,” 1996, Proc. of the 35th AnnualMeeting of the ACL, pp. 366-372.”
“Wang, Ye-Yi, “Grammar Inference and Statistical Machine Translation,” 1998, Ph.D Thesis, Carnegie MellonUniversity, Pittsburgh, PA.”
“Watanabe et al., “Statistical Machine Translation Based on Hierarchical Phrase Alignment,” 2002, 9th InternationalConference on Theoretical and Methodological Issues in Machin Translation (TMI-2002), Keihanna, Japan, pp. 188-198.”
“Witbrock, M. and Mittal, V., “Ultra-Summarization: A Statistical Approach to Generating Highly Condensed Non-Extractive Summaries,” 1999, Proc. of SIGIR '99, 22nd International Conference on Research and Development inInformation Retrieval, Berkeley, CA, pp. 315-316.”
“Wu, Dekai, “A Polynomial-Time Algorithm for Statistical Machine Translation,” 1996, Proc. of 34th Annual Meeting ofthe ACL, pp. 152-158.”
“Wu, Dekai, “Stochastic Inversion Transduction Grammars and Bilingual Parsing of Parallel Corpora,” 1997, Computational Linguistics, vol. 23, Issue 3, pp. 377-403.”
“Yamada, K. and Knight, K. “A Syntax-Based Statistical Translation Model,” 2001, Proc. of the 39th AnnualMeeting of the ACL, pp. 523-530.”
“Yamada, K. and Knight, K., “A Decoder for Syntax-Based Statistical MT,” 2001, Proceedings of the 40th AnnualMeeting of the ACL, pp. 303-310.”
Yamada K., “A Syntax-Based Statistical Translation Model,” 2002 PhD Dissertation, pp. 1-141.
“Yamamoto et al., “A Comparative Study on Translation Units for Bilingual Lexicon Extraction,” 2001, JapanAcademic Association for Copyright Clearance, Tokyo, Japan.”
Yamamoto et al, “Acquisition of Phrase-level Bilingual Correspondence using Dependency Structure” In Proceedings of COLING-2000, pp. 933-939.
“Yarowsky, David, “Unsupervised Word Sense Disambiguation Rivaling Supervised Methods,” 1995, 33rd AnnualMeeting of the ACL, pp. 189-196.”
Huang et al. Automatic Extraction of Named Entity Translingual Equivalence Based on Multi-Feature Cost Minimization. In Proceedings of the ACL 2003 Workshop on Multilingual and Mixed-Language Name Entry Recognition.
Notice of Allowance mailed Dec. 10, 2013 in Japanese Patent Application 2007-536911, filed Oct. 12, 2005.
Makoushina, J. “Translation Quality Assurance Tools: Current State and Future Approaches.” Translating and the Computer, Dec. 17, 2007, 29, 1-39, retrieved at <http://www.palex.ru/fc/98/Translation%20Quality%Assurance%20Tools.pdf>.
Specia et al. “Improving the Confidence of Machine Translation Quality Estimates,” MT Summit XII, Ottawa, Canada, 2009, 8 pages.
Related Publications (1)
Number Date Country
20130238310 A1 Sep 2013 US