Back to Results
First PageMeta Content
Science / Grammar / Treebank / Chart parser / Parsing / Bottom-up parsing / Stochastic context-free grammar / Formal grammar / Context-free grammar / Formal languages / Linguistics / Compiler construction


Parsing with Treebank Grammars: Empirical Bounds, Theoretical Models, and the Structure of the Penn Treebank Dan Klein and Christopher D. Manning Computer Science Department Stanford University Stanford, CA
Add to Reading List

Document Date: 2001-05-28 19:28:08

Open Document

File Size: 147,65 KB

Share Result on Facebook

City

Redwood City / Boston / /

Company

MIT Press / Parsing Technologies / Treebank / Penn Treebank / Intel / /

/

Facility

Stanford University / /

IndustryTerm

bank / power law model / /

Organization

National Park Service / CC NP / NP CC / MIT / Stanford University / FSA / Stanford University Stanford / /

Person

RIE -N OT RANSFORM / Eugene Charniak / Robert C. Moore / Hinrich Sch / Jay Earley / Mary Ann Marcinkiewicz / RIE N O E MPTIES / RIE -N O U NARIES / Mitchell P. Marcus / Michael John Collins / RIE -N O E MPTIES / RIE N OT RANSFORM / Dan Klein / Christopher D. Manning / Beatrice Santorini / Benjamin Cummings / T RIE / /

Position

VP LST PRT WHPP CONJP WHADJP WHADVP Figure / VP / PP / VP WHNP CONJP NAC PRT SINV SBARQ WHADJP Treebank Grammar Structure WHPP WHADVP The reason / SBAR SBARQ SINV SQ UCP VP / Senator / VP Atone List-NoTransform exp / /

ProgrammingLanguage

Java / /

ProvinceOrState

Indiana / /

PublishedMedium

Computational Linguistics / Communications of the ACM / /

SportsLeague

Stanford University / /

Technology

RAM / Natural Language Processing / Java / /

SocialTag