Swarm intelligence for natural language processing Online publication date: Wed, 15-Jul-2015
by Wojdan Al-Saeedan; Mohamed El Bachir Menai
International Journal of Artificial Intelligence and Soft Computing (IJAISC), Vol. 5, No. 2, 2015
Abstract: Natural language processing (NLP) is an area dealing with computational methods for achieving human-like language processing. Traditionally, NLP research has been focused on developing efficient and robust algorithms to treat most NLP tasks, including syntactic and semantic analysis, grammar induction, summary and text generation, document clustering and machine translation. Swarm intelligence (SI) methods are effective to do so, since they have been successfully applied for many real-world problems. Recently, NLP and SI have been active areas of research, joined together more than once to solve problems in NLP field. This paper presents a review of recent developments of SI methods in NLP. It shows that only a few NLP tasks and applications were tackled by using SI-based algorithms. These mainly include text document clustering and classification, text summarisation, word sense disambiguation, information retrieval, and speaker recognition. This study also shows that four SI-based algorithms were examined in NLP field, including ant colony optimisation (ACO), particle swarm optimisation (PSO), bee swarm optimisation (BSO), and firefly algorithm (FA), emphasising ACO and PSO as the most investigated algorithms in this field.
Online publication date: Wed, 15-Jul-2015
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Artificial Intelligence and Soft Computing (IJAISC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com