Close category search window
 

Learning to solve PP-attachment ambiguities in natural language processing through neural networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Apolloni, B. ; Dipartimento di Sci. dell''Inf., Milano Univ., Italy ; Mauri, G. ; Trevisson, C. ; Valota, P.
more authors

A technique is proposed, based on neural networks for dealing with a particular problem of syntactical ambiguity in the process of building the syntactical tree of an Italian sentence, namely the PP-attachment problem. The neural network was used as a daemon for a top-down parser, when it faced multiple entries in the parsing table. The network was trained to solve PP-attachment ambiguities by the well known algorithm for error back-propagation. What is new is the knowledge representation technique in the network, which has been designed to represent the relevant pieces of information about the constituents of the sentence. Performance results are reported and discussed, together with future perspectives.<>

Published in:
CompEuro '92 . 'Computer Systems and Software Engineering',Proceedings.

Date of Conference: 4-8 May 1992

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.