@article{Way:2003,
  abstract = {We have developed an example-based machine translation (EBMT) system that uses the World Wide Web for two different purposes: First, we populate the system's memory with translations gathered from rule-based MT systems located on the Web. The source strings input to these systems were extracted automatically from an extremely small subset of the rule types in the Penn-II Treebank. In subsequent stages, the <source,target> translation pairs obtained are automatically transformed into a series of resources that render the translation more successful...},
  added-at = {2007-12-14T02:48:00.000+0100},
  author = {Way, Andy and Gough, Nano},
  biburl = {http://www.bibsonomy.org/bibtex/2b1a68eb0d57f9a5d31c547fe085e078b/diego_ma},
  interhash = {20e0e3a15f341b7d5b1254ab058c5327},
  intrahash = {b1a68eb0d57f9a5d31c547fe085e078b},
  journal = {Computational Linguistics},
  keywords = {machine_translation web},
  number = 3,
  pages = {421-457},
  timestamp = {2007-12-14T02:48:00.000+0100},
  title = {\emph{wEBMT}: Developing and Validating an Example-Based Machine Translation System Using the World Wide Web},
  volume = 29,
  year = 2003
}

@article{Resnik:2003,
  added-at = {2007-12-14T02:45:40.000+0100},
  author = {Resnik, Philip and Smith, Noah A.},
  biburl = {http://www.bibsonomy.org/bibtex/2ed9551b7e709321bca9ef721bbb1f7f8/diego_ma},
  interhash = {b23f5b4586fb7dd07c28c376b08c0eda},
  intrahash = {ed9551b7e709321bca9ef721bbb1f7f8},
  journal = {Computational Linguistics},
  keywords = {web machine_translation},
  number = 3,
  pages = {349-380},
  timestamp = {2007-12-14T02:45:40.000+0100},
  title = {The Web as a Parallel Corpus},
  volume = 29,
  year = 2003
}

@incollection{Resnik:1998,
  added-at = {2007-12-14T02:45:36.000+0100},
  author = {Resnik, Philip},
  biburl = {http://www.bibsonomy.org/bibtex/253fe26d5bfe934aa23d824fcd9c6a6f8/diego_ma},
  booktitle = {Machine Translation and the Information Soup},
  editor = {Farwell, D. and Gerber, L. and Hovy, E.},
  interhash = {6cf36ae12c2daf331d4ce14f318e8af2},
  intrahash = {53fe26d5bfe934aa23d824fcd9c6a6f8},
  keywords = {machine_translation resources},
  publisher = {Springer},
  timestamp = {2007-12-14T02:45:36.000+0100},
  title = {Parallel Strands: A Preliminary Investigation into Mining the Web for Bilingual Text},
  url = {http://www.umiacs.umd.edu/\~{}resnik/pubs.html},
  year = 1998
}

@misc{Levin:xxxx,
  added-at = {2007-12-14T02:42:19.000+0100},
  author = {Levin, Lori and Glickman, Oren and Qu, Yan and Gates, Donna and Lavie, Alon and Ros{\'e}, Carolyn P. and Ess-Dykema, Carol Van and Waibel, Alex},
  biburl = {http://www.bibsonomy.org/bibtex/244b8af076512cb5d9174b712fd67b6b6/diego_ma},
  howpublished = {Lori Levi's homepage?},
  interhash = {47ba5b74c26930ba212ce1a3927b9575},
  intrahash = {44b8af076512cb5d9174b712fd67b6b6},
  keywords = {ambiguity context machine_translation},
  timestamp = {2007-12-14T02:42:19.000+0100},
  title = {Using Context in Machine Translation of Spoken Language},
  year = {XXXX}
}

@misc{Lavie:yyyy,
  added-at = {2007-12-14T02:42:08.000+0100},
  author = {Lavie, Alon and Waibel, Alex and Gates, Donna and Gavald{\`a}, Marsal and Zeppenfeld, Torsten and Zhan, Puming and Glickman, Oren},
  biburl = {http://www.bibsonomy.org/bibtex/20a9cc5b0be3345b85459536767b397b7/diego_ma},
  howpublished = {Alon Lavie's homepage?},
  interhash = {d63c377d20e9a9b168e19adedbc29d01},
  intrahash = {0a9cc5b0be3345b85459536767b397b7},
  keywords = {machine_translation},
  timestamp = {2007-12-14T02:42:08.000+0100},
  title = {Translation of Conversational Speech with {JANUS-II}},
  year = {YYYY}
}

@misc{Lavie:zzzz,
  added-at = {2007-12-14T02:42:07.000+0100},
  author = {Lavie, Alon and Levin, Lori and Qu, Yan and Waibel, Alex and Gates, Donna and Gavald{\`a}, Marsal and Mayfield, Laura and Taboada, Maite},
  biburl = {http://www.bibsonomy.org/bibtex/221a34803eda13a3d86034e82b826e379/diego_ma},
  howpublished = {Alon Lavie's homepage?},
  interhash = {e50316667e9e2acd136a947405a0ffab},
  intrahash = {21a34803eda13a3d86034e82b826e379},
  keywords = {machine_translation},
  timestamp = {2007-12-14T02:42:07.000+0100},
  title = {Dialogue Processing in a Conversational Speech Translation System},
  year = {ZZZZ}
}

@misc{Kay:2000,
  abstract = {The introduction of chart parsing in the early 1960's made it practicable for the first time (1) to separate the grammar from the algorithm that would apply it, (2) to find all the structures assigned to a long sentence by a context-free grammar and, hence, (3) to separate the process of finding analyses from that of choosing those most likely to be correct in context. The idea can be generalized to larger language-processing problems and, in particular, to translation. The result is very liberating because it makes it possible to avoid in large measure the premature elimination of paths from the search space.},
  added-at = {2007-12-14T02:41:27.000+0100},
  author = {Kay, Martin},
  biburl = {http://www.bibsonomy.org/bibtex/24ed5599571f03cd0357f7827cef0624e/diego_ma},
  interhash = {f5a7e476a51430126e9e2e78dd752c9b},
  intrahash = {4ed5599571f03cd0357f7827cef0624e},
  keywords = {machine_translation},
  month = May,
  note = {Presentation at IFI},
  timestamp = {2007-12-14T02:41:27.000+0100},
  title = {Chart Translation},
  year = 2000
}

@inproceedings{Copestake:1995,
  abstract = {We describe minimal recursion semantics (MRS), a framework for semantics within HPSG, which considerably simplifies transfer and generation. We discuss why, in general, a semantic representation with minimal structure is desirable for transfer and illustrate how a descriptively adequate representation with a non-recursive structure may be achieved. The paper illustrates the application of MRS to transfer with a series of examples and compares the approach to others which have been previously adopted within unification based frameworks. Our account involves the use of both language-specific and interlingual predicates or relations and we illustrate how this may be exploited to allow MRS to...},
  added-at = {2007-12-14T02:37:38.000+0100},
  address = {Leuven, Belgium},
  author = {Copestake, Ann and Flickinger, Dan and Malouf, Rob and Riehemann, Susanne and Sag, Ivan},
  biburl = {http://www.bibsonomy.org/bibtex/2d7de9309356d7b76687409c8efa09d85/diego_ma},
  booktitle = {Proc. TMI95},
  interhash = {20ea54d9d889d56002815b22b0812d59},
  intrahash = {d7de9309356d7b76687409c8efa09d85},
  keywords = {MRS machine_translation},
  timestamp = {2007-12-14T02:37:38.000+0100},
  title = {Translation Using Minimal Recursion Semantics},
  url = {http://citeseer.nj.nec.com/45951.html},
  year = 1995
}

@article{Berger:1996,
  abstract = {The concept of maximum entropy can be traced along multiple threads to Biblical times. Only recently, however, have computers become powerful enough to permit the widescale application of this concept to real world problems in statistical estimation and pattern recognition. In this paper, we describe a method for statistical modeling based on maximum entropy. We present a maximum-likelihood approach for automatically constructing maximum entropy models and describe how to implement this approach efficiently, using as examples several problems in natural language processing.},
  added-at = {2007-12-14T02:35:56.000+0100},
  author = {Berger, Adam L. and Pietra, Stephen Della and Pietra, Vincent J. Della},
  biburl = {http://www.bibsonomy.org/bibtex/272155af0cbabd478137fbd06d3bbc4af/diego_ma},
  interhash = {e7f7835dc81d2f7c28d3371df9cdaebe},
  intrahash = {72155af0cbabd478137fbd06d3bbc4af},
  journal = {Computational Linguistics},
  keywords = {maxent machine_translation},
  number = 1,
  pages = {39-71},
  timestamp = {2007-12-14T02:35:56.000+0100},
  title = {A Maximum Entropy Approach to Natural Language Processing},
  volume = 22,
  year = 1996
}

@inproceedings{Alshawi:1996c,
  abstract = {We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for incremental application of lexical associations in a dynamic programming search for optimal dependency tree derivations. We also present a model and algorithm for machine translation involving optimal ``tiling'' of a dependency tree with entries of a costed bilingual lexicon. Experimental results are reported comparing methods for assigning cost functions to these models. We conclude with a discussion of the adequacy of annotated linguistic strings as representations for machine translation.},
  added-at = {2007-12-14T02:35:21.000+0100},
  address = {Santa Cruz, CA},
  author = {Alshawi, Hiyan},
  biburl = {http://www.bibsonomy.org/bibtex/21e71918395c87da133356a259b595cd7/diego_ma},
  booktitle = {Proc. ACL-94},
  interhash = {bdfc88b823404a426d7222d8b8520866},
  intrahash = {1e71918395c87da133356a259b595cd7},
  keywords = {machine_translation DG automata},
  note = {Available at arXiv:cmp-lg/9607005},
  pages = {167-176},
  timestamp = {2007-12-14T02:35:21.000+0100},
  title = {Head Automata and Bilingual Tiling: Translation with Minimal Representations},
  url = {http://xxx.lanl.gov/abs/cmp-lg/9607005},
  year = 1996
}