Back to Results
First PageMeta Content
Parser generators / Compiler construction / Formal languages / Parsing / Bottom-up parsing / SYNTAX / Parse tree / GOLD / Stochastic context-free grammar / Programming language implementation / Software engineering / Computing


A Classifier-Based Parser with Linear Run-Time Complexity Kenji Sagae and Alon Lavie Language Technologies Institute Carnegie Mellon University Pittsburgh, PA 15213
Add to Reading List

Document Date: 2012-01-18 20:15:34

Open Document

File Size: 53,26 KB

Share Result on Facebook

City

Geneva / Philadelphia / Madrid / Pittsburgh / Seattle / Barcelona / Providence / Nancy / Budapest / Lisbon / Tolouse / /

Company

Wall Street Journal / trans- Precision / Parsing Technologies / Penn Treebank / /

Country

Switzerland / France / Portugal / Spain / /

/

Event

Product Issues / Product Recall / /

Facility

Alon Lavie Language Technologies Institute Carnegie Mellon University / /

IndustryTerm

basic bottom-up shiftreduce algorithm / involved algorithm / search strategy / natural language processing / larger search space / quadratic run-time algorithm / similar algorithm / /

Organization

PP NP / Linear Run-Time Complexity Kenji Sagae and Alon Lavie Language Technologies Institute Carnegie Mellon University Pittsburgh / North American Chapter / Association for Computational Linguistics / /

Person

Detransform Figure / Computational Linguistics / Alon Lavie / /

Position

VP / PP / same lexical head / head / lexical head / /

Product

constituents / section of the Penn Treebank / Matsumoto / Dependency / Yamada / /

ProvinceOrState

Pennsylvania / Rhode Island / Washington / /

PublishedMedium

the Wall Street Journal / /

Technology

quadratic run-time algorithm / RAM / natural language processing / IB1 algorithm / boosting algorithm / similar algorithm / basic bottom-up shiftreduce algorithm / same algorithm / 2.1 Algorithm / /

URL

http /

SocialTag