Emergent Induction of L-system Grammar from a String with Deletion-type Transmutation

Ryohei Nakano

2014

Abstract

L-system is a computational model to capture the growth process of plants. Once a noise-tolerant grammatical induction called LGIC2 was proposed for deterministic context-free L-systems. LGIC2 induces L-system grammars from a transmuted string mY, employing an emergent approach. That is, frequently appearing substrings are extracted from mY to form grammar candidates. A grammar candidate can be used to generate a string Z; however, the number of grammar candidates gets huge. Thus, LGIC2 introduced three pruning techniques to narrow down candidates to get only promising ones. Candidates having the strongest similarities between mY and Z are selected as the final solutions. So far, LGIC2 has been evaluated for replacement- and insertion-type transmutations. This paper evaluates the performance of LGIC2 for deletion-type transmutation, after slightly modifying the method.

References

  1. Cormen, T. H., Leiserson, C. E. and Rivest, R. L. (1990). Introduction to algorithms. MIT Press.
  2. Higuera, C. de la. (2005). A bibliographical study of grammatical inference. Pattern Recognition, 38:1332- 1348.
  3. Hjaltason, G.R. and Samet, H. (2000). Contractive embedding methods for similarity searching in metric spaces. CS-TR-4102, Univ. of Maryland.
  4. Levenshtein, V. (1966). Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady, 10(8):707-710.
  5. Nakano, R. (2013a). Error correction of enumerative induction of deterministic context-free L-system grammar. IAENG Int. Journal of CS, 40(1):47-52.
  6. Nakano, R. (2013b). Emergent induction of deterministic context-free L-system grammar. Advances in Intelligent Systems and Computing 237, pp. 75-84.
  7. Nakano, R. and Suzumura, S. (2012). Grammatical induction with error correction for deterministic contextfree L-systems. In WCECS 2012, pp. 534-538.
  8. Nakano, R. and Yamada, N. (2010). Number theorybased induction of deterministic context-free Lsystem grammar. In KDIR 2010, pp. 194-199.
  9. Prusinkiewicz, P. and Hanan, J. (1989). Lindenmayer systems, fractals, and plants. Springer-Verlag, New York.
  10. Prusinkiewicz, P. and Lindenmayer, A. (1990). The algorithmic beauty of plants. Springer-Verlag, New York.
Download


Paper Citation


in Harvard Style

Nakano R. (2014). Emergent Induction of L-system Grammar from a String with Deletion-type Transmutation . In Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2014) ISBN 978-989-758-048-2, pages 397-402. DOI: 10.5220/0005149703970402


in Bibtex Style

@conference{kdir14,
author={Ryohei Nakano},
title={Emergent Induction of L-system Grammar from a String with Deletion-type Transmutation},
booktitle={Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2014)},
year={2014},
pages={397-402},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005149703970402},
isbn={978-989-758-048-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2014)
TI - Emergent Induction of L-system Grammar from a String with Deletion-type Transmutation
SN - 978-989-758-048-2
AU - Nakano R.
PY - 2014
SP - 397
EP - 402
DO - 10.5220/0005149703970402