{"pk":30866,"title":"Processing Unification-based Grammars in a Connectionist Framework","subtitle":null,"abstract":"We present an approach to the processing of unification-based grammars in the connectionist paradigm. The method involves two basic steps: (1) Translation of a grammar's rules into a set of structure fragments, and (2) encoding these fragments in a connectionist network such that unification and rule application can take place by spreading activation. Feature structures are used to constrain sentence generation by semantic and/or grammatical properties. The method incorporates a general model of unification in connectionist networks.","language":"eng","license":{"name":"","short_name":"","text":null,"url":""},"keywords":[],"section":"Poster Presentations","is_remote":true,"remote_url":"https://escholarship.org/uc/item/2w81f2f9","frozenauthors":[{"first_name":"Andreas","middle_name":"","last_name":"Stolcke","name_suffix":"","institution":"University of California, Berkeley","department":""}],"date_submitted":null,"date_accepted":null,"date_published":"1989-01-01T18:00:00Z","render_galley":null,"galleys":[{"label":"PDF","type":"pdf","path":"https://journalpub.escholarship.org/cognitivesciencesociety/article/30866/galley/20715/download/"}]}