US 8,548,794 B2Grant
Statistical noun phrase translation
Issue Date:2013-10-01
•26 Claims
•5 Drawing Sheets
Abstract
A statistical machine translation (MT) system may include a noun phrase/prepositional phrase (NP/PP) translation subsystem to translation NP/PPs as a subtask in an MT operation. The NP/PP translation subsystem may use a model trained on an NP/PP corpus and a decoder to generate an n-best list of candidate translations and a re-ranker to re-rank the candidate translations based on a machine learning method and additional features based on known properties of NP/PPs.
Metadata
Assignee
- University of Southern California
Inventor
- Philipp Koehn
Application Information
Application Number:US 10/884,175
Filing Date:2004-07-02
Priority Date:2003-07-02
Art Unit:2659
Classifications
IPC:
G06F17/28G06F17/20G06F17/27G06F17/21G10L15/20G10L21/00
Patent Drawings (5 sheets)
Description
Cross-Reference to Related Applications
[0001] This application claims priority to U.S. Provisional Application Ser. No. 60/484,810, filed on Jul. 2, 2003, the disclosure of which is incorporated here by reference in its entirety.
Origin of Invention
[0002] The research and development described in this application were supported by DARPA under grant number N66001-00-1-8914. The U.S. Government may have certain rights in the claimed inventions.
Background
[0003] Machine translation (MT) is the automatic translation from a first language (a “source” language) into another language (a “target” language). Systems that perform an MT process are said to “decode” the source language into the target language.
[0004] A statistical MT system that translates foreign language sentences, e.g., French, into English may have include the following components: a language model that assigns a probability P(e) to any English string; a translation model that assigns a probability P(f|e) to any pair of English and French strings; and a decoder. The decoder may take a previously unseen sentence f and try to find the e that maximizes P(e|f), or equivalently maximizes P(e)*P(f|e).
Summary
[0005] A statistical machine translation (MT) system may include a noun phrase/prepositional phrase (NP/PP) translation subsystem to translation NP/PPs as a subtask in an MT operation.
[0006] The NP/PP translation subsystem may use a model trained on an NP/PP corpus and a decoder to generate an n-best list of candidate translations and a re-ranker to re-rank the candidate translations based on a machine learning method and additional features based on known properties of NP/PPs. In an embodiment, the machine learning method may be a maximum entropy learning method, and the features may include syntactic features and using the web as a language model.
Brief Description of the Drawings
[0007] FIG. 1 is a block diagram of a statistical machine translation (MT) system including a noun phrase/prepositional phrase (NP/PP) translation subsystem.
[0008] FIG. 2 illustrates a syntactic parse tree for a sentence including NP/PPs.
[0009] FIG. 3 is a flowchart describing a process for training and using an NP/PP translation subsystem.
[0010] FIG. 4 is a block diagram of an NP/PP translation subsystem according to an embodiment.
Detailed Description
[0011] FIG. 1 illustrates a statistical machine translation (MT) system according to an embodiment. The MT system 100 may be used to translate from a source language (e.g., French) to a target language (e.g., English). The MT system 100 may include a language model 105, a translation model 110, and a decoder 115.
[0012] The MT system 100 may be based on a source-channel model. The language model (the “source”) may assign a probability P(e) to any given English sentence e. The language model 105 may be an n-gram model trained by a large monolingual corpus (or one side of a parallel corpus) to determine the probability of a word sequence.
[0013] The translation model 110 may be used to determine the probability of correctness for a translation, e.g., the probability P(f|e) of a French string f, given an English string e. The parameter values for computing P(f|e) may be learned from a parallel corpus including bilingual sentence pairs. The translation model may be, for example, an IBM translation model 4, described in U.S. Pat. No. 5,477,451.
[0014] The decoder 115 may be used to identify the best translation by maximizing the product of P(e)*P(f|e). In an embodiment, the decoder may be a greedy decoder, such as that described in co-pending application Ser. No. 09/854,327, filed on May 11, 2001, incorporated herein in its entirety.
[0015] In an embodiment, the translation of noun phrases (NPs) and prepositional phrases (PPs) may be performed as a subtask of an MT operation. The MT system 100 may include NP/PP translation subsystem 120. The NP/PP translation subsystem 120 may translate the NP/PPs in a sentence in a source language, e.g., German, that can be translated into NP/PPs in a target language, e.g., English. The NP/PP translation subsystem 120 may then provide the translations to the MT system 100. The MT system 100 may treat the translated NP/PP(s) as fixed translations, i.e., incorporate them into the full translation without changing them.
[0016] Certain source language NP/PPs may not translate to NP/PPs in the target language. The NP/PP translation subsystem 120 may treat such NP/PPs as special cases, and handle them separately.
[0017] FIG. 2 illustrates a syntactic parse tree 200 for a sentence s that includes NPs 205 and PP 210. In the NP/PP translation subsystem 120, the NP/PPs of the sentence s are the subtrees ti that contain at least one noun and no verb, and which are not part of a larger subtree that contains no verb.
[0018] FIG. 3 is a flowchart describing a process for training and using the NP/PP translation subsystem 120 in the MT system 100. The NP/PP translation subsystem may use the same modeling as the overall system (e.g., IBM Model 4), but be trained on only NP/PPs (block 305), e.g., an NP/PP corpus derived from a parallel corpus 125 used to train the MT system 100 (FIG. 1 ). The MT system 100 may detect NP/PPs in an input foreign language sentence (block 310) and provide them to the NP/PP translation subsystem 120 for translation. The NP/PPs may be translated in isolation, e.g., without the assistance of sentence context.
[0019] FIG. 4 shows an NP/PP translation subsystem according to an embodiment. The NP/PP translation subsystem uses the model 405 and a decoder 407 to generate an n-best list of possible translations (block 315). The NP/PP translation subsystem may include a re-ranker 415 to rescore the n-best list using additional features 420 (block 320). The best translation (or multiple best translations) may then be passed on to the MT system 100 (block 325), which in turn translates the remaining parts of the sentence and integrates the chosen NP/PP translation(s) (block 330).
[0020] The NP/PP training corpus 410 may be created by extracting NP/PPs from a parallel corpus, e.g., the parallel corpus 125. The corpus 410 may be word-aligned using, e.g., the toolkit Giza++, which is described in Ouch and Ney, “Discriminative training and maximum entropy models for statistical machine translation,” Proceedings of ACL (2000). Both sides of the parallel corpus may then be parsed with syntactic parsers. This may facilitate detection of the NP/PPs in an input sentence.
[0021] In an embodiment, the model 405 may be a phrase translation model that extracts its phrase translation table from word alignments generated by the Giza++ toolkit. Details of this model are described in co-pending application Ser. No. 10/402,350, filed Mar. 27, 2003, which is incorporated herein in its entirety.
[0022] The decoder 407 may be a beam search decoder, which employs hypothesis recombination and stores the search states in a search graph which can be mined with standard finite state machine methods for n-best lists. An exemplary beam search decoder is described in Ueffing et al., “Generation of word graphs in statistical machine translation,” Proceedings of Empirical Methods in Natural Language Processing (EMNLP) (2002).
[0023] The re-ranker 415 may re-rank the n-best list provided by the decoder 407 using a maximum entropy learning method. The decoder 407 may annotate the n-best list of candidate translations with accuracy judgments based on the probability scores that the model assigns to each candidate translation. The initial features are the logarithm of probability scores, i.e., the language model score, the phrase translation score, and the reordering (distortion) score. The task for the learning method is to find a probability distribution p(e|f) that indicates if the candidate translation e is an accurate translation of the input f. The decision rule to pick the best translation is ebest=arg maxep(e|f)
[0024] Maximum entropy was chosen for its ability to deal with both real-valued and binary features. In alternative embodiments, other machine learning systems, such as support vector machines, may also be used.
[0025] The corpus 410 provides the empirical probability distribution by distributing the probability mass of the acceptable translations {eae |f}:{tilde over (p)}(eae |f)=|{eae |f}|−1. If none of the candidate translations for a given input f is acceptable, the NP/PP translation subsystem may select the candidates translations that are closest to reference translations measured by minimum edit distance.
[0026] The maximum entropy framework parameterizes the probability distribution as pλ(e|f)=expΣiλihi(f,e) where hi's are the feature values and the λi's are the feature weights. Since the NP/PP translation subsystem may have only a sample of the possible translations e for the given input f, the probability distribution may be normalized so that Σipλ(ei|f)=1 for a sample {ei} of candidate translations.
[0027] Maximum entropy learning finds a set of feature values λi so that Epλ[hi]=E p [hi] for each hi. These expectations are computed as sums over all candidate translations e for all inputs f:Σ(f,e){tilde over (p)}(f)pλ(e|f)hi(f,e)=Σ(f,e){tilde over (p)}(f ){tilde over (p)}(e|f)hi(f,e)
[0028] The NP/PP translation subsystem may exploit certain properties of NP/PP translation in order to improve NP/PP translation. The first of these (compounding of words) is addressed by preprocessing, while the others motivate features which are used in n-best list re-ranking.
[0029] Compounding of words, especially nouns, is common in a number of languages (German, Dutch, Finnish, Greek), and may pose a problem for machine translation. For example, the German word “Aktionsplan” may not be known to the system, but if the word were broken up into “Aktion” and “Plan”, the system could easily translate it into “action plan”, or “plan for action”. The issues for breaking up compounds include knowing the morphological rules for joining words, resolving ambiguities of breaking up a word (e.g., “Hauptsturm”→“Haupt-Turm” or “Haupt-Sturm”), and finding the right level of splitting granularity (e.g., “Frei”-“Tag” or “Freitag”).
[0030] In an embodiment, the NP/PP translation subsystem may include a compound splitting module 450, such as that described in application Ser. No. 10/884,174, filed on Jul. 2, 2004 , now U.S. Pat. No. 7,711,545, and entitled, “Empirical Methods for Splitting Compound Words With Application to Machine Translation”. The compound splitting module may first collect frequency statistics over words in a training corpus. Compounds may be broken up only into known words in the corpus. For each potential compound the compound splitting module may check if morphological splitting rules allow the compound to be broken up into such known words. The compound splitting module may then pick a splitting option S (perhaps not breaking up the compound at all) with highest geometric mean of word frequencies of its n parts pi:
[0031]
[0032] The German side of both the training and testing corpus may be broken up in this manner. The model may be trained on a compound-split corpus, and the input broken up before being passed on to the system.
[0033] The compound splitting module may work well with a phrase-based translation model, which can recover more easily from too eager or too timid splits than word-based models.
[0034] One of the features 420 used for re-ranking the n-best list may be web n-grams 452, in which the web may be used as a language model. Preliminary studies indicated that 30% of all 7-grams in new text can be also found on the web, as measured by consulting the search engine Google™, which currently indexes 3 billion web pages. This is only the case for 15% of 7-grams generated by the base translation system.
[0035] In an embodiment, the following binary features may be used: Does the candidate translation as a whole occur in the web? Do all n-grams in the candidate translation occur on the web? Do all n-grams in the candidate translation occur at least 10 times on the web? Both positive and negative features may be used for n-grams of the size 2 to 7.
[0036] In alternative embodiments the web may be integrated into the system by building a traditional n-gram language model, by using the web frequencies of the n-grams in a candidate translation, or by checking if all n-grams in a candidate translation occur on the web. Smoothing may be used to account for noise.
[0037] Syntactic features 454 may also be used for re-ranking. Syntactic features are computed over the syntactic parse trees of both input and candidate translation. The re-ranker may keep the syntactic parse tree inherited from the NP/PP detection process for the input NP/PPs. A part-of-speech tagger and syntactic parser may be used to annotate the candidate translation with its most likely syntactic parse tree.
[0038] In an embodiment, the following syntactic features may be used: preservation of the number of nouns; preservation of prepositions; and within a base NP/PP the determiner generally agree in number with the final noun (e.g., not: “this nice green flowers”). The features may be realized as integers, e.g., how many nouns did not preserve their number during translation? These features encode relevant general syntactic knowledge about the translation of noun phrases, and constitute soft constraints that may be overruled by other components of the system.
[0039] In an experiment, the Europarl corpus was used as the training corpus. The Europarl corpus is derived from the European parliament proceedings and consists of 20 million words of German (available at http://www.isi.edu/publications/europarl/). In this corpus, only part of the NP/PPs are translated as such into the foreign language. In addition, the word-alignment and syntactic parses may be faulty. As a consequence, in an experiment, only 43.4% of all NP/PPs could be aligned initially. This number was raised to 67.2% using a number of automatic data cleaning steps. The NP/PPs that partially aligned were broken up, and systematic parse errors were fixed. Certain word types that were inconsistently tagged as nouns in the two languages were harmonized (e.g., the German “wo” and the English “today”). Because adverb+NP/PP constructions (e.g., “specifically this issue”) were inconsistently parsed, the adverb was always stripped from these constructions. In addition, German verbal adjective constructions were broken up if they involved arguments or adjuncts (e.g., “der von mir gegessene Kuchen”=“the by me eaten cake”), because this poses problems more related to verbal clauses. Also, alignment points involving punctuation were stripped from the word alignment, and punctuation was stripped from the edges of NP/PPs.
[0040] A total of 737,388 NP/PP pairs were collected from the Europarl corpus as training data. German NP/PPs that did not consistently align to NP/PPs in English were detected at this point. The NP/PP translation subsystem may use the obtained data of unaligned NP/PPs for dealing with these special cases.
[0041] To evaluate these methods, all of the 1362 NP/PPs in 534 sentences from parts of the Europarl corpus which are not already used as training data were detected. The evaluation metric was human assessment: Can the translation provided by the system be part of an acceptable translation of the whole sentence? In other words, the noun phrase has to be translated correctly given the sentence context. The NP/PPs were extracted in the same way that NP/PPs were initially detected for the acquisition of the NP/PP training corpus. As a result, there were some problems with parse errors, leading to sentence fragments extracted as NP/PPs that cannot be translated correctly. Also, the test corpus contained all detected NP/PPs, even untranslatable ones.
[0042] The performance of the NP/PP translation subsystem was evaluated on the set of 1362 NP/PPs extracted from 534 sentences. The contributions of different components of the system are displayed in Table 1. Starting from the IBM Model 4 baseline, gains were achieved using a phrase-based translation model (+5.5%), applying compound splitting to training and test data (+2.8%), re-estimating the weights for the system components using the maximum entropy re-ranking frame-work (+1.5%), adding web count features (+1.7%) and syntactic features (+0.8%). Overall an improvement of 12.3% was achieved over the baseline. Improvements of 2.5% are statistically significant given the size of our test corpus.
[0043]
| TABLE 1 | ||||
|---|---|---|---|---|
| System | NP/PP Correct | BLEU | ||
| IBM Model 4 | 724 | 53.2% | 0.172 | |
| Phrase Model | 800 | 58.7% | 0.188 | |
| Compound Splitting | 838 | 61.5% | 0.195 | |
| Re-Estimated Param. | 858 | 63.0% | 0.197 | |
| Web Count Features | 881 | 64.7% | 0.198 | |
| Syntactic Features | 892 | 65.5% | 0.199 | |
[0044] Table 1 also provides scores for overall sentence translation quality. The chosen NP/PP translations are integrated into a general IBM Model 4 system that translates whole sentences. Performance is measured by the BLEU score, which measures similarity to a reference translation, and is described in Papineni et al., “BLEU: a method for automatic evaluation of machine translation,” Proceedings of the 40th Annual Meeting of the ACL (2002). As reference translation we used the English side of the parallel corpus. The BLEU scores track the improvements of our components, with an overall gain of 0.027.
[0045] According to exemplary embodiments, a machine translation system may include a machine-readable medium having executable instructions embodied thereon. The instructions are executable or otherwise operative to cause the machine translation system to perform a number of tasks. More specifically, the instructions may be executable to cause the machine translation system to detect a noun phrase and/or a prepositional phrase in an input string in a source language, generate a translation in a target language for the noun phrase and/or the prepositional phrase, and generate a translation of the input string in the target language including the translation for the noun phrase and/or the prepositional phrase. The instructions may also be executable to cause the machine translation system to generate a ranked n-best list of candidate translations and re-rank the n-best list using a machine learning article.
[0046] A number of embodiments have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. Accordingly, other embodiments are within the scope of the following claims.
Claims
The invention claimed is:
1. A method comprising:
receiving by a machine translation system an input string in a source language;
detecting by the machine translation system a noun phrase and a prepositional phrase in the input string;
generating by the machine translation system possible translations in a target language for the noun phrase and the prepositional phrase;
generating a ranked n-best list of candidate translations for the possible translations of the noun phrase and the prepositional phrase;
generating by the machine translation system a translation of a remaining portion of the input string in the target language; and
integrating the one or more n-best translations for the noun phrase and the prepositional phrase into the translation of the remaining portion of the input string to generate one or more sentence translations.
2. The method of claim 1, wherein said generating the translation for the noun phrase and the prepositional phrase comprises generating the translation using a first model; and
wherein said generating the translation of the input string comprises generating the translation using a second model different than the first model.
3. The method of claim 2, wherein the first model comprises a model trained using a corpus consisting of noun phrases and prepositional phrases.
4. The method of claim 2, wherein the first model comprises a phrase-based model.
5. The method of claim 1, wherein said generating possible translations for the noun phrase and the prepositional phrase comprises:
re-ranking the n-best list using a machine learning method.
6. The method of claim 5, wherein said machine learning method comprises a maximum entropy learning method.
7. The method of claim 5, wherein said re-ranking comprises re-ranking using one or more additional features based on known properties of noun phrases and prepositional phrases.
8. The method of claim 7, wherein the one or more additional features comprise syntactic features.
9. The method of claim 7, wherein the one or more additional features comprises using the web as a language model.
10. A machine translation system comprising:
a parser stored by a machine-readable medium and executable by a processor and stored in a memory to cause the machine translation system to detect a noun phrase and a prepositional phrase in an input string in a source language;
a translation subsystem including,
a first model stored by a machine-readable medium and executable by a processor and stored in a memory to cause the machine translation system to generate possible translations in a target language for the noun phrase and the prepositional phrase,
a first decoder stored by a machine-readable medium and executable to cause the machine translation system to generate a ranked n-best list including the possible translations, and
a selector to select a translation for the noun phrase and the prepositional phrase;
a second model stored by a machine-readable medium and executable to cause the machine translation system to generate possible translations in the target language for the input string in the source language, each of the possible translations comprising the selected translation for the noun phrase and the prepositional phrase; and
a second decoder to select one of the possible translations for the input string.
11. The machine translation system of claim 10, wherein the first model comprises a model trained using a corpus consisting of noun phrases and prepositional phrases.
12. The machine translation system of claim 10, wherein the first model comprises a phrase-based model.
13. The machine translation system of claim 10, wherein the translation subsystem further comprises:
a re-ranker to re-rank the n-best list using a machine learning method.
14. The machine translation system of claim 13, wherein the machine learning method comprises a maximum entropy learning method.
15. The machine translation system of claim 13, wherein the re-ranker is operative to re-rank the n-best list using one or more additional features based on known properties of noun phrases and prepositional phrases.
16. The machine translation system of claim 15, wherein the one or more additional features comprise syntactic features.
17. The machine translation system of claim 15, wherein the one or more additional features comprises using the web as a language model.
18. An article comprising a non-transitory machine-readable medium including machine-executable instructions, the instruction operative to cause a machine to:
detect a noun phrase and a prepositional phrase in an input string in a source language;
generate possible translations in a target language for the noun phrase and the prepositional phrase;
generate a ranked n-best list of candidate translations for the possible translations of the noun phrase and the prepositional phrase;
generate a translation of a remaining portion of input string in the target language; and
integrate the one or more n-best translations for the noun phrase and the prepositional phrase into the translation of the remaining portion of the input string to generate one or more sentence translations.
19. The article of claim 18, wherein the instructions for generating the translation for the noun phrase and the prepositional phrase comprise instructions operative to cause the machine to generate the translation using the first model; and wherein the instructions for generating the translation of the input string comprise instructions operative to cause the machine to generate the translation using a second model.
20. The article of claim 19, wherein the first model comprises a model trained using a corpus consisting of noun phrases and prepositional phrases.
21. The article of claim 19, wherein the first model comprises a phrase-based model.
22. The article of claim 18, wherein the instructions for generating possible translations for the noun phrase and the prepositional phrase comprise instructions operative to cause the machine to:
re-rank the n-best list using a machine learning article.
23. The article of claim 22, wherein said machine learning article comprises a maximum entropy learning article.
24. The article of claim 22, wherein the instructions for re-ranking comprise instructions operative to cause the machine to re-rank using one or more additional features based on known properties of noun phrases and prepositional phrases.
25. The article of claim 24, wherein the one or more additional features comprise syntactic features.
26. The article of claim 24, wherein the one or more additional features comprises using the web as a language model.
Patent Citations (321)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4502128(A) | 1985-02-01 | Okajima et al. | Applicant |
| US4599691(A) | 1986-07-01 | Sakaki et al. | Applicant |
| US4615002(A) | 1986-09-01 | Innes | Applicant |
| US4661924(A) | 1987-04-01 | Okamoto et al. | Applicant |
| US4787038(A) | 1988-11-01 | Doi et al. | Applicant |
| US4791587(A) | 1988-12-01 | Doi | Applicant |
| US4800522(A) | 1989-01-01 | Miyao et al. | Applicant |
| US4814987(A) | 1989-03-01 | Miyao et al. | Applicant |
| US4942526(A) | 1990-07-01 | Okajima et al. | Applicant |
| US4980829(A) | 1990-12-01 | Okajima et al. | Applicant |
| US5020112(A) | 1991-05-01 | Chou | Applicant |
| US5088038(A) | 1992-02-01 | Tanaka et al. | Applicant |
| US5091876(A) | 1992-02-01 | Kumano et al. | Applicant |
| US5146405(A) | 1992-09-01 | Church | Applicant |
| US5167504(A) | 1992-12-01 | Mann | Applicant |
| US5181163(A) | 1993-01-01 | Nakajima et al. | Applicant |
| US5212730(A) | 1993-05-01 | Wheatley et al. | Applicant |
| US5218537(A) | 1993-06-01 | Hemphill et al. | Applicant |
| US5220503(A) | 1993-06-01 | Suzuki et al. | Examiner |
| US5267156(A) | 1993-11-01 | Nomiyama | Applicant |
| US5268839(A) | 1993-12-01 | Kaji | Applicant |
| US5295068(A) | 1994-03-01 | Nishino et al. | Applicant |
| US5302132(A) | 1994-04-01 | Corder | Applicant |
| US5311429(A) | 1994-05-01 | Tominaga | Applicant |
| US5387104(A) | 1995-02-01 | Corder | Applicant |
| US5432948(A) | 1995-07-01 | Davis et al. | Applicant |
| US5442546(A) | 1995-08-01 | Kaji et al. | Applicant |
| US5477450(A) | 1995-12-01 | Takeda et al. | Applicant |
| US5477451(A) | 1995-12-01 | Brown et al. | Examiner |
| US5495413(A) | 1996-02-01 | Kutsumi et al. | Examiner |
| US5497319(A) | 1996-03-01 | Chong et al. | Applicant |
| US5510981(A) | 1996-04-01 | Berger et al. | Applicant |
| US5528491(A) | 1996-06-01 | Kuno et al. | Applicant |
| US5535120(A) | 1996-07-01 | Chong et al. | Applicant |
| US5541836(A) | 1996-07-01 | Church et al. | Applicant |
| US5541837(A) | 1996-07-01 | Fushimoto | Applicant |
| US5548508(A) | 1996-08-01 | Nagami | Applicant |
| US5644774(A) | 1997-07-01 | Fukumochi et al. | Applicant |
| US5675815(A) | 1997-10-01 | Yamauchi et al. | Applicant |
| US5687383(A) | 1997-11-01 | Nakayama et al. | Applicant |
| US5696980(A) | 1997-12-01 | Brew | Applicant |
| US5724593(A) | 1998-03-01 | Hargrave, III et al. | Applicant |
| US5752052(A) | 1998-05-01 | Richardson et al. | Applicant |
| US5754972(A) | 1998-05-01 | Baker et al. | Applicant |
| US5761631(A) | 1998-06-01 | Nasukawa | Applicant |
| US5761689(A) | 1998-06-01 | Rayson et al. | Applicant |
| US5768603(A) | 1998-06-01 | Brown et al. | Applicant |
| US5779486(A) | 1998-07-01 | Ho et al. | Applicant |
| US5781884(A) | 1998-07-01 | Pereira et al. | Applicant |
| US5794178(A) | 1998-08-01 | Caid et al. | Applicant |
| US5805832(A) | 1998-09-01 | Brown et al. | Applicant |
| US5806032(A) | 1998-09-01 | Sproat | Applicant |
| US5819265(A) | 1998-10-01 | Ravin et al. | Applicant |
| US5826219(A) | 1998-10-01 | Kutsumi | Examiner |
| US5826220(A) | 1998-10-01 | Takeda et al. | Applicant |
| US5845143(A) | 1998-12-01 | Yamauchi et al. | Applicant |
| US5848385(A) | 1998-12-01 | Poznanski et al. | Applicant |
| US5848386(A) | 1998-12-01 | Motoyama | Applicant |
| US5855015(A) | 1998-12-01 | Shoham | Applicant |
| US5864788(A) | 1999-01-01 | Kutsumi | Examiner |
| US5867811(A) | 1999-02-01 | O'Donoghue | Applicant |
| US5870706(A) | 1999-02-01 | Alshawi | Applicant |
| US5893134(A) | 1999-04-01 | O'Donoghue et al. | Applicant |
| US5903858(A) | 1999-05-01 | Saraki | Applicant |
| US5907821(A) | 1999-05-01 | Kaji et al. | Applicant |
| US5909681(A) | 1999-06-01 | Passera et al. | Applicant |
| US5930746(A) | 1999-07-01 | Ting | Examiner |
| US5966685(A) | 1999-10-01 | Flanagan et al. | Applicant |
| US5983169(A) | 1999-11-01 | Kozma | Examiner |
| US5987402(A) | 1999-11-01 | Murata et al. | Applicant |
| US5987404(A) | 1999-11-01 | Della Pietra et al. | Applicant |
| US5991710(A) | 1999-11-01 | Papineni et al. | Applicant |
| US5995922(A) | 1999-11-01 | Penteroudakis et al. | Applicant |
| US6018617(A) | 2000-01-01 | Sweitzer et al. | Applicant |
| US6031984(A) | 2000-02-01 | Walser | Applicant |
| US6032111(A) | 2000-02-01 | Mohri | Applicant |
| US6064819(A) | 2000-05-01 | Franssen et al. | Applicant |
| US6064951(A) | 2000-05-01 | Park et al. | Applicant |
| US6073143(A) | 2000-06-01 | Nishikawa et al. | Applicant |
| US6077085(A) | 2000-06-01 | Parry et al. | Applicant |
| US6092034(A) | 2000-07-01 | McCarley et al. | Applicant |
| US6119077(A) | 2000-09-01 | Shinozaki | Applicant |
| US6131082(A) | 2000-10-01 | Hargrave, III et al. | Applicant |
| US6161082(A) | 2000-12-01 | Goldberg et al. | Applicant |
| US6182014(B1) | 2001-01-01 | Kenyon et al. | Applicant |
| US6182027(B1) | 2001-01-01 | Nasukawa et al. | Applicant |
| US6205456(B1) | 2001-03-01 | Nakao | Applicant |
| US6206700(B1) | 2001-03-01 | Brown et al. | Applicant |
| US6223150(B1) | 2001-04-01 | Duan et al. | Applicant |
| US6233544(B1) | 2001-05-01 | Alshawi | Applicant |
| US6233545(B1) | 2001-05-01 | Datig | Applicant |
| US6233546(B1) | 2001-05-01 | Datig | Applicant |
| US6236958(B1) | 2001-05-01 | Lange et al. | Applicant |
| US6269351(B1) | 2001-07-01 | Black | Applicant |
| US6275789(B1) | 2001-08-01 | Moser et al. | Applicant |
| US6278967(B1) | 2001-08-01 | Akers et al. | Applicant |
| US6278969(B1) | 2001-08-01 | King et al. | Applicant |
| US6285978(B1) | 2001-09-01 | Bernth et al. | Applicant |
| US6289302(B1) | 2001-09-01 | Kuo | Applicant |
| US6304841(B1) | 2001-10-01 | Berger et al. | Applicant |
| US6311152(B1) | 2001-10-01 | Bai et al. | Applicant |
| US6317708(B1) | 2001-11-01 | Witbrock et al. | Applicant |
| US6327568(B1) | 2001-12-01 | Joost | Applicant |
| US6330529(B1) | 2001-12-01 | Ito | Applicant |
| US6330530(B1) | 2001-12-01 | Horiguchi et al. | Applicant |
| US6356864(B1) | 2002-03-01 | Foltz et al. | Applicant |
| US6360196(B1) | 2002-03-01 | Poznanski et al. | Applicant |
| US6389387(B1) | 2002-05-01 | Poznanski et al. | Applicant |
| US6393388(B1) | 2002-05-01 | Franz et al. | Applicant |
| US6393389(B1) | 2002-05-01 | Chanod et al. | Applicant |
| US6415250(B1) | 2002-07-01 | van den Akker | Applicant |
| US6460015(B1) | 2002-10-01 | Hetherington et al. | Applicant |
| US6470306(B1) | 2002-10-01 | Pringle et al. | Applicant |
| US6473729(B1) | 2002-10-01 | Gastaldo et al. | Applicant |
| US6480698(B2) | 2002-11-01 | Ho et al. | Applicant |
| US6490549(B1) | 2002-12-01 | Ulicny et al. | Applicant |
| US6498921(B1) | 2002-12-01 | Ho et al. | Applicant |
| US6502064(B1) | 2002-12-01 | Miyahira et al. | Applicant |
| US6529865(B1) | 2003-03-01 | Duan et al. | Applicant |
| US6535842(B1) | 2003-03-01 | Roche et al. | Applicant |
| US6587844(B1) | 2003-07-01 | Mohri | Applicant |
| US6609087(B1) | 2003-08-01 | Miller et al. | Examiner |
| US6647364(B1) | 2003-11-01 | Yumura et al. | Applicant |
| US6691279(B2) | 2004-02-01 | Yoden et al. | Applicant |
| US6745161(B1) | 2004-06-01 | Arnold et al. | Applicant |
| US6757646(B2) | 2004-06-01 | Marchisio | Applicant |
| US6778949(B2) | 2004-08-01 | Duan et al. | Applicant |
| US6782356(B1) | 2004-08-01 | Lopke | Applicant |
| US6810374(B2) | 2004-10-01 | Kang | Applicant |
| US6848080(B1) | 2005-01-01 | Lee et al. | Applicant |
| US6857022(B1) | 2005-02-01 | Scanlan | Applicant |
| US6885985(B2) | 2005-04-01 | Hull | Applicant |
| US6901361(B1) | 2005-05-01 | Portilla | Applicant |
| US6904402(B1) | 2005-06-01 | Wang et al. | Applicant |
| US6952665(B1) | 2005-10-01 | Shimomura et al. | Applicant |
| US6983239(B1) | 2006-01-01 | Epstein | Applicant |
| US6996518(B2) | 2006-02-01 | Jones et al. | Applicant |
| US6996520(B2) | 2006-02-01 | Levin | Applicant |
| US6999925(B2) | 2006-02-01 | Fischer et al. | Applicant |
| US7013262(B2) | 2006-03-01 | Tokuda et al. | Applicant |
| US7016827(B1) | 2006-03-01 | Ramaswamy et al. | Applicant |
| US7016977(B1) | 2006-03-01 | Dunsmoir et al. | Applicant |
| US7024351(B2) | 2006-04-01 | Wang | Applicant |
| US7031911(B2) | 2006-04-01 | Zhou et al. | Examiner |
| US7050964(B2) | 2006-05-01 | Menzes et al. | Examiner |
| US7085708(B2) | 2006-08-01 | Manson | Examiner |
| US7089493(B2) | 2006-08-01 | Hatori et al. | Applicant |
| US7103531(B2) | 2006-09-01 | Moore | Applicant |
| US7107204(B1) | 2006-09-01 | Liu et al. | Applicant |
| US7107215(B2) | 2006-09-01 | Ghali | Applicant |
| US7113903(B1) | 2006-09-01 | Riccardi et al. | Examiner |
| US7143036(B2) | 2006-11-01 | Weise | Examiner |
| US7146358(B1) | 2006-12-01 | Gravano et al. | Applicant |
| US7149688(B2) | 2006-12-01 | Schalkwyk | Applicant |
| US7174289(B2) | 2007-02-01 | Sukehiro | Applicant |
| US7177792(B2) | 2007-02-01 | Knight et al. | Applicant |
| US7191115(B2) | 2007-03-01 | Moore | Applicant |
| US7197451(B1) | 2007-03-01 | Carter et al. | Applicant |
| US7206736(B2) | 2007-04-01 | Moore | Applicant |
| US7209875(B2) | 2007-04-01 | Quirk et al. | Applicant |
| US7219051(B2) | 2007-05-01 | Moore | Applicant |
| US7239998(B2) | 2007-07-01 | Xun | Applicant |
| US7249012(B2) | 2007-07-01 | Moore | Examiner |
| US7249013(B2) | 2007-07-01 | Al-Onaizan et al. | Examiner |
| US7283950(B2) | 2007-10-01 | Pournasseh et al. | Applicant |
| US7295962(B2) | 2007-11-01 | Marcu | Applicant |
| US7302392(B1) | 2007-11-01 | Thenthiruperai et al. | Applicant |
| US7319949(B2) | 2008-01-01 | Pinkham | Applicant |
| US7340388(B2) | 2008-03-01 | Soricut et al. | Applicant |
| US7346487(B2) | 2008-03-01 | Li | Applicant |
| US7346493(B2) | 2008-03-01 | Ringger et al. | Applicant |
| US7349839(B2) | 2008-03-01 | Moore | Applicant |
| US7356457(B2) | 2008-04-01 | Pinkham et al. | Applicant |
| US7369998(B2) | 2008-05-01 | Sarich et al. | Applicant |
| US7373291(B2) | 2008-05-01 | Garst | Applicant |
| US7383542(B2) | 2008-06-01 | Richardson et al. | Applicant |
| US7389222(B1) | 2008-06-01 | Langmead et al. | Applicant |
| US7389234(B2) | 2008-06-01 | Schmid et al. | Applicant |
| US7403890(B2) | 2008-07-01 | Roushar | Examiner |
| US7409332(B2) | 2008-08-01 | Moore | Applicant |
| US7409333(B2) | 2008-08-01 | Wilkinson et al. | Applicant |
| US7447623(B2) | 2008-11-01 | Appleby | Applicant |
| US7454326(B2) | 2008-11-01 | Marcu et al. | Applicant |
| US7496497(B2) | 2009-02-01 | Liu | Applicant |
| US7533013(B2) | 2009-05-01 | Marcu | Applicant |
| US7536295(B2) | 2009-05-01 | Cancedda et al. | Applicant |
| US7546235(B2) | 2009-06-01 | Brockett et al. | Applicant |
| US7565281(B2) | 2009-07-01 | Appleby | Applicant |
| US7574347(B2) | 2009-08-01 | Wang | Applicant |
| US7580830(B2) | 2009-08-01 | Al-Onaizan et al. | Applicant |
| US7620538(B2) | 2009-11-01 | Marcu et al. | Applicant |
| US7624005(B2) | 2009-11-01 | Koehn et al. | Examiner |
| US7624020(B2) | 2009-11-01 | Yamada et al. | Applicant |
| US7627479(B2) | 2009-12-01 | Travieso et al. | Applicant |
| US7680646(B2) | 2010-03-01 | Lux-Pogodalla et al. | Applicant |
| US7689405(B2) | 2010-03-01 | Marcu | Applicant |
| US7698125(B2) | 2010-04-01 | Graehl et al. | Applicant |
| US7707025(B2) | 2010-04-01 | Whitelock | Applicant |
| US7711545(B2) | 2010-05-01 | Koehn | Applicant |
| US7716037(B2) | 2010-05-01 | Precoda et al. | Applicant |
| US7813918(B2) | 2010-10-01 | Muslea et al. | Applicant |
| US7925494(B2) | 2011-04-01 | Cheng et al. | Applicant |
| US7974833(B2) | 2011-07-01 | Soricut et al. | Applicant |
| US8060360(B2) | 2011-11-01 | He | Applicant |
| US8145472(B2) | 2012-03-01 | Shore et al. | Applicant |
| US2001/0009009(A1) | 2001-07-01 | Iizuka | Applicant |
| US2001/0029455(A1) | 2001-10-01 | Chin et al. | Applicant |
| US2002/0002451(A1) | 2002-01-01 | Sukehiro | Applicant |
| US2002/0013693(A1) | 2002-01-01 | Fuji | Applicant |
| US2002/0040292(A1) | 2002-04-01 | Marcu | Applicant |
| US2002/0046018(A1) | 2002-04-01 | Marcu et al. | Applicant |
| US2002/0046262(A1) | 2002-04-01 | Heilig et al. | Applicant |
| US2002/0078091(A1) | 2002-06-01 | Vu et al. | Applicant |
| US2002/0099744(A1) | 2002-07-01 | Coden et al. | Applicant |
| US2002/0111788(A1) | 2002-08-01 | Kimpara | Applicant |
| US2002/0111789(A1) | 2002-08-01 | Hull | Applicant |
| US2002/0111967(A1) | 2002-08-01 | Nagase | Applicant |
| US2002/0152063(A1) | 2002-10-01 | Tokieda et al. | Applicant |
| US2002/0169592(A1) | 2002-11-01 | Aityan | Applicant |
| US2002/0188438(A1) | 2002-12-01 | Knight et al. | Applicant |
| US2002/0188439(A1) | 2002-12-01 | Marcu | Applicant |
| US2002/0198699(A1) | 2002-12-01 | Greene et al. | Applicant |
| US2002/0198701(A1) | 2002-12-01 | Moore | Applicant |
| US2002/0198713(A1) | 2002-12-01 | Franz et al. | Examiner |
| US2003/0009322(A1) | 2003-01-01 | Marcu | Applicant |
| US2003/0023423(A1) | 2003-01-01 | Yamada et al. | Examiner |
| US2003/0144832(A1) | 2003-07-01 | Harris | Applicant |
| US2003/0154071(A1) | 2003-08-01 | Shreve | Applicant |
| US2003/0158723(A1) | 2003-08-01 | Masuichi et al. | Applicant |
| US2003/0176995(A1) | 2003-09-01 | Sukehiro | Applicant |
| US2003/0182102(A1) | 2003-09-01 | Corston-Oliver et al. | Applicant |
| US2003/0191626(A1) | 2003-10-01 | Al-Onaizan et al. | Applicant |
| US2003/0204400(A1) | 2003-10-01 | Marcu et al. | Applicant |
| US2003/0216905(A1) | 2003-11-01 | Chelba et al. | Examiner |
| US2003/0217052(A1) | 2003-11-01 | Rubenczyk et al. | Applicant |
| US2003/0233222(A1) | 2003-12-01 | Soricut et al. | Applicant |
| US2004/0015342(A1) | 2004-01-01 | Garst | Applicant |
| US2004/0024581(A1) | 2004-02-01 | Koehn et al. | Examiner |
| US2004/0030551(A1) | 2004-02-01 | Marcu et al. | Applicant |
| US2004/0035055(A1) | 2004-02-01 | Zhu et al. | Applicant |
| US2004/0059708(A1) | 2004-03-01 | Dean et al. | Applicant |
| US2004/0068411(A1) | 2004-04-01 | Scanlan | Applicant |
| US2004/0098247(A1) | 2004-05-01 | Moore | Applicant |
| US2004/0102957(A1) | 2004-05-01 | Levin | Applicant |
| US2004/0111253(A1) | 2004-06-01 | Luo et al. | Applicant |
| US2004/0122656(A1) | 2004-06-01 | Abir | Applicant |
| US2004/0167768(A1) | 2004-08-01 | Travieso et al. | Applicant |
| US2004/0167784(A1) | 2004-08-01 | Travieso et al. | Applicant |
| US2004/0193401(A1) | 2004-09-01 | Ringger et al. | Applicant |
| US2004/0230418(A1) | 2004-11-01 | Kitamura | Applicant |
| US2004/0237044(A1) | 2004-11-01 | Travieso et al. | Applicant |
| US2004/0260532(A1) | 2004-12-01 | Richardson et al. | Applicant |
| US2005/0021322(A1) | 2005-01-01 | Richardson et al. | Applicant |
| US2005/0021517(A1) | 2005-01-01 | Marchisio | Applicant |
| US2005/0026131(A1) | 2005-02-01 | Elzinga et al. | Applicant |
| US2005/0033565(A1) | 2005-02-01 | Koehn | Applicant |
| US2005/0060160(A1) | 2005-03-01 | Roh et al. | Applicant |
| US2005/0075858(A1) | 2005-04-01 | Pournasseh et al. | Applicant |
| US2005/0102130(A1) | 2005-05-01 | Quirk et al. | Applicant |
| US2005/0125218(A1) | 2005-06-01 | Rajput et al. | Applicant |
| US2005/0149315(A1) | 2005-07-01 | Flanagan et al. | Applicant |
| US2005/0171757(A1) | 2005-08-01 | Appleby | Applicant |
| US2005/0204002(A1) | 2005-09-01 | Friend | Applicant |
| US2005/0228640(A1) | 2005-10-01 | Aue et al. | Applicant |
| US2005/0228642(A1) | 2005-10-01 | Mau et al. | Applicant |
| US2005/0228643(A1) | 2005-10-01 | Munteanu et al. | Applicant |
| US2005/0234701(A1) | 2005-10-01 | Graehl et al. | Applicant |
| US2005/0267738(A1) | 2005-12-01 | Wilkinson et al. | Applicant |
| US2006/0004563(A1) | 2006-01-01 | Campbell et al. | Examiner |
| US2006/0015320(A1) | 2006-01-01 | Och | Applicant |
| US2006/0015323(A1) | 2006-01-01 | Udupa et al. | Applicant |
| US2006/0018541(A1) | 2006-01-01 | Chelba et al. | Applicant |
| US2006/0020448(A1) | 2006-01-01 | Chelba et al. | Applicant |
| US2006/0095248(A1) | 2006-05-01 | Menezes et al. | Applicant |
| US2006/0111891(A1) | 2006-05-01 | Menezes et al. | Applicant |
| US2006/0111892(A1) | 2006-05-01 | Menezes et al. | Applicant |
| US2006/0111896(A1) | 2006-05-01 | Menezes et al. | Applicant |
| US2006/0129424(A1) | 2006-06-01 | Chan | Applicant |
| US2006/0142995(A1) | 2006-06-01 | Knight et al. | Applicant |
| US2006/0150069(A1) | 2006-07-01 | Chang | Applicant |
| US2006/0190241(A1) | 2006-08-01 | Goutte et al. | Applicant |
| US2007/0016400(A1) | 2007-01-01 | Soricutt et al. | Applicant |
| US2007/0016401(A1) | 2007-01-01 | Ehsani et al. | Applicant |
| US2007/0033001(A1) | 2007-02-01 | Muslea et al. | Applicant |
| US2007/0094169(A1) | 2007-04-01 | Yamada et al. | Applicant |
| US2007/0112553(A1) | 2007-05-01 | Jacobson | Applicant |
| US2007/0112555(A1) | 2007-05-01 | Lavi et al. | Applicant |
| US2007/0112556(A1) | 2007-05-01 | Lavi et al. | Applicant |
| US2007/0122792(A1) | 2007-05-01 | Galley et al. | Applicant |
| US2007/0168450(A1) | 2007-07-01 | Prajapat et al. | Applicant |
| US2007/0180373(A1) | 2007-08-01 | Bauman et al. | Applicant |
| US2007/0219774(A1) | 2007-09-01 | Quirk et al. | Applicant |
| US2007/0250306(A1) | 2007-10-01 | Marcu et al. | Applicant |
| US2007/0269775(A1) | 2007-11-01 | Andreev et al. | Applicant |
| US2007/0294076(A1) | 2007-12-01 | Shore et al. | Applicant |
| US2008/0052061(A1) | 2008-02-01 | Kim et al. | Applicant |
| US2008/0114583(A1) | 2008-05-01 | Al-Onaizan et al. | Applicant |
| US2008/0154581(A1) | 2008-06-01 | Lavi et al. | Applicant |
| US2008/0183555(A1) | 2008-07-01 | Walk | Applicant |
| US2008/0215418(A1) | 2008-09-01 | Kolve et al. | Applicant |
| US2008/0249760(A1) | 2008-10-01 | Marcu et al. | Applicant |
| US2008/0270109(A1) | 2008-10-01 | Och | Applicant |
| US2008/0270112(A1) | 2008-10-01 | Shimohata | Applicant |
| US2008/0281578(A1) | 2008-11-01 | Kumaran et al. | Applicant |
| US2008/0307481(A1) | 2008-12-01 | Panje | Applicant |
| US2009/0076792(A1) | 2009-03-01 | Lawson-Tancred | Applicant |
| US2009/0083023(A1) | 2009-03-01 | Foster et al. | Applicant |
| US2009/0119091(A1) | 2009-05-01 | Sarig | Applicant |
| US2009/0326912(A1) | 2009-12-01 | Ueffing | Applicant |
| US2010/0017293(A1) | 2010-01-01 | Lung et al. | Applicant |
| US2010/0042398(A1) | 2010-02-01 | Marcu et al. | Applicant |
| US2010/0174524(A1) | 2010-07-01 | Koehn | Applicant |
| US2011/0029300(A1) | 2011-02-01 | Marcu et al. | Applicant |
| US2011/0082684(A1) | 2011-04-01 | Soricut et al. | Applicant |
| EP469884(A2) | 1992-02-01 | Applicant | |
| EP715265(A2) | 1996-06-01 | Applicant | |
| EP933712(A2) | 1999-08-01 | Applicant | |
| EP933712(A3) | 2001-01-01 | Applicant | |
| JP7244666 | 1995-01-01 | Applicant | |
| JP10011447 | 1998-01-01 | Applicant | |
| JP11272672 | 1999-10-01 | Applicant |
Non-Patent Literature (223)
- 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 (ACL), Philadelphia, PA, Jul. 2002.Examiner
- Schmidt, H. and Schulte im Walde, S. (2000). Robust German noun chunking with a probabilistic context-free grammar. In Proceedings of COLING.Examiner
- Kupiec, Julian. 1993. An algorithm for finding noun phrase correspondences in bilingual corpora. In Proceedings of the 31st Annual Meeting of the ACL, pp. 17-22.Examiner
- 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, Jul. 2002.Examiner
- Abney, Stephen, “Parsing By Chunks,” 1991, Principle-Based Parsing: Computation and Psycholinguistics, vol. 44, pp. 257-279.Applicant
- Al-Onaizan et al., “Statistical Machine Translation,” 1999, JHU Summer Tech Workshop, Final Report, pp. 1-42.Applicant
- Al-Onaizan, Y. and Knight, K., “Named Entity Translation: Extended Abstract” 2002, Proceedings of HLT-02, San Diego, CA.Applicant
- Al-Onaizan, Y. and Knight, K., “Translating Named Entities Using Monolingual and Bilingual Resources,” 2002, Proc. of the 40th Annual Meeting of the ACL,pp. 400-408.Applicant
- Al-Onaizan et al., “Translating with Scarce Resources,” 2000, 17th National Conference of the American Association for Artificial Intelligence, Austin, TX, pp. 672-678.Applicant
- Alshawi et al., “Learning Dependency Translation Models as Collections of Finite-State Head Transducers,” 2000, Computational Linguistics, vol. 26, pp. 45-60.Applicant
- Arbabi et al., “Algorithms for Arabic name transliteration,” Mar. 1994, IBM Journal of Research and Development, vol. 38, Issue 2, pp. 183-194.Applicant
- Barnett et al., “Knowledge and Natural Language Processing,” Aug. 1990, Communications of the ACM, vol. 33, Issue 8, pp. 50-71.Applicant
- 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.Applicant
- Bangalore, S. And Rambow, O., “Exploiting a Probabilistic Hierarchical Model for Generation,” 2000, Proc. of 18th conf. on Computational Linguistics, vol. 1, pp. 42-48.Applicant
- Bangalore, S. and Rambow, O., “Evaluation Metrics for Generation,” 2000, Proc. of the 1st International Natural Language Generation Conf., vol. 14, p. 1-8.Applicant
- Bangalore, S. and Rambow, O., “Using TAGs, a Tree Model, and a Language Model for Generation,” May 2000, Workshop TAG+5, Paris.Applicant
- Baum, Leonard, “An Inequality and Associated Maximization Technique in Statistical Estimation for Probabilistic Functions of Markov Processes”, 1972, Inequalities 3:1-8.Applicant
- Bikel et al., “An Algorithm that Learns What's in a Name,” 1999, Machine Learning Journal Special Issue on Natural Language Learning, vol. 34, pp. 211-232.Applicant
- Brants, Thorsten, “TnT—A Statistical Part-of-Speech Tagger,” 2000, Proc. of the 6th Applied Natural Language Processing Conference, Seattle.Applicant
- Brill, Eric. “Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part of Speech Tagging”, 1995, Computational Linguistics, vol. 21, No. 4, pp. 543-565.Applicant
- Brown et al., “A Statistical Approach to Machine Translation,” Jun. 1990, Computational Linguistics,. vol. 16, No. 2, pp. 79-85.Applicant
- Brown, Ralf, “Automated Dictionary Extraction for “Knowledge-Free” Example-Based Translation,” 1997, Proc. of 7th Int'l Conf. on Theoretical and Methodological Issues in MT, Santa Fe, NM, pp. 111-118.Applicant
- Brown et al., “The Mathematics of Statistical Machine Translation: Parameter Estimation,” 1993, Computational Linguistics, vol. 19, Issue 2, pp. 263-311.Applicant
- Brown et al., “Word-Sense Disambiguation Using Statistical Methods,” 1991, Proc. of 29th Annual ACL, pp. 264-270.Applicant
- Carl, Michael. “A Constructivist Approach to Machine Translation,” 1998, New Methods of Language Processing and Computational Natural Language Learning, pp. 247-256.Applicant
- Chen, K. and Chen, H., “Machine Translation: An Integrated Approach,” 1995, Proc. of 6th Int'l Conf. on Theoretical and Methodological Issue in MT, pp. 287-294.Applicant
- Chinchor, Nancy, “MUC-7 Named Entity Task Definition,” 1997, Version 3.5.Applicant
- Clarkson, P. and Rosenfeld, R., “Statistical Language Modeling Using the CMU-Cambridge Toolkit”, 1997, Proc. ESCA Eurospeech, Rhodes, Greece, pp. 2707-2710.Applicant
- Corston-Oliver, Simon, “Beyond String Matching and Cue Phrases: Improving Efficiency and Coverage in Discourse Analysis”,1998, The AAAI Spring Symposium on Intelligent Text Summarization, pp. 9-15.Applicant
- Dagan, I. and Itai, A., “Word Sense Disambiguation Using a Second Language Monolingual Corpus”, 1994, Computational Linguistics, vol. 20, No. 4, pp. 563-596.Applicant
- Dempster et al., “Maximum Likelihood from Incomplete Data via the EM Algorithm”, 1977, Journal of the Royal Statistical Society, vol. 39, No. 1, pp. 1-38.Applicant
- Diab, M. and Finch, S., “A Statistical Word-Level Translation Model for Comparable Corpora,” 2000, In Proc.of the Conference on ContentBased Multimedia Information Access (RIAO).Applicant
- Elhadad, M. and Robin, J., “An Overview of SURGE: a Reusable Comprehensive Syntactic Realization Component,” 1996, Technical Report 96-03, Department of Mathematics and Computer Science, Ben Gurion University, Beer Sheva, Israel.Applicant
- Elhadad, M. and Robin, J., “Controlling Content Realization with Functional Unification Grammars”, 1992, Aspects of Automated Natural Language Generation, Dale et al. (eds)., Springer Verlag, pp. 89-104.Applicant
- Elhadad et al., “Floating Constraints in Lexical Choice”, 1996, ACL, 23(2): 195-239.Applicant
- Elhadad, Michael, “FUF: the Universal Unifier User Manual Version 5.2”, 1993, Department of Computer Science, Ben Gurion University, Beer Sheva, Israel.Applicant
- Elhadad. M. and Robin, J., “SURGE: a Comprehensive Plug-in Syntactic Realization Component for Text Generation”, 1999 (available at http://www.cs.bgu.ac.il/˜elhadad/pub.html).Applicant
- Elhadad, Michael, “Using Argumentation to Control Lexical Choice: A Functional Unification Implementation”, 1992, Ph.D. Thesis, Graduate School of Arts and Sciences, Columbia University.Applicant
- Fung, Pascale, “Compiling Bilingual Lexicon Entries From a Non-Parallel English-Chinese Corpus”, 1995, Proc. of the Third Workshop on Very Large Corpora, Boston, MA, pp. 173-183.Applicant
- Fung, P. and Yee, L., “An IR Approach for Translating New Words from Nonparallel, Comparable Texts”, 1998, 36th Annual Meeting of the ACL, 17th International Conference on Computational Linguistics, pp. 414-420.Applicant
- Gale, W. and Church, K., “A Program for Aligning Sentences in Bilingual Corpora,” 1991, 29th Annual Meeting of the ACL, pp. 177-183.Applicant
- Germann, Ulrich, “Building a Statistical Machine Translation System from Scratch: How Much Bang for the Buck Can We Expect?” Proc. of the Data-Driven MT Workshop of ACL-01, Toulouse, France, 2001.Applicant
- Germann et al., “Fast Decoding and Optimal Decoding for Machine Translation”, 2001, Proc. of the 39th Annual Meeting of the ACL, Toulouse, France, pp. 228-235.Applicant
- Diab, Mona, “An Unsupervised Method for Multilingual Word Sense Tagging Using Parallel Corpora: A Preliminary Investigation”, 2000, SIGLEX Workshop on Word Senses and Multi-Linguality, pp. 1-9.Applicant
- Grefenstette, Gregory, “The World Wide Web as a Resource for Example-Based Machine Translation Tasks”, 1999, Translating and the Computer 21, Proc. of the 21st International Conf. on Translating and the Computer, London, UK, 12 pp.Applicant
- Hatzivassiloglou, V. et al., “Unification-Based Glossing”, 1995, Proc. of the International Joint Conference on Artificial Intelligence, pp. 1382-1389.Applicant
- Ide, N. and Veronis, J., “Introduction to the Special Issue on Word Sense Disambiguation: The State of the Art”, Mar. 1998, Computational Linguistics, vol. 24, Issue 1, pp. 2-40.Applicant
- Imamura, Kenji, “Hierarchical Phrase Alignment Harmonized with Parsing”, 2001, in Proc. of NLPRS, Tokyo.Applicant
- Jelinek, F., “Fast Sequential Decoding Algorithm Using a Stack”, Nov. 1969, IBM J. Res. Develop., vol. 13, No. 6, pp. 675-685.Applicant
- Jones, K. Sparck, “Experiments in Relevance Weighting of Search Terms”, 1979, Information Processing & Management, vol. 15, Pergamon Press Ltd., UK, pp. 133-144.Applicant
- Knight, K. and Yamada, K., “A Computational Approach to Deciphering Unknown Scripts,” 1999, Proc. of the ACL Workshop on Unsupervised Learning in Natural Language Processing.Applicant
- Knight, K. and Al-Onaizan, Y., “A Primer on Finite-State Software for Natural Language Processing”, 1999 (available at http://www.isi.edu/licensed-sw/carmel).Applicant
- Knight, Kevin, “A Statistical MT Tutorial Workbook,” 1999, JHU Summer Workshop (available at http://www.isi.edu/natural-language/mt/wkbk.rtf).Applicant
- Knight, Kevin, “Automating Knowledge Acquisition for Machine Translation,” 1997, AI Magazine 18(4).Applicant
- Knight, K. and Chander, I., “Automated Postediting of Documents,”1994, Proc. of the 12th Conference on Artificial Intelligence, pp. 779-784.Applicant
- Knight, K. and Luk, S., “Building a Large-Scale Knowledge Base for Machine Translation,” 1994, Proc. of the 12th Conference on Artificial Intelligence, pp. 773-778.Applicant
- Knight, Kevin, “Connectionist Ideas and Algorithms,” Nov. 1990, Communications of the ACM, vol. 33, No. 11, pp. 59-74.Applicant
- Knight, Kevin, “Decoding Complexity in Word-Replacement Translation Models”, 1999, Computational Linguistics, 25(4).Applicant
- Knight et al., “Filling Knowledge Gaps in a Broad-Coverage Machine Translation System”, 1995, Proc. of the 14th International Joint Conference on Artificial Intelligence, Montreal, Canada, vol. 2, pp. 1390-1396.Applicant
- Knight, Kevin, “Integrating Knowledge Acquisition and Language Acquisition,” May 1992, Journal of Applied Intelligence, vol. 1, No. 4.Applicant
- Knight et al., “Integrating Knowledge Bases and Statistics in MT,” 1994, Proc. of the Conference of the Association for Machine Translation in the Americas.Applicant
- Knight, Kevin, “Learning Word Meanings by Instruction,”1996, Proc. of the National Conference on Artificial Intelligence, vol. 1, pp. 447-454.Applicant
- Knight, K. and Graehl, J., “Machine Transliteration”, 1997, Proc. of the ACL-97, Madrid, Spain.Applicant
- Knight, K. et al., “Machine Transliteration of Names in Arabic Text,” 2002, Proc. of the ACL Workshop on Computational Approaches to Semitic Languages.Applicant
- Knight, K. and Marcu, D., “Statistics-Based Summarization—Step One: Sentence Compression,” 2000, American Association for Artificial Intelligence Conference, pp. 703-710.Applicant
- Knight et al., “Translation with Finite-State Devices,” 1998, Proc. of the 3rd AMTA Conference, pp. 421-437.Applicant
- Knight, K. and Hatzivassiloglou, V., “Two-Level, Many-Paths Generation,” 1995, 'Proc. of the 33rd Annual Conference of the ACL, pp. 252-260.Applicant
- Knight, Kevin, “Unification: A Multidisciplinary Survey,” 1989, ACM Computing Surveys, vol. 21, No. 1.Applicant
- Koehn, P. and Knight, K., “ChunkMT: Statistical Machine Translation with Richer Linguistic Knowledge,” Apr. 2002, Information Sciences Institution.Applicant
- Koehn, P. and Knight, K., “Estimating Word Translation Probabilities from Unrelated Monolingual Corpora Using the EM Algorithm,” 2000, Proc. of the 17th meeting of the AAAI.Applicant
- Koehn, P. and Knight, K., “Knowledge Sources for Word-Level Translation Models,” 2001, Conference on Empirical Methods in Natural Language Processing.Applicant
- Kurohashi, S. and Nagao, M., “Automatic Detection of Discourse Structure by Checking Surface Information in Sentences,” 1994, Proc. of COL-LING '94, vol. 2, pp. 1123-1127.Applicant
- Langkilde-Geary, Irene, “An Empirical Verification of Coverage and Correctness for a General-Purpose Sentence Generator,” 1998, Proc. 2nd Int'l Natural Language Generation Conference.Applicant
- Langkilde-Geary, Irene, “A Foundation for General-Purpose Natural Language Generation: Sentence Realization Using Probabilistic Models of Language,” 2002, Ph.D. Thesis, Faculty of the Graduate School, University of Southern California.Applicant
- Langkilde, Irene, “Forest-Based Statistical Sentence Generation,” 2000, Proc. of the 1st Conference on North American chapter of the ACL, Seattle, WA, pp. 170-177.Applicant
- Langkilde, I. and Knight, K., “The Practical Value of N-Grams in Generation,” 1998, Proc. of the 9th International Natural Language Generation Workshop, p. 248-255.Applicant
- Langkilde, I. and Knight, K., “Generation that Exploits Corpus-Based Statistical Knowledge,” 1998, Proc. of the COLING-ACL, pp. 704-710.Applicant
- Mann, G. and Yarowsky, D., “Multipath Translation Lexicon Induction via Bridge Languages,” 2001, Proc. of the 2nd Conference of the North American Chapter of the ACL, Pittsburgh, PA, pp. 151-158.Applicant
- Manning, C. and Schutze, H., “Foundations of Statistical Natural Language Processing,” 2000, The MIT Press, Cambridge, MA [redacted].Applicant
- Marcu, D. and Wong, W., “A Phrase-Based, Joint Probability Model for Statistical Machine Translation,” 2002, Proc. of ACL-2 conference on Empirical Methods in Natural Language Processing, vol. 10, pp. 133-139.Applicant
- Marcu, Daniel, “Building Up Rhetorical Structure Trees,” 1996, Proc. of the National Conference on Artificial Intelligence and Innovative Applications of Artificial Intelligence Conference, vol. 2, pp. 1069-1074.Applicant
- Marcu, Daniel, “Discourse trees are good indicators of importance in text,” 1999, Advances in Automatic Text Summarization, The MIT Press, Cambridge, MA.Applicant
- Marcu, Daniel, “Instructions for Manually Annotating the Discourse Structures of Texts,” 1999, Discourse Annotation, pp. 1-49.Applicant
- Marcu, Daniel, “The Rhetorical Parsing of Natural Language Texts,” 1997, Proceedings of ACL/EACL '97, pp. 96-103.Applicant
- Marcu, Daniel, “The Rhetorical Parsing, Summarization, and Generation of Natural Language Texts,” 1997, Ph.D. Thesis, Graduate Department of Computer Science, University of Toronto.Applicant
- Marcu, Daniel, “Towards a Unified Approach to Memory- and Statistical-Based Machine Translation,” 2001, Proc. of the 39th Annual Meeting of the ACL, pp. 378-385.Applicant
- Melamed, I. Dan, “A Word-to-Word Model of Translational Equivalence,” 1997, Proc. of the 35th Annual Meeting of the ACL, Madrid, Spain, pp. 490-497.Applicant
- Melamed, I. Dan, “Automatic Evaluation and Uniform Filter Cascades for Inducing N-Best Translation Lexicons,” 1995, Proc. of the 3rd Workshop on Very Large Corpora, Boston, MA, pp. 184-198.Applicant
- Melamed, I. Dan, “Empirical Methods for Exploiting Parallel Texts,” 2001, MIT Press, Cambridge, MA [table of contents].Applicant
- Meng et al., “Generating Phonetic Cognates to Handle Named Entities in English-Chinese Cross-Language Spoken Document Retrieval,” 2001, IEEE Workshop on Automatic Speech Recognition and Understanding, pp. 311-314.Applicant
- Miike et al., “A full-text retrieval system with a dynamic abstract generation function,” 1994, Proceedings of SI-GIR '94, pp. 152-161.Applicant
- Mikheev et al., “Named Entity Recognition without Gazeteers,” 1999, Proc. of European Chapter of the ACL, Bergen, Norway, pp. 1-8.Applicant
- Monasson et al., “Determining computational complexity from characteristic ‘phase transitions’,” Jul. 1999, Nature Magazine, vol. 400, pp. 133-137.Applicant
- Mooney, Raymond, “Comparative Experiments on Disambiguating Word Senses: An Illustration of the Role of Bias in Machine Learning,” 1996, Proc. of the Conference on Empirical Methods in Natural Language Processing, pp. 82-91.Applicant
- Niessen,S. and Ney, H, “Toward hierarchical models for statistical machine translation of inflected languages,” 2001, Data-Driven Machine Translation Workshop, Toulouse, France, pp. 47-54.Applicant
- Och, F. and Ney, H, “Improved Statistical Alignment Models,” 2000, 38th Annual Meeting of the ACL, Hong Kong, pp. 440-447.Applicant
- Och et al., “Improved Alignment Models for Statistical Machine Translation,” 1999, Proc. of the Joint Conf. of Empirical Methods in Natural Language Processing and Very Large Corpora, pp. 20-28.Applicant
- Papineni et al., “Bleu: a Method for Automatic Evaluation of Machine Translation,” 2001, IBM Research Report, RC22176(WO102-022).Applicant
- Pla et al., “Tagging and Chunking with Bigrams,” 2000, Proc. of the 18th Conference on Computational Linguistics, vol. 2, pp. 614-620.Applicant
- Rapp, Reinhard, Automatic Identification of Word Translations from Unrelated English and German Corpora, 1999, 37th Annual Meeting of the ACL, pp. 519-526.Applicant
- Rapp, Reinhard, “Identifying Word Translations in Non-Parallel Texts,” 1995, 33rd Annual Meeting of the ACL, pp. 320-322.Applicant
- Resnik, P. and Yarowsky, D., “A Perspective on Word Sense Disambiguation Methods and Their Evaluation,” 1997, Proceedings of SIGLEX '97, Washington, DC, pp. 79-86.Applicant
- Resnik, Philip, “Mining the Web for Bilingual Text,” 1999, 37th Annual Meeting of the ACL, College Park, MD, pp. 527-534.Applicant
- Rich, E. and Knight, K., “Artificial Intelligence, Second Edition,” 1991, McGraw-Hill Book Company [redacted].Applicant
- Richard et al., “Visiting the Traveling Salesman Problem with Petri nets and application in the glass industry,” Feb. 1996, IEEE Emerging Technologies and Factory Automation, pp. 238-242.Applicant
- Robin, Jacques, “Revision-Based Generation of Natural Language Summaries Providing Historical Background: Corpus-Based Analysis, Design Implementation and Evaluation,” 1994, Ph.D. Thesis, Columbia University, New York.Applicant
- Sang, E. and Buchholz, S., “Introduction to the CoNLL-2000 Shared Task: Chunking,” 20002, Proc. of CoNLL-2000 and LLL-2000, Lisbon, Portugal, pp. 127-132.Applicant
- Schmid, H., and Walde, S., “Robust German Noun Chunking With a Probabilistic Context-Free Grammar,” 2000, Proc. of the 18th Conference on Computational Linguistics, vol. 2, pp. 726-732.Applicant
- Selman et al., “A New Method for Solving Hard Satisfiability Problems,” 1992, Proc. of the 10th National Conference on Artificial Intelligence, San Jose, CA, pp. 440-446.Applicant
- Schutze, Hinrich, “Automatic Word Sense Discrimination,” 1998, Computational Linguistics, Special Issue on Word Sense Disambiguation, vol. 24, Issue 1, pp. 97-123.Applicant
- Sobashima et al., “A Bidirectional Transfer-Driven Machine Translation System for Spoken Dialogues,” 1994, Proc. of 15th Conference on Computational Linguistics, vol. 1, pp. 64-68.Applicant
- Shapiro, Stuart (ed.), “Encyclopedia of Artificial Intelligence, 2nd edition”, vol. 2, 1992, John Wiley & Sons Inc; “Unification” article, K. Knight, pp. 1630-1637.Applicant
- Soricut et al., “Using a large monolingual corpus to improve translation accuracy,” 2002, Lecture Notes In Computer Science, vol. 2499, Proc. of the 5th Conference of the Association for Machine Translation in the Americas on Machine Translation: From Research to Real Users, pp. 155-164.Applicant
- Stalls, B. and Knight, K., “Translating Names and Technical Terms in Arabic Text,” 1998, Proc. of the COLING/ACL Workkshop on Computational Approaches to Semitic Language.Applicant
- Sun et al., “Chinese Named Entity Identification Using Class-based Language Model,” 2002, Proc. of 19th International Conference on Computational Linguistics, Taipei, Taiwan, vol. 1, pp. 1-7.Applicant
- Sumita et al., “A Discourse Structure Analyzer for Japanese Text,” 1992, Proc. of the International Conference on Fifth Generation Computer Systems, vol. 2, pp. 1133-1140.Applicant
- Taylor et al., “The Penn Treebank: An Overview,” in A. Abeill (ed.), Treebanks: Building and Using Parsed Corpora, 2003, pp. 5-22.Applicant
- Tiedemann, Jorg, “Automatic Construction of Weighted String Similarity Measures,” 1999, In Proceedings of the Joint SIGDAT Conference on Emperical Methods in Natural Language Processing and Very Large Corpora.Applicant
- Tillmann et al., “A DP based Search Using Monotone Alignments in Statistical Translation,” 1997, Proc. of the Annual Meeting of the ACL, pp. 366-372.Applicant
- Tillman, C. and Xia, F., “A Phrase-Based Unigram Model for Statistical Machine Translation,” 2003, Proc. of the North American Chapter of the ACL on Human Language Technology, vol. 2, pp. 106-108.Applicant
- Veale, T. and Way, A., “Gaijin: A Bootstrapping, Template-Driven Approach to Example-Based MT,” 1997, Proc. of New Methods in Natural Language Processing (NEMPLP97), Sofia, Bulgaria.Applicant
- Vogel, S. and Ney, H., “Construction of a Hierarchical Translation Memory,” 2000, Proc. of Cooling 2000, Saarbrucken, Germany, pp. 1131-1135.Applicant
- Vogel et al., “The CMU Statistical Machine Translation System,” 2003, Machine Translation Summit IX, New Orleans, LA.Applicant
- Vogel et al., “The Statistical Translation Module in the Verbmobil System,” 2000, Workshop on Multi-Lingual Speech Communication, pp. 69-74.Applicant
- Wang, Ye-Yi, “Grammar Interference and Statistical Machine Translation,” 1998, Ph.D Thesis, Carnegie Mellon University, Pittsburgh, PA.Applicant
- Watanbe et al., “Statistical Machine Translation Based on Hierarchical Phrase Alignment,” 2002, 9th International Conference on Theoretical and Methodological Issues in Machin Translation (TMI-2002), Keihanna, Japan, pp. 188-198.Applicant
- Witbrock, M. and Mittal, V., “Ultra-Summarization: A Statistical Approach to Generating Highly Condensed Non-Extractive Summaries,” 1999, Proc. of SIGIR '99, 22nd International Conference on Research and Development in Information Retrieval, Berkeley, CA, pp. 315-316.Applicant
- Wang, Y. and Waibel, A., “Decoding Algorithm in Statistical Machine Translation,” 1996, Proc. of the 35th Annual Meeting of the ACL, pp. 366-372.Applicant
- Wu, Dekai, “Stochastic Inversion Transduction Grammars and Bilingual Parsing of Parallel Corpora,” 1997, Computational Linguistics, vol. 23, Issue 3, pp. 377-403.Applicant
- Wu, Dekai, “A Polynomial-Time Algorithm for Statistical Machine Translation,” 1996, Proc. of 34th Annual Meeting of the ACL, pp. 152-158.Applicant
- Yamada, K. and Knight, K., “A Decoder for Syntax-based Statistical MT,” 2001, Proceedings of the 40th Annual Meeting of the ACL, pp. 303-310.Applicant
- Yamada, K. and Knight, K. “A Syntax-based Statistical Translation Model,” 2001, Proc. of the 39th Annual Meeting of the ACL, pp. 523-530.Applicant
- Yamamoto et al., “A Comparative Study on Translation Units for Bilingual Lexicon Extraction,” 2001, Japan Academic Association for Copyright Clearance, Tokyo, Japan.Applicant
- Yarowsky, David, “Unsupervised Word Sense Disambiguation Rivaling Supervised Methods,” 1995, 33rd Annual Meeting of the ACL, pp. 189-196.Applicant
- Callan et al., “TREC and TIPSTER Experiments with INQUERY,” 1994, Information Processing and Management, vol. 31, Issue 3, pp. 327-343.Applicant
- Cohen, Yossi, “Interpreter for FUF,” (available at ftp://ftp.cs.bgu.ac.il/pub/people/elhadad/fuf-life.lf).Applicant
- Mohri, M. and Riley, M., “An Efficient Algorithm for the N-Best-Strings Problem,” 2002, Proc. of the 7th Int. Conf. on Spoken Language Processing (ICSLP'02), Denver, CO, pp. 1313-1316.Applicant
- Nederhof, M. and Satta, G., “IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing,” 2004, Journal of Artificial Intelligence Research, vol. 21, pp. 281-287.Applicant
- Och, F. and Ney, H., “Discriminative Training and Maximum Entropy Models for Statistical Machine Translation,” 2002, Proc. of the 40th Annual Meeting of the ACL, Philadelphia, PA, pp. 295-302.Applicant
- Resnik, P. and Smith, A., “The Web as a Parallel Corpus,” Sep. 2003, Computational Linguistics, Special Issue on Web as Corpus, vol. 29, Issue 3, pp. 349-380.Applicant
- Russell, S. and Norvig, P., “Artificial Intelligence: A Modern Approach,” 1995, Prentice-Hall, Inc., New Jersey [redacted—table of contents].Applicant
- Ueffing et al., “Generation of Word Graphs in Statistical Machine Translation,” 2002, Proc. of Empirical Methods in Natural Language Processing (EMNLP), pp. 156-163.Applicant
- Kumar, R. and Li, H., “Integer Programming Approach to Printed Circuit Board Assembly Time Optimization,” 1995, IEEE Transactions on Components, Packaging, and Manufacturing, Part B: Advance Packaging, vol. 18, No. 4, pp. 720-727.Applicant
- Ueffing et al., “Using Pos Information for Statistical Machine Translation into Morphologically Rich Languages,” In EACL, 2003: Proceedings of the Tenth Conference on European Chapter of the Association for Computational Linguistics, pp. 347-354.Applicant
- Frederking et al., “Three Heads are Better Than One,” In Proceedings of the 4th Conference on Applied Natural Language Processing, Stuttgart, Germany, 1994, pp. 95-100.Applicant
- Och et al., “Discriminative Training and Maximum Entropy Models for Statistical Machine Translation,” In Proc. of the 40th Annual Meeting of the Association for Computational Linguistics (ACL), Philadelphia, PA, 2002.Applicant
- Yasuda et al., “Automatic Machine Translation Selection Scheme to Output the Best Result,” Proc of LREC, 2002, pp. 525-528.Applicant
- Agbago, A., et al., “True-casing for the Portage System,” In Recent Advances in Natural Language Processing (Borovets, Bulgaria), Sep. 21-23, 2005, pp. 21-24.Applicant
- Alshawi, Hiyan, “Head Automata for Speech Translation”, Proceedings of the ICSLP 96, 1996, Philadelphia, Pennslyvania.Applicant
- Ambati, V., “Dependency Structure Trees in Syntax Based Machine Translation,” Spring 2008 Report <http://www.cs.cmu.edu/˜vamshi/publications/DependencyMT—report.pdf>, pp. 1-8.Applicant
- Arun, A., et al., “Edinburgh System Description for the 2006 TC-STAR Spoken Language Translation Evaluation,” in TC-STAR Workshop on Speech-to-Speech Translation (Barcelona, Spain), Jun. 2006, pp. 37-41.Applicant
- Ballesteros, L. et al., “Phrasal Translation and Query Expansion Techniques for Cross-Language Information Retrieval,” SIGIR 97, Philadelphia, PA, © 1997, pp. 84-91.Applicant
- “Bangalore, S. and Rambow, O., “Using TAGs, a Tree Model, and a Language Model for Generation,” May 2000,Workshop TAG+5, Paris”.Applicant
- Bannard, C. and Callison-Burch, C., “Paraphrasing with Bilingual Parallel Corpora,” In Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics (Ann Arbor, MI, Jun. 25-30, 2005). Annual Meeting of the ACL Assoc. for Computational Linguistics, Morristown, NJ, 597-604. DOI=http://dx.doi.org/10.3115/1219840.Applicant
- Berhe, G. et al., “Modeling Service-based Multimedia Content Adaptation in Pervasive Computing,” CF '04 (Ischia, Italy) Apr. 14-16, 2004, pp. 60-69.Applicant
- Boitet, C. et al., “Main Research Issues in Building Web Services for Mutualized, Non-Commercial Translation,” Proc. of the Symposium on Natural Language Processing, Human and Computer Processing of Language and Speech, © 2005, pp. 1-11.Applicant
- Brill, Eric, “Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part of Speech Tagging”, 1995, Assocation for Computational Linguistics, vol. 21, No. 4, pp. 1-37.Applicant
- Callison-Burch, C. et al., “Statistical Machine Translation with Word- and Sentence-aligned Parallel Corpora,” In Proceedings of the 42nd Meeting on Assoc. for Computational Linguistics (Barcelona, Spain, Jul. 21-26, 2004). Annual Meeting of the ACL. Assoc. for Computational Linguistics, Morristown, NJ, 1.Applicant
- Cheng, P. et al., “Creating Multilingual Translation Lexicons with Regional Variations Using Web Corpora,” In Proceedings of the 42nd Annual Meeting on Assoc. for Computational Linguistics (Barcelona, Spain, Jul. 21-26, 2004). Annual Meeting of the ACL. Assoc. for Computational Linguistics, Morristown, NJ, 53.Applicant
- Cheung et al., “Sentence Alignment in Parallel, Comparable, and Quasi-comparable Corpora”, In Proceedings of LREC, 2004, pp. 30-33.Applicant
- Cohen et al., “Spectral Bloom Filters,” SIGMOD 2003, Jun. 9-12, 2003, ACM pp. 241-252.Applicant
- Cohen, “Hardware-Assisted Algorithm for Full-text Large-Dictionary String Matching Using n-gram Hashing,” 1998, Information Processing and Management, vol. 34, No. 4, pp. 443-464.Applicant
- Covington, “An Algorithm to Align Words for Historical Comparison”, Computational Linguistics, 1996,vol. 22, No. 4, pp. 481-496.Applicant
- Eisner, Jason, “Learning Non-Isomorphic Tree Mappings for Machine Translation,” 2003, in Proc. of the 41st Meeting of the ACL, pp. 205-208.Applicant
- Fleming, Michael et al., “Mixed-Initiative Translation of Web Pages,” AMTA 2000, LNAI 1934, Springer-Verlag, Berlin, Germany, 2000, pp. 25-29.Applicant
- Och, Franz Josef and Ney, Hermann, “Improved Statistical Alignment Models” ACLOO:Proc. of the 38th Annual Meeting of the Association for Computational Lingustics, 'Online! Oct. 2-6, 2000, pp. 440-447, XP002279144 Hong Kong, China Retrieved from the Internet: <URL:http://www-i6.informatik.rwth-aachen.de/Colleagues/och/ACLOO.ps> 'retrieved on Jun. 5, 2004! abstract.Applicant
- Ren, Fuji and Shi, Hongchi, “Parallel Machine Translation: Principles and Practice,” Engineering of Complex Computer Systems, 2001 Proceedings, Seventh IEEE Int'l. Conference, pp. 249-259, 2001.Applicant
- Fung et al, “Mining Very-Non-Parallel Corpora: Parallel Sentence and Lexicon Extraction via Bootstrapping and EM”, In EMNLP 2004.Applicant
- Gale, W. and Church, K., “A Program for Aligning Sentences in Bilingual Corpora,” 1993, Computational Linguisitcs, vol. 19, No. 1, pp. 75-102.Applicant
- Galley et al., “Scalable Inference and Training of Context-Rich Syntactic Translation Models,” Jul. 2006, in Proc. of the 21st International Conference on Computational Linguistics, pp. 961-968.Applicant
- Galley et al., “What's in a translation rule?”, 2004, in Proc. of HLT/NAACL '04, pp. 1-8.Applicant
- Gaussier et al, “A Geometric View on Bilingual Lexicon Extraction from Comparable Corpora”, In Proceedings of ACL 2004, july.Applicant
- Gildea, D., “Loosely Tree-based Alignment for Machine Translation,” In Proceedings of the 41st Annual Meeting on Assoc. for Computational Lingusitics—vol. 1 (Sapporo, Japan, Jul. 7-12, 2003). Annual Meeting of the ACL Assoc. for Computational Linguistics, Morristown, NJ, 80-87. DOI=http://dx.doi.org/10.3115/1075096.1075107.Applicant
- Grossi et al, “Suffix Trees and Their Applications in String Algorithms”, In. Proceedings of the 1st South American Workshop on String Processing, Sep. 1993, pp. 57-76.Applicant
- Gupta et al., “Kelips: Building an Efficient and Stable P2P DHT thorough Increased Memory and Background Overhead,” 2003 IPTPS, LNCS 2735, pp. 160-169.Applicant
- Habash, Nizar, “The Use of a Structural N-gram Language Model in Generation-Heavy Hybrid Machine Translation,” University of Maryland, Univ. Institute for Advance Computer Studies, Sep. 8, 2004.Applicant
- Huang et al., “Relabeling Syntax Trees to Improve Syntax-Based Machine Translation Quality,” Jun. 4-9, 2006, in Proc. of the Human Language Techology Conference of the North Americna Chapter of the ACL, pp. 240-247.Applicant
- Imamura et al., “Feedback Cleaning of Machine Translation Rules Using Automatic Evaluation,” 2003 Computational Linguistics, pp. 447-454.Applicant
- Klein et al., “Accurate Unlexicalized Parsing,” Jul. 2003, in Proc. of the 41st Annual Meeting of the ACL, pp. 423-430.Applicant
- Koehn, Philipp, “Noun Phrase Translation,” A PhD Dissertation for the University of Southern California, pp. xiii, 23, 25-57, 72-81, Dec. 2003.Applicant
- “Lee, Yue-Shi,“Neural Network Approach to Adaptive Learning: with an Application to Chinese Homophone Disambiguation”IEEE pp. 1521-1526.”Applicant
- Lita, L., et al., “tRuEcasIng,” 2003, Proceedings of the 41st Annual Meeting of the Assoc. for Computational Linguistics (In Hinrichs, E. and Roth, D.-editors), pp. 152-159.Applicant
- Llitjos, A. F. et al., “The Translation Correction Tool: English-Spanish User Studies,” Citeseer © 2004, downloaded from: http://gs37.sp.cs.cmu.edu/ari/papers/lrec04/fontll, pp. 1-4.Applicant
- McCallum, A. and Li, W., “Early Results for Named Entity Recognition with Conditional Random Fields, Feature Induction and Web-enhanced Lexicons,” In Proceedings of the Seventh Conference on Natural Language Learning at HLT-NAACL, 2003, vol. 4 (Edmonton, Canada), Assoc. for Computational Linguistics, Morristown, NJ, pp. 188-191.Applicant
- McDevitt, K. et al., “Designing of a Community-based Translation Center,” Technical Report TR-03-30, Computer Science, Virginia Tech, © 2003, pp. 1-8.Applicant
- Metze, F. et al., “The NESPOLE! Speech-to-Speech Translation System,” Proc. of the HLT 2002, 2nd Int'l Conf. on Human Language Technology (San Francisco, CA), © 2002, pp. 378-383.Applicant
- Mohri, Mehryar, “Regular Approximation of Context Free Grammars Through Transformation”, 2000, pp. 251-261, “Robustness in Language and Speech Technology”, Chapter 9, Kluwer Academic Publishers.Applicant
- Nagao, K. et al., “Semantic Annotation and Transcoding: Making Web Content More Accessible,” IEEE Multimedia, vol. 8, Issue 2 Apr.-Jun. 2001, pp. 69-81.Applicant
- Norvig, Peter, “Techniques for Automatic Memoization with Applications to Context-Free Parsing”, Compuational Linguistics,1991, pp. 91-98, vol. 17, No. 1.Applicant
- Och et al. “A Smorgasbord of Features for Statistical Machine Translation.” HLTNAACL Conference. Mar. 2004, 8 pages.Applicant
- Och, F., “Minimum Error Rate Training in Statistical Machine Translation,” In Proceedings of the 41st Annual Meeting on Assoc. for Computational Linguistics—vol. 1 (Sapporo, Japan, Jul. 7-12, 2003). Annual Meeting of the ACL. Assoc. for Computational Linguistics, Morristown, NJ, 160-167. DOI=http://dx.doi.org/10.3115-1075096.Applicant
- Och, F. and Ney, H., “A Systematic Comparison of Various Statistical Alignment Models,” Computational Linguistics, 2003, 29:1, 19-51.Applicant
- Perugini, Saviero et al., “Enhancing Usability in CITIDEL: Multimodal, Multilingual and Interactive Visualization Interfaces,” JCDL '04, Tucson, AZ, Jun. 7-11, 2004, pp. 315-324.Applicant
- Petrov et al., “Learning Accurate, Compact and Interpretable Tree Annotation,” Jun. 4-9, 2006, in Proc. of the Human Language Technology Conference of the North American Chapter of the ACL, pp. 433-440.Applicant
- Qun, Liu, “A Chinese-English Machine Translation System Based on Micro-Engine Architecture,” An Int'l Conference on Translation and Information Technology, Hong Kong, Dec. 2000, pp. 1-10.Applicant
- Rayner et al.,“Hybrid Language Processing in the Spoken Language Translator,” IEEE 1997, pp. 107-110.Applicant
- Rogati et al., “Resource Selection for Domain-Specific Cross-Lingual IR,” ACM 2004, pp. 154-161.Applicant
- Zhang, R. et al., “The NiCT-ATR Statistical Machine Translation System for the IWSLT 2006 Evaluation,” submitted to IWSLT, 2006.Applicant
- Kumar, S. and Byrne, W., “Minimum Bayes-Risk Decoding for Statistical Machine Translation.” HLTNAACL Conference. Mar. 2004, 8 pages.Applicant
- Shirai, S., “A Hybrid Rule and Example-based Method for Machine Translation,” 1997, NTT Communication Science Laboratories, pp. 1-5.Applicant
- Tanaka, K. and Iwasaki, H. “Extraction of Lexical Translations from Non-Aligned Corpora,” Proceedings of COLING 1996.Applicant
- Taskar, B., et al., “A Discriminative Matching Approach to Word Alignment,” In Proceedings of the Conference on Human Language Technology and Empirical Methods in Natural Language Processing (Vancouver, BC, Canada, Oct. 6-8, 2005). Human Language Technology Conference. Assoc. for Computational Linguistics, Morristown, NJ.Applicant
- Tomas, J., “Binary Feature Classification for Word Disambiguation in Statistical Machine Translation,” Proceedings of the 2nd Int'l. Workshop on Pattern Recognition, 2002, pp. 1-12.Applicant
- Uchimoto, K. et al., “Word Translation by Combining Example-Based Methods and Machine Learning Models,” Natural LanguageProcessing (Shizen Gengo Shori), vol. 10, No. 3, Apr. 2003, pp. 87-114.Applicant
- Uchimoto, K. et al., “Word Translation by Combining Example-based Methods and Machine Learning Models,” Natural LanguageProcessing (Shizen Gengo Shori), vol. 10, No. 3, Apr. 2003, pp. 87-114. (English Translation).Applicant
- Varga et al., “Parallel Corpora for Medium Density Languages”, In Proceedings of RANLP 2005, pp. 590-596.Applicant
- Yamada K., “A Syntax-Based Statistical Translation Model,” 2002 PhD Dissertation, pp. 1-141.Applicant
- Yamamoto et al, “Acquisition of Phrase-level Bilingual Correspondence using Dependency Structure” In Proceedings of COLING-2000, pp. 933-939.Applicant
- Zhang et al., “Synchronous Binarization for Machine Translations,” Jun. 4-9, 2006, in Proc. of the Human Language Technology Conference of the North American Chapter of the ACL, pp. 256-263.Applicant
- Zhang et al., “Distributed Language Modeling for N-best List Re-ranking,” In Proceedings of the 2006 Conference on Emperical Methods in Natural Language Processing (Sydney, Australia, Jul. 22-23, 2006). ACL Workshops. Assoc. for Computational Linguistics, Morristown, NJ, 216-223.Applicant
- “Patent Cooperation Treaty International Preliminary Report on Patentability and The Written Opinion, Internationalapplication No. PCT/US2008/004296, Oct. 6, 2009, 5 pgs.”Applicant
- Document, Wikipedia.com, web.archive.org (Feb. 24, 2004) <http://web.archive.org/web/20040222202831 /http://en.wikipedia.org/wikiiDocument>, Feb. 24, 2004.Applicant
- Identifying, Dictionary.com, wayback.archive.org (Feb. 28, 2007) <http://wayback.archive.org/web/200501 01 OOOOOO*/http:////dictionary.reference.com//browse/identifying>, Feb. 28, 2005 <http://web.archive.org/web/20070228150533/http://dictionary.reference.com/browse/identifying>.Applicant
- Koehn, P. et al, “Statistical Phrase-Based Translation,” Proceedings of HLT-NAACL 2003 Main Papers , pp. 48-54. Edmonton, May-Jun. 2003.Applicant
- Abney, S.P., “Stochastic Attribute Value Grammars”, Association for Computional Linguistics, 1997, pp. 597-618.Applicant
- Fox, H., “Phrasal Cohesion and Statistical Machine Translation” Proceedings of the Conference on Empirical Methods in Natural Language Processing, Philadelphia, Jul. 2002, pp. 304-311. Association for Computational Linguistics. <URL:http://acl.Idc.upenn.edu/W/W02/W02-1039.pdf>.Applicant
- Tillman, C., et al, “Word Reordering and a Dynamic Programming Beam Search Algorithm for Statistical Machine Translation,” 2003, Association for Computational Linguistics, vol. 29, No. 1, pp. 97-133 <URL: http://acl.Idc.upenn.edu/J/J03-1005.pdf>.Applicant
- Wang, W., et al. “Capitalizing Machine Translation” In HLT-NAACL '06 Proceedings Jun. 2006. <http://www.isi.edu/natural-language/mt/hlt-naacl-06-wang.pdf>.Applicant
- Langlais, P. et al., “TransType: a Computer-Aided Translation Typing System” EmbedMT '00 ANLP-NAACL 2000 Workshop: Embedded Machine Translation Systems, 2000, pp. 46-51. <http://acl.Idc.upenn.edu/W/W00/W00-0507.pdf>.Applicant
- Huang et al., “A syntax-directed translator with extended domain of locality,” Jun. 9, 2006, In Proceedings of the Workshop on Computationally Hard Problmens and Joint Inference in Speech and Language Processing, pp. 1-8, New York City, New York, Association for Computational Linguistics.Applicant
- Melamed et al., “Statistical machine translation by generalized parsing,” 2005, Technical Report 05-001, Proteus Project, New York University, http://nlp.cs.nyu.edu/pubs/.Applicant
- Galley et al., “Scalable Inference and Training of Context-Rich Syntactic Translation Models,” Jul. 2006, In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the ACL, pp. 961-968.Applicant
- Huang et al., “Statistical syntax-directed translation with extended domain of locality,” Jun. 9, 2006, In Proceedings of AMTA, pp. 1-8.Applicant