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.

DU Jia-li and YU Ping-fang, “A computational linguistic approach to natural language processing with applications to garden path sentences analysis” International Journal of Advanced Computer Science and Applications(IJACSA), 3(9), 2012. http://dx.doi.org/10.14569/IJACSA.2012.030909

@article{Jia-li2012,
title = {A computational linguistic approach to natural language processing with applications to garden path sentences analysis},
journal = {International Journal of Advanced Computer Science and Applications}
doi = {10.14569/IJACSA.2012.030909},
url = {http://dx.doi.org/10.14569/IJACSA.2012.030909},
year = {2012},
publisher = {The Science and Information Organization},
volume = {3},
number = {9},
author = {DU Jia-li and YU Ping-fang},
}