Reanalyzing the Most Probable Sentence Problem: A Case Study in Explicating the Role of Entropy in Algorithmic Complexity

Eric Corlett, Gerald Penn. Reanalyzing the Most Probable Sentence Problem: A Case Study in Explicating the Role of Entropy in Algorithmic Complexity. In Paola Merlo, Jörg Tiedemann, Reut Tsarfaty, editors, Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume, EACL 2021, Online, April 19 - 23, 2021. pages 3354-3362, Association for Computational Linguistics, 2021. [doi]

@inproceedings{CorlettP21,
  title = {Reanalyzing the Most Probable Sentence Problem: A Case Study in Explicating the Role of Entropy in Algorithmic Complexity},
  author = {Eric Corlett and Gerald Penn},
  year = {2021},
  url = {https://www.aclweb.org/anthology/2021.eacl-main.294/},
  researchr = {https://researchr.org/publication/CorlettP21},
  cites = {0},
  citedby = {0},
  pages = {3354-3362},
  booktitle = {Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume, EACL 2021, Online, April 19 - 23, 2021},
  editor = {Paola Merlo and Jörg Tiedemann and Reut Tsarfaty},
  publisher = {Association for Computational Linguistics},
  isbn = {978-1-954085-02-2},
}