<テクニカルレポート>
Identification of Tree Translation Rules from Examples

作成者
本文言語
出版者
発行日
雑誌名
出版タイプ
アクセス権
概要 Two models for simple translation between ordered trees are introduced. First is that output is obtained from input by renaming labels and deleting nodes. Several decision problems on the translation ...are proved to be tractable and intractable. Second is term rewriting system, called k-variable linear translation. The efficient learnability of this system using membership and equivalence queries is shown.続きを見る

本文情報を非表示

trcs173 pdf 304 KB 28  
trcs173.ps gz 139 KB 112  

詳細

レコードID
査読有無
関連情報
タイプ
登録日 2009.04.22
更新日 2017.01.20