文章基本信息

标题：A computational linguistic approach to natural language processing with applications to garden path sentences analysis
本地全文：下载
作者：DU Jia-li ; YU Ping-fang
期刊名称：International Journal of Advanced Computer Science and Applications(IJACSA)
印刷版ISSN：2158-107X
电子版ISSN：2156-5570
出版年度：2012
卷号：3
期号：9
DOI：10.14569/IJACSA.2012.030909
出版社：Science and Information Society (SAI)
摘要：This paper discusses the computational parsing of GP sentences. By an approach of combining computational linguistic methods, e.g. CFG, ATN and BNF, we analyze the various syntactic structures of pre-grammatical, common, ambiguous and GP sentences. The evidence shows both ambiguous and GP sentences have lexical or syntactic crossings. Any choice of the crossing in ambiguous sentences can bring a full-parsed structure. In GP sentences, the probability-based choice is the cognitive prototype of parsing. Once the part-parsed priority structure is replaced by the full-parsed structure of low probability, the distinctive feature of backtracking appears. The computational analysis supports Pritchett’s idea on processing breakdown of GP sentences.
关键词：thesai; IJACSA; thesai.org; journal; IJACSA papers; Natural language processing; computational linguistics; context free grammar; Backus–Naur Form; garden path sentences.