Show simple item record

A Competitve Attachment Model for Resolving Syntactic Ambiguities in Natural Language Parsing

dc.contributor.authorStevenson, Suzanne Avaen_US
dc.date.accessioned2004-05-31T22:32:29Z
dc.date.available2004-05-31T22:32:29Z
dc.date.created1995-05en_US
dc.date.issued1998-10-15en_US
dc.identifier.urihttp://hdl.handle.net/1903/728
dc.description.abstractLinguistic ambiguity is the greatest obstacle to achieving practical computational systems for natural language understanding. By contrast, people experience surprisingly little difficulty in interpreting ambiguous linguistic input. This dissertation explores distributed computational techniques for mimicking the human ability to resolve syntactic ambiguities efficiently and effectively. The competitive attachment theory of parsing formulates the processing of an ambiguity as a competition for activation within a hybrid connectionist network. Determining the grammaticality of an input relies on a new approach to distributed communication that integrates numeric and symbolic constraints on passing features through the parsing network. The method establishes syntactic relations both incrementally and efficiently, and underlies the ability of the model to establish long-distance syntactic relations using only local communication within a network. The competitive distribution of numeric evidence focuses the activation of the network onto a particular structural interpretation of the input, resolving ambiguities. In contrast to previous approaches to ambiguity resolution, the model makes no use of explicit preference heuristics or revision strategies. Crucially, the structural decisions of the model conform with human preferences, without those preferences having been incorporated explicitly into the parser. Furthermore, the competitive dynamics of the parsing network account for additional on-line processing data that other models of syntactic preferences have left unaddressed. (Also cross-referenced as UMIACS-TR-95-55)en_US
dc.format.extent2592812 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3466en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-95-55en_US
dc.titleA Competitve Attachment Model for Resolving Syntactic Ambiguities in Natural Language Parsingen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record