A Parser based on Connectionist Model

摘要

This paper proposes a parser based fully upon the connectionist model(called "CM parser" hereafter). In order to realize the CM parser, we use Sigma-Pi-Units to implement a constraint of grammatical category order or word order, and a copy mechanism of sub-parse trees. Further more, we suppose there exist weak suppressive connection links between every pair of CM units. By these suppressive links, our CM parser explains why garden path sentences and/or deeply nested sentences are hard to recognize. Our CM parser also explains the preference principles for syntactically ambiguous sentences.