Back to Results
First PageMeta Content
Theoretical computer science / Compiler construction / Programming language implementation / Bioinformatics / Stochastic context-free grammar / Complexity classes / Left corner / Parse tree / Parsing / Formal languages / Linguistics / Statistical natural language processing


LSA 354: Statistical Parsing: Problem Set [Some of these problems are borrowed with thanks from Michael Collins and Regina Barzilay.] Question 1 Let’s use a very simple grammar (where S is the start symbol, and termina
Add to Reading List

Document Date: 2007-07-10 03:17:11

Open Document

File Size: 71,29 KB

Share Result on Facebook

Company

SBAR COMP / V3 NN DT COMP S / V3 NN NN NN DT COMP / /

IndustryTerm

bottom-up processing / dynamic programming parsing algorithm / search trees / e-books / depth-first search / ready solution / search control / dynamic programming algorithm / search tree / above algorithm / search algorithm / /

Organization

VP NP / /

Person

Clarissa Lexica / Joe Genius / Vi Vt / NP VP V V / Regina Barzilay / /

Position

VP / VP Sally / VP PP Det / VP ADVP V2 / VP Fred / VP Input / VP V2 SBAR / VP / etc / VP to G0 / left end / /

PublishedMedium

the Stanford Bulletin / /

RadioStation

Fred / /

Technology

above algorithm / dynamic programming parsing algorithm / search algorithm / dynamic programming algorithm / /

URL

http /

SocialTag