The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Machine translation using probabilistic synchronous dependency insertion grammars
Open accessAbstract
Syntax-based statistical machine translation (MT) aims at applying statistical models to structured data. In this paper, we present a syntax-based statistical machine translation system based on a probabilistic synchronous dependency insertion grammar. Synchronous dependency insertion grammars are a version of synchronous grammars defined on dependency trees. We first introduce our approach to inducing such a grammar from parallel corpora. Second, we describe the graphical model for the machine translation task, which can also be viewed as a stochastic tree-to-tree transducer. We introduce a polynomial time decoding algorithm for the model. We evaluate the outputs of our MT system using the NIST and Bleu automatic MT evaluation software. The result shows that our system outperforms the baseline system based on the IBM models in both translation speed and quality.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
BLEU: a method for automatic evaluation of machine translation
Papineni, K., Roukos, S., Ward, T., & Zhu, W.-J. (2001) · Proceedings of the 40th Annual Meeting on Association for Computational Linguistics - ACL '02 · doi:10.3115/1073083.1073135 · Cited by 21,344
Cited by
Hierarchical Phrase-Based Translation
Chiang, D. (2007) · Computational Linguistics · doi:10.1162/coli.2007.33.2.201 · Cited by 1,144
Non-projective dependency parsing using spanning tree algorithms
McDonald, R., Pereira, F., Ribarov, K., & Hajič, J. (2005) · Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing - HLT '05 · doi:10.3115/1220575.1220641 · Cited by 847
Online large-margin training of dependency parsers
McDonald, R., Crammer, K., & Pereira, F. (2005) · Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05 · doi:10.3115/1219840.1219852 · Cited by 791
Tree-to-string alignment template for statistical machine translation
Liu, Y., Liu, Q., & Lin, S. (2006) · Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the ACL - ACL '06 · doi:10.3115/1220175.1220252 · Cited by 318
Multilingual dependency analysis with a two-stage discriminative parser
McDonald, R., Lerman, K., & Pereira, F. (2006) · Proceedings of the Tenth Conference on Computational Natural Language Learning - CoNLL-X '06 · doi:10.3115/1596276.1596317 · Cited by 223
Metadata
- Authors
- Ding, Y., & Palmer, M.
- Venue
- Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05
- Published
- 2005
- Pages
- 541-548
- OpenAlex
- W2116957398
- Cited by
- 197
- References
- 1
- FWCI
- 13.36
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Machine translation using probabilistic synchronous dependency insertion grammars. https://app.cochat.ai/papers/10.3115/1219840.1219907
- The paper
- Ding, Y., & Palmer, M. (2005). Machine translation using probabilistic synchronous dependency insertion grammars. Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05. https://doi.org/10.3115/1219840.1219907
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.