Neural Decipherment via Minimum-Cost Flow: from Ugaritic to Linear B

被引:0
|
作者
Luo, Jiaming [1 ]
Cao, Yuan [2 ]
Barzilay, Regina [1 ]
机构
[1] MIT, CSAIL, 77 Massachusetts Ave, Cambridge, MA 02139 USA
[2] Google Brain, Mountain View, CA USA
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we propose a novel neural approach for automatic decipherment of lost languages. To compensate for the lack of strong supervision signal, our model design is informed by patterns in language change documented in historical linguistics. The model utilizes an expressive sequence-to-sequence model to capture character-level correspondences between cognates. To effectively train the model in an unsupervised manner, we innovate the training procedure by formalizing it as a minimum-cost flow problem. When applied to the decipherment of Ugaritic, we achieve a 5.5% absolute improvement over state-of-the-art results. We also report the first automatic results in deciphering Linear B, a syllabic language related to ancient Greek, where our model correctly translates 67.3% of cognates.(1)
引用
收藏
页码:3146 / 3155
页数:10
相关论文
共 50 条
  • [1] Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
    Chen, Li
    Kyng, Rasmus
    Liu, Yang P.
    Peng, Richard
    Gutenberg, Maximilian Probst
    Sachdeva, Sushant
    2022 IEEE 63RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2022, : 612 - 623
  • [2] Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow
    Chen, Li
    Kyng, Rasmus
    Liu, Yang P.
    Peng, Richard
    Gutenberg, Maximilian Probst
    Sachdeva, Sushant
    COMMUNICATIONS OF THE ACM, 2023, 66 (12) : 85 - 92
  • [3] A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow
    van den Brand, Jan
    Chen, Li
    Peng, Richard
    Kyng, Rasmus
    Liu, Yang P.
    Gutenberg, Maximilian Probst
    Sachdeva, Sushant
    Sidford, Aaron
    2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS, 2023, : 503 - 514
  • [4] Coupled Minimum-Cost Flow Cell Tracking
    Padfield, Dirk
    Rittscher, Jens
    Roysam, Badrinath
    INFORMATION PROCESSING IN MEDICAL IMAGING, PROCEEDINGS, 2009, 5636 : 374 - +
  • [5] Minimum-cost flow algorithms: an experimental evaluation
    Kovacs, Peter
    OPTIMIZATION METHODS & SOFTWARE, 2015, 30 (01): : 94 - 127
  • [6] Generalized Preconditioning and Undirected Minimum-Cost Flow
    Sherman, Jonah
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 772 - 780
  • [7] EFFICIENT ALGORITHMS FOR MINIMUM-COST FLOW PROBLEMS WITH PIECEWISE-LINEAR CONVEX COSTS
    PINTO, Y
    SHAMIR, R
    ALGORITHMICA, 1994, 11 (03) : 256 - 277
  • [8] THE MINIMUM-COST DAIRY FEED (An Application of "Linear Programming")
    Waugh, Frederick V.
    JOURNAL OF FARM ECONOMICS, 1951, 33 (03): : 299 - 310
  • [9] Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
    Pinto, Yaron
    Shamir, Ron
    Algorithmica (New York), 1994, 11 (03): : 256 - 277
  • [10] An efficient implementation of a scaling minimum-cost flow algorithm
    Goldberg, AV
    JOURNAL OF ALGORITHMS, 1997, 22 (01) : 1 - 29