Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Applied Mathematics,Artificial Intelligence,Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Information Systems
Reference42 articles.
1. Abeille A (1988) Parsing french with tree adjoining grammar: Some linguistic accounts. In: Proceedings of the 12th Conference on Computational Linguistics - Volume 1, Association for Computational Linguistics, Stroudsburg, PA, USA, COLING ’88, pp 7–12
2. Alonso MA, de la Clergerie E, Cabrero D, Vilares M (1999) Tabular algorithms for tag parsing. In: Proceedings of the Ninth Conference on European Chapter of the Association for Computational Linguistics, Association for Computational Linguistics, Stroudsburg, PA, USA, EACL ’99, pp 150–157
3. Araujo L (2001) Evolutionary parsing for a probabilistic context free grammar. In: Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing, Springer-Verlag, London, UK, UK, RSCTC ’00, pp 590–597
4. Bangalore S, Joshi AK (1999) Supertagging: an approach to almost parsing. Comput Linguist 25(2):237–265
5. Bhandari D, Murthy CA, Pal SK (2012) Variance as a stopping criterion for genetic algorithms with elitist model. Fundam Inf 120(2):145–164