NATURAL LANGUAGE PARSING WITH RECURSIVE NEURAL NETWORK

Page 15

Model 1: Greedy RNN(continue............)

This score (W score ) measures how well the two words are combined into a phrase After computing the first score we shift right and take its neighboring pair (x2 , x3 ) and compute with Eq.3. This process is repeat until all the inputs are over Then replace the maximum scored function with potential (p) and repeat all the steps for next level also. This process continues till all inputs and non-terminals are converted to one potential(p).

Mujeeb Rehman O. (G. E. C. Sreekrishnapuram )

RNN

April 10, 2012

15 / 25


Issuu converts static files into: digital portfolios, online yearbooks, online catalogs, digital photo albums and more. Sign up and create your flipbook.