PARSING TREE ADJOINING GRAMMARS USING EVOLUTIONARY ALGORITHMS

Adrian Horia Dediu, Cătălin Ionuţ Tîrnăucă

2009

Abstract

We use evolutionary algorithms to speed up a rather complex process, the tree adjoining grammars parsing. This improvement is due due to a linear matching function which compares the fitness of different individuals. Internally, derived trees are processed as tree-to-string representations. Moreover, we present some practical results and a post running analysis that may encourage the use of evolutionary techniques in mildly context sensitive language parsing, for example.

References

  1. Bäck, T. (1996). Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press.
  2. Castellanos, J., Martín-Vide, C., Mitrana, V., and Sempere, J. M. (2001). Solving np-complete problems with networks of evolutionary processors. In IWANN 7801, 6th International Work-Conference on Artificial and Natural Neural Networks. Springer.
  3. Csuhaj-Varjú, E., Martín-Vide, C., and Mitrana, V. (2005). Hybrid networks of evolutionary processors are computationally complete. Acta Inf., 41(4):257-272.
  4. Dediu, A. H. and Grando, M. A. (2005). Simulating evolutionary algorithms with eco-grammar systems. In IWINAC'05, 1st International Work-conference on the Interplay between Natural and Artificial Computation. Springer.
  5. Fogel, L. (1962). Autonomous automata. Industrial Research, 4:14-19.
  6. Fogel, L. J., Owens, A. J., and Walsh, M. J. (1966). Artificial Intelligence through Simulated Evolution. The University of Michigan Press, New York.
  7. Gécseg, F. and Steinby, M. (1997). Tree languages. In Salomaa, A. and Rozenberg, G., editors, Handbook of formal languages, Vol. 3: beyond words, pages 1-68. Springer, New York.
  8. Holland, J. (1975). Adaptation in Natural and Artificial Systems. The University of Michigan Press.
  9. Holland, J. H. (1962). Outline for a logical theory of adaptive systems. J. of the ACM, 9(3):297-314.
  10. Hopcroft, J. E. and Ullman, J. D. (1990). Introduction To Automata Theory, Languages, And Computation. Addison-Wesley Longman Publishing Co., Inc.
  11. Joshi, A. and Schabes, Y. (1997). Tree-adjoining grammars. In Rozenberg, G. and Salomaa, A., editors, Handbook of Formal Languages, Vol. 3: Beyond Words, pages 69-120. Springer, New York.
  12. Joshi, A. K., Levy, L. S., and Takahashi, M. (1975). Tree adjunct grammars. J. Comput. Syst. Sci., 10(1):136- 163.
  13. Koza, J. (1992). Genetic Programming. The Theory of Parsing, Translation, and Compiling. MIT Press.
  14. Rechenberg, I. (1973). Evolutionsstrategie - Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog, Stuttgart.
  15. Ryan, C., Collins, J. J., and O'Neill, M. (1998). Grammatical evolution: Evolving programs for an arbitrary language. In EuroGP'98, 1st European Workshop on Genetic Programming. Springer.
  16. Schmid, H. (1997). Parsing by successive approximation. In IWPT'97, International Workshop on Parsing Technologies. Available at http://elib.uni-stuttgart.de/opus/ volltexte/1999/393/pdf/393_1.pdf.
  17. Schwefel, H.-P. (1965). Kybernetische Evolution als Strategie der experimentellen Forschung in der Strömungstechnik. Diplomarbeit, Technische Universität Berlin, Hermann F öttinger-Institut für Strömungstechnik.
  18. Sippu, S. and Soisalon-Soininen, E. (1988). Parsing Theory I: Languages and Parsing. Springer.
Download


Paper Citation


in Harvard Style

Horia Dediu A. and Ionuţ Tîrnăucă C. (2009). PARSING TREE ADJOINING GRAMMARS USING EVOLUTIONARY ALGORITHMS . In Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: Special Session NEPS, (ICAART 2009) ISBN 978-989-8111-66-1, pages 632-639. DOI: 10.5220/0001811506320639


in Bibtex Style

@conference{special session neps09,
author={Adrian Horia Dediu and Cătălin Ionuţ Tîrnăucă},
title={PARSING TREE ADJOINING GRAMMARS USING EVOLUTIONARY ALGORITHMS},
booktitle={Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: Special Session NEPS, (ICAART 2009)},
year={2009},
pages={632-639},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001811506320639},
isbn={978-989-8111-66-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: Special Session NEPS, (ICAART 2009)
TI - PARSING TREE ADJOINING GRAMMARS USING EVOLUTIONARY ALGORITHMS
SN - 978-989-8111-66-1
AU - Horia Dediu A.
AU - Ionuţ Tîrnăucă C.
PY - 2009
SP - 632
EP - 639
DO - 10.5220/0001811506320639