This paper demonstrates how we can re-purpose sophisticated algorithms from a range of fields to help us compute expected permutations and marginal likelihoods. The results are of particular use in the fields of record linkage or identity resolution, where we are interested in finding pairs of records across data sets that refer to the same individual. All calculations discussed can be reproduced with the accompanying R package expperm.

中文翻译：

---

计算排列的期望和边际可能性

本文演示了如何重新利用一系列领域中的复杂算法，以帮助我们计算预期的排列和边际可能性。结果在记录链接或身份解析领域特别有用，在这些领域中，我们感兴趣的是跨引用同一个人的数据集查找记录对。所讨论的所有计算都可以通过随附的R package expperm复制。