Back to Results
First PageMeta Content



Recurrent Greedy Parsing with Neural Networks Jo¨el Legrand∗+ and Ronan Collobert+ ∗ Idiap Research Institute, Rue Marconi 19, Martigny, Suisse
Add to Reading List

Open Document

File Size: 149,25 KB

Share Result on Facebook

Company

English Penn Treebank / Penn Treebank / Neural Networks / Neural Networks S VP NP S PP / /

/

Facility

Idiap Research Institute / /

IndustryTerm

typical pre-processing / computing / iterative algorithm / bottom-up greedy algorithm / greedy algorithm / /

Organization

NP PP / Ecole Polytechnique F´ed´erale de Lausanne / VP VB / Idiap Research Institute / NP VB / US Federal Reserve / /

Person

Ai / /

Position

VP / standard CRF model for sequences / S-VP / PP E-VP / VP NP / Forward / VP E-S / /

Technology

greedy algorithm / Forward algorithm / bottom-up greedy algorithm / Natural Language Processing / The Viterbi algorithm / 2.2 Greedy Recurrent Algorithm / neural network / Viterbi algorithm / following iterative algorithm / /

SocialTag