@techreport{oai:ipsj.ixsq.nii.ac.jp:00231455,
 author = {楉, 春華 and 吉田, 哲也 and Haruka, Sumoto and Tetsuya, Yoshida},
 issue = {1},
 month = {Dec},
 note = {文字解読とは，未知の言語における単語と既知の言語における単語の対応を推定する問題である．文字列の編集距離に基づく目的関数の交互最適化を行う既存研究は，汎用性は高いものの最適化における初期値依存性が非常に強いという課題があった．本稿では文字の置換履歴に対する組合せ最適化を通じた文字解読を提案する．, Decipherment is a problem of inferring the correspondence of words between a known language and unknown language. Previous work based on edit distance formalized the problems of decipherment and cognate pair identification in terms of alternating optimization. This paper proposes a decipherment method based on combinatorial optimization and character substitution log.},
 title = {文字の置換履歴に対する組合せ最適化を通じた文字解読},
 year = {2023}
}