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.

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