Correspondence-guided Synchronous Parsing of Parallel Corpora
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 1694-1694.
Abstract
We present an efficient dynamic programming algorithm for synchronous parsing of sentence pairs from a parallel corpus with a given word alignment. Unless there is a large proportion of words without a correspondence in the other language, the worstcase complexity is significantly reduced over standard synchronous parsing. The theoretical complexity results are corroborated by a quantitative experimental evaluation.
Jonas Kuhn. 2005. Correspondence-guided Synchronous Parsing of Parallel Corpora. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05. IJCAI, 1694–1694. https://ijcai.org/proceedings/2005/252
Kuhn, J. (2005). Correspondence-guided Synchronous Parsing of Parallel Corpora. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 (pp. 1694–1694). IJCAI. https://ijcai.org/proceedings/2005/252
@inproceedings{ijcai2005p252,
title = {Correspondence-guided Synchronous Parsing of Parallel Corpora},
author = {Kuhn, Jonas},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {1694--1694},
year = {2005},
url = {https://ijcai.org/proceedings/2005/252},
}
TY - CPAPER TI - Correspondence-guided Synchronous Parsing of Parallel Corpora AU - Kuhn, Jonas T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 1694 EP - 1694 UR - https://ijcai.org/proceedings/2005/252 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
