Villanueva, Arturo N., Jr., authorSimske, Steven J., authorACM, publisher2024-11-112024-11-112023-08-22Arturo N. Villanueva, Jr, and Steven J. Simske. 2023. Algorithm Parallelism for Improved Extractive Summarization. In ACM Symposium on Document Engineering 2023 (DocEng '23), August 22–25, 2023. Limerick, Ireland, 4 pages. https://doi.org/10.1145/3573128.3609350https://hdl.handle.net/10217/239512While much work on abstractive summarization has been conducted in recent years, including state-of-the-art summarizations from GPT-4, extractive summarization's lossless nature continues to provide advantages, preserving the style and often key phrases of the original text as meant by the author. Libraries for extractive summarization abound, with a wide range of efficacy. Some do not perform much better or perform even worse than random sampling of sentences extracted from the original text. This study breathes new life to using classical algorithms by proposing parallelism through an implementation of a second order meta-algorithm in the form of the Tessellation and Recombination with Expert Decisioner (T&R) pattern, taking advantage of the abundance of already-existing algorithms and dissociating their individual performance from the implementer's biases. Resulting summaries obtained using T&R are better than any of the component algorithms.born digitalarticleseng© Arturo N. Villanueva, Jr., et al. | ACM 2023. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in DocEng '23, https://dx.doi.org/10.1145/3573128.3609350.natural language processingextractive summarizationmeta-algorithmicsmachine learningdocument summarizationtessellation and recombinationTexthttps://doi.org/10.1145/3573128.3609350