IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i16p2613-d1724908.html
   My bibliography  Save this article

Arabic Abstractive Text Summarization Using an Ant Colony System

Author

Listed:
  • Amal M. Al-Numai

    (Department of Computer Science, College of Computer and Information Sciences, King Saud University, Riyadh 11543, Saudi Arabia)

  • Aqil M. Azmi

    (Department of Computer Science, College of Computer and Information Sciences, King Saud University, Riyadh 11543, Saudi Arabia)

Abstract

Arabic abstractive summarization presents a complex multi-objective optimization challenge, balancing readability, informativeness, and conciseness. While extractive approaches dominate NLP, abstractive methods—particularly for Arabic—remain underexplored due to linguistic complexity. This study introduces, for the first time, ant colony system (ACS) for Arabic abstractive summarization (named AASAC—Arabic Abstractive Summarization using Ant Colony), framing it as a combinatorial evolutionary optimization task. Our method integrates collocation and word-relation features into heuristic-guided fitness functions, simultaneously optimizing content coverage and linguistic coherence. Evaluations on a benchmark dataset using LemmaRouge , a lemma-based metric that evaluates semantic similarity rather than surface word forms, demonstrate consistent superiority. For 30% summaries, AASAC achieves 51.61% ( LemmaRouge -1) and 46.82% ( LemmaRouge -L), outperforming baselines by 13.23% and 20.49%, respectively. At 50% summary length, it reaches 64.56% ( LemmaRouge -1) and 61.26% ( LemmaRouge -L), surpassing baselines by 10.73% and 3.23%. These results highlight AASAC’s effectiveness in addressing multi-objective NLP challenges and establish its potential for evolutionary computation applications in language generation, particularly for complex morphological languages like Arabic.

Suggested Citation

  • Amal M. Al-Numai & Aqil M. Azmi, 2025. "Arabic Abstractive Text Summarization Using an Ant Colony System," Mathematics, MDPI, vol. 13(16), pages 1-24, August.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:16:p:2613-:d:1724908
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/16/2613/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/16/2613/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:16:p:2613-:d:1724908. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.