Skip to main content
SpringerLink
Log in

Applying particle swarm optimisation to the morphological segmentation of words from Ancient Greek texts

  • Industrial and Commercial Application
  • Published:
Pattern Analysis and Applications Aims and scope Submit manuscript

Abstract

The present article investigates the effectiveness of evolutionary computation algorithms in a specific optimisation task, namely morphological segmentation of words into subword segments, focusing on the definition of stems and endings. More precisely, particle swarm optimisation (PSO) is compared to an earlier study on the same task using ant colony optimisation (ACO), using a number of different optimisation criteria, for each of which independent experiments are run. In the present article, the system architecture has been revised over earlier implementations, to allow substantially faster simulation times (by several orders of magnitude), which in turn allows the realisation of more iterations. The effect of local search to the PSO final segmentation quality is investigated in detail, with different local search processes being compared in terms of their effectiveness. In addition, issues involving the convergence of PSO are examined, encompassing variants which adopt global versus local training schemes. Experimental results show that, for different datasets, as a rule both PSO and ACO achieve higher segmentation accuracies than manual tuning. A comparison between ACO and PSO is made, over the different criteria used. When focusing on the highest performing criteria, ACO and PSO are comparable, while the system revisions allow the process to be completed much faster. In terms of the highest segmentation accuracy obtained for a specific system configuration, PSO is more effective, by achieving the highest segmentation accuracy amongst all optimisation methods tested.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Tambouratzis G, Carayannis G (1999) Automated construction of morphological lexica possessing terminology wealth on the basis of term-intensive documents. In: Proceedings of the 2nd conference on Greek language and terminology, 21–23 October, Athens, Greece, pp 149–156 (in Greek)

  2. Tambouratzis G, Carayannis G (2001) Automatic corpora-based stemming in Greek. Lit Ling Comput 16(4):445–466

    Article  Google Scholar 

  3. Tambouratzis G, Vassiliou M (2007) Implementing a high-accuracy automated morphological processing of texts in ancient Greek. In: Proceedings of the 8th international conference on Greek Linguistics; Ioannina, Greece, 30 Aug–2 Sept

  4. Tzartzanos A (1960) Grammatiki tis Archeas Ellinikis Glossis [Grammar of the Ancient Greek Language] (in Greek) Athens. OESB Publishers, Greece

    Google Scholar 

  5. Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B Cybern 26(1):29–41

    Article  Google Scholar 

  6. Tambouratzis G (2009) Using an ant colony metaheuristic to optimize automatic word segmentation for ancient Greek. IEEE Trans Evol Comput 13(4):742–753

    Article  Google Scholar 

  7. Tambouratzis G (2013) Optimizing word segmentation tasks using ant colony metaheuristics. Lit Ling Comput 29(2):234–254

    Article  Google Scholar 

  8. Kennedy J, Eberhart RC (1995) Particle swarm optimisation. In: Proceedings of the IEEE international conference on neural networks, Perth, Australia, pp 1942–1947

  9. Kennedy J, Mendes R (2006) Neighborhood topologies in fully informed and best-of-neighborhood particle swarms. IEEE Trans Syst Man Cybern Part C Appl Rev 36(4):515–519

    Article  Google Scholar 

  10. Chen X, Li Y (2007) A modified PSO structure resulting in high exploration ability with convergence guaranteed. IEEE Trans Syst Man Cybern Part B Cybern 37(5):1271–1289

    Article  Google Scholar 

  11. Liu L, Yang S, Wang D (2010) Particle swarm optimization with composite particles in dynamic environments. IEEE Trans. Syst. Man Cybern Part B Cybern 40(6):1634–1648

    Article  Google Scholar 

  12. Montes de Oca MA, Stützle T, Birattari M, Dorigo M (2009) Frankenstein’s PSO: a composite particle swarm optimisation algorithm. IEEE Trans Evol Comput 13(5):1120–1132

    Article  Google Scholar 

  13. Montes de Oca MA, Stützle T, Van den Ende K, Dorigo M (2011) Incremental social learning in particle swarms. IEEE Trans Syst Man Cybern Part B Cybern 41(2):368–384

    Article  Google Scholar 

  14. Martens D, Baesens B, Fawcett T (2011) Editorial survey: swarm intelligence for data mining. Mach Learn 82:1–42

    Article  MathSciNet  Google Scholar 

  15. Leung AYT, Zhang H, Cheng CC, Lee YY (2008) Particle swarm optimization of TMD by non-stationary base excitation during earthquake. Earthq Eng Struct Dyn 37:1223–1246

    Article  Google Scholar 

  16. Leung AYT, Zhang H (2009) Particle swarm optimization of tuned mass dampers. Eng Struct 31:715–728

    Article  Google Scholar 

  17. Zhang H, Llorca J, Davis CC, Milner SD (2012) Nature-inspired self-organization, control and optimization in heterogeneous wireless networks. IEEE Trans Mob Comput 11(7):1207–1222

    Article  Google Scholar 

  18. Goldsmith J (2006) An algorithm for the unsupervised learning of morphology. Nat Lang Eng 1(4):353–371

    Article  Google Scholar 

  19. Creutz M, Lagus K (2007) Unsupervised models for morpheme segmentation and morphology learning. ACM Trans Speech Lang Process 4(1):3

    Article  Google Scholar 

  20. Dejean H (1998) Morphemes as necessary concept for structures discovery from untagged corpora. In: Proceedings of the NeMLaP/CoNLL-1998 joint conference, Macquarie University, Sydney, NSW, Australia, January 11–17, pp.295–298

  21. Bernard D (2005) Unsupervised morphological segmentation based on segment predictability and word segments alignment. In: Kurimo Mikko, Creutz Mathias, Lagus Krista (eds) Unsupervised segmentation of words into morphemes—Challenge 2005. Helsinki University of Technology, Helsinki, pp 18–22

    Google Scholar 

  22. Kurimo M, Virpioja S, Turunen VT (2010) Overview and results of morpho challenge 2010. Technical Report TKK-ICS-R37, Aalto University School of Science and Technology, Department of Information and Computer Science, Espoo, Finland, September

  23. Wang M, Voigt R, Manning CD (2014) Two knives cut better than one: Chinese word segmentation with dual decomposition. In: Proceedings of the 52nd annual meeting of the association for computational linguistics; Baltimore, Maryland, USA, June 23–25, vol 2. pp 193–198

  24. Zhan Z-H, Zhang J, Li Y, Chung HS-H (2009) Adaptive particle swarm optimization. IEEE Trans Syst Man Cybern Part B Cybernetics 39(6):1362–1381

    Article  Google Scholar 

  25. Clerc M (2006) Particle swarm optimisation. ISTE Ltd., London, UK. (ISBN-13: 978-1-905209-04-0)

  26. Leong W-F, Yen GG (2008) PSO-based multiobjective optimization with dynamic population size and adaptive local archives. IEEE Trans Syst Man Cybern B Cybern 38(5):1270–1293

    Article  Google Scholar 

  27. Daneshyari M, Yen GG (2011) Cultural-based multiobjective particle swarm optimization. IEEE Trans Syst Man Cybern B Cybern 41(2):553–567

    Article  Google Scholar 

  28. Thesaurus Linguae Graecae CD-ROM #5. ISBN 0-9675843-0-2

  29. TLG Beta Code Quick Reference Guide (16 July 2009). (www.tlg.uci.edu/encoding/quickbeta.pdf)

  30. Stützle T, Hoos HH (2000) MAX-MIN ant system. Fut Gen Comput Syst 16:889–914

    Article  MATH  Google Scholar 

  31. Gimmler J, Stützle T, Exner TE (2006) Hybrid particle swarm optimisation: an examination of the influence of iterative improvement algorithms on its behaviour. In: Proceedings of ANTS-2006 Workshop; Brussels, Belgium, September 4–7, Lecture Notes in Computer Science, 4150:436–443

  32. Brent RP (1973) Algorithms for minimization without derivatives, chapter 5. Englewood Cliffs, NJ, Prentice-Hall

    MATH  Google Scholar 

  33. Press WH, Teukolsky SA, Vetterling WT, Flannery BP (1992) Numerical recipes in fortran 77: the art of scientific computing, chapter 7. Cambridge University Press, New York

    MATH  Google Scholar 

  34. Derrac J, Garcia S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1:3–18

    Article  Google Scholar 

  35. Mendes R, Kennedy J, Neves J (2004) The fully informed particle swarm: simpler, maybe better. IEEE Trans Evol Comput 8(3):204–210

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Language and Speech Processing, Athena Research Centre, 6 Artemidos and Epidavrou Street, Maroussi, 151 25, Athens, Greece

    George Tambouratzis

Authors
  1. George Tambouratzis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to George Tambouratzis.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tambouratzis, G. Applying particle swarm optimisation to the morphological segmentation of words from Ancient Greek texts. Pattern Anal Applic 19, 1195–1212 (2016). https://doi.org/10.1007/s10044-016-0573-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10044-016-0573-8

Keywords

Search

Navigation