文章基本信息

标题：An Experimental Survey on Parsing with Neural and Finite Automata Networks
本地全文：下载
作者：Sanjay Bhargava ; G. N. Purohit
期刊名称：International Journal of Computer Science Issues
印刷版ISSN：1694-0784
电子版ISSN：1694-0814
出版年度：2011
卷号：8
期号：4
出版社：IJCSI Press
摘要：Parsing is the process of structuring a linear depiction in accordance with a given grammar. The �linear depiction� may be a language sentence, a computer program, a weaving pattern, a sequence of biological strata, a part of music, actions in a ritual performance, in short any linear chain in which the preceding elements in some way confine the next element. Parsing with finite automata networks implies, in one way, the conversion of a regular expression into a minimal deterministic finite automaton, while parsing with neural networks involves parsing of a natural language sentence. This research paper presents a twofold investigation on the various parsing techniques with (i) neural networks and (ii) finite automata networks. Consequently, the present research paper depicts a comprehensive comparison among a number of parsing techniques with neural networks followed by another in depth comparison flanked by a number of parsing techniques with finite automata networks.
关键词：Neural networks; Finite automata networks; Parsing; Regular expressions; Natural language processing