arrow
返回

Training tree transducers

delete2008-09-01
delete35
delete
OA
AI
J
Jonathan Graehl *
K
Kevin Knight
J
Jonathan May
DOI:10.1162/coli.2008.07-051-R2-03-57delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Many probabilistic models for natural language are now written in terms of hierarchical tree structure. Tree-based modeling still lacks many of the standard tools taken for granted in (finite-state) string-based modeling. The theory of tree transducer automata provides a possible framework to draw on, as it has been worked out in an extensive literature. We motivate the use of tree transducers for natural language and address the training problem for probabilistic tree-to-tree and tree-to-string transducers.
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Computational Linguistics 封面图
Computational Linguistics
IF:
5.3
论文数:
837
被引数:
2.7K

机构

U
university of southern california
学者数:
4.7W
论文数: 3.8W
被引数: 51
引用论文

引用论文

err分享
err收藏
err分享
err收藏
学者 查看更多内容