%0 Journal Article %1 IJACSA.2012.030909 %A DU Jia-li, Y U Ping-fang %D 2012 %J International Journal of Advanced Computer Science and Applications(IJACSA) %K Backus–Naur Form; Natural computational context free garden grammar; language linguistics; path processing; sentences. %N 9 %T A computational linguistic approach to natural language processing with applications to garden path sentences analysis %U http://ijacsa.thesai.org/ %V 3 %X 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.

@article{IJACSA.2012.030909, abstract = {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.}, added-at = {2014-02-21T08:00:08.000+0100}, author = {{DU Jia-li}, Y U Ping-fang}, biburl = {https://www.bibsonomy.org/bibtex/2a17c9cb36d871f206e5492e643e31b76/thesaiorg}, interhash = {9e9e14495defe13b378f4f2dba57eda8}, intrahash = {a17c9cb36d871f206e5492e643e31b76}, journal = {International Journal of Advanced Computer Science and Applications(IJACSA)}, keywords = {Backus–Naur Form; Natural computational context free garden grammar; language linguistics; path processing; sentences.}, number = 9, timestamp = {2014-02-21T08:00:08.000+0100}, title = {{A computational linguistic approach to natural language processing with applications to garden path sentences analysis}}, url = {http://ijacsa.thesai.org/}, volume = 3, year = 2012 }