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
Apolloni, B., Mauri, G., Trevisson, C., Valota, P., Zanaboni, A. (1992). Learning to solve PP-attachment ambiguities in natural language processing through neural networks. In Proceedings CompEuro '92. Computer Systems and Software Engineering (pp.199-205). Los Alamitos : IEEE [10.1109/CMPEUR.1992.218509].
Learning to solve PP-attachment ambiguities in natural language processing through neural networks
MAURI, GIANCARLO;
1992
Abstract
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
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
