[Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/docs/papers/authors/jonathan-graehl/)

[home](https://md.mova.elamur.ai/free/en/) / [docs](https://md.mova.elamur.ai/free/en/docs/) / [papers](https://md.mova.elamur.ai/free/en/docs/papers/) / [authors](https://md.mova.elamur.ai/free/en/docs/papers/authors/) / Jonathan Graehl

# Jonathan Graehl

2 paper cards in Mova's library · 2004–2006

Jonathan Graehl wrote 2 of the papers Mova reads, in 2004–2006, most of them on [Machine translation](https://md.mova.elamur.ai/free/en/docs/papers/topics/machine-translation/); often with [Kevin Knight](https://md.mova.elamur.ai/free/en/docs/papers/authors/kevin-knight/), [Daniel Marcu](https://md.mova.elamur.ai/free/en/docs/papers/authors/daniel-marcu/), Ignacio Thayer.

[OpenAlex](https://openalex.org/A5050270674) · [**h-index 7**](https://openalex.org/authors/A5050270674) · [1511 citations](https://openalex.org/authors/A5050270674) · [12 works](https://openalex.org/works?filter=author.id:A5050270674) — openalex, 2026-10-18

The profile is the library's match of the name; two people with one name are not always told apart.

Elsewhere: [Google Scholar](https://scholar.google.com/citations?view_op=search_authors&mauthors=Jonathan+Graehl) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Jonathan+Graehl) · [dblp](https://dblp.org/search?q=Jonathan+Graehl) · [ACL Anthology](https://aclanthology.org/search/?q=Jonathan+Graehl) · [ORCID](https://orcid.org/orcid-search/search?searchQuery=Jonathan+Graehl)

Topics: [Machine translation](https://md.mova.elamur.ai/free/en/docs/papers/topics/machine-translation/) 2

## Papers

1. **[Scalable Inference and Training of Context-Rich Syntactic Translation Models](https://md.mova.elamur.ai/free/en/docs/papers/galley-2006-scalable-inference-training-context-rich/)** *(2006)* The paper extends the rule extraction of Galley et al. (2004). Instead of keeping one minimal derivation per sentence pair, it builds a forest of many derivations, so that larger rules with more syntactic context and alternative readings of unaligned words are all available. It puts probabilities on these multi-level…
2. **[Training Tree Transducers](https://md.mova.elamur.ai/free/en/docs/papers/graehl-2004-training-tree-transducers/)** *(2004)* The paper argues that probabilistic models of language should be written as tree transducers, since the theory of tree automata is well developed and gives tools that string models have.

## Co-authors (6)

- [Kevin Knight](https://md.mova.elamur.ai/free/en/docs/papers/authors/kevin-knight/) ×2
- [Daniel Marcu](https://md.mova.elamur.ai/free/en/docs/papers/authors/daniel-marcu/)
- Ignacio Thayer
- [Michel Galley](https://md.mova.elamur.ai/free/en/docs/papers/authors/michel-galley/)
- Steve DeNeefe
- Wei Wang
- [← previous Jonathan Ginzburg](https://md.mova.elamur.ai/free/en/docs/papers/authors/jonathan-ginzburg/)
- [next → Jonathan K. Kummerfeld](https://md.mova.elamur.ai/free/en/docs/papers/authors/jonathan-k-kummerfeld/)
- [↑ back to Authors](https://md.mova.elamur.ai/free/en/docs/papers/authors/)