Abstract

How are knowledge-intensive, text-comprehension processes computed? Specifically, how are (1) explicit propositions remembered correctly, (2) pronouns resolved, (3) coherence and prediction inferences drawn, (4) on-going interpretations revised as more information becomes available, and (5) information learned in specific contexts generalized to novel texts? A constraint satisfaction model is presented that offers a number of advantages over previous models: Each of the previous processes can be seen as examples of the same process of constraint satisfaction, constraints can have strengths to represent the degrees of correlation among information, and the independence of constraints provides insight into generalization. In the model, propositions describing a simple event, such as going to the beach or a restaurant, are sequentially presented to a recurrent PDP network. The model is trained through practice processing a large number of example texts and answering questions. Questions are predicates from propositions explicit or inferable from the text, and the model has to answer with the proposition that fits that predicate. The model learns to perform well, though some processes require substantial training. A second simulation shows how the combinatorics in the training corpus can increase generalization. This effect is explained by introducing the concept of identity and associative constraints that are learned from a corpus. Overall, the model provides a number of insights into how a graded constraint-satisfaction model can compute knowledge-intensive processes in text comprehension.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.