Back to Results
First PageMeta Content
Compiler construction / Computing / Parsing / Computational linguistics / Stochastic context-free grammar / Treebank / Chart parser / Syntax / Context-free grammar / Formal languages / Software engineering / Programming language implementation


Fast Exact Inference with a Factored Model for Natural Language Parsing Dan Klein Department of Computer Science Stanford University
Add to Reading List

Document Date: 2003-01-19 19:26:31


Open Document

File Size: 92,31 KB

Share Result on Facebook

City

Albany / /

Company

IBM / State University of New York Press / Parsing Technologies / payrolls-NNS / /

/

Facility

University College London / University of Pennsylvania / /

IndustryTerm

Tree-bank grammars / inside-outside algorithm / /

Organization

IN VP / National Park Service / University College London / National Science Foundation / University of Pennsylvania / Christopher D. Manning Department / Acoustical Society of America / NP VP / Stanford University Stanford / Natural Language Parsing Dan Klein Department / State University of New York / /

Person

Speech / VBD NP NP / Lillian Lee / LING PCFG / Fernando Pereira / PCFG LING / Dan Klein / Joshua Goodman / /

/

Position

Dependency Model DEP-BASIC DEP-VAL DEP-BASIC DEP-VAL DEP-BASIC DEP-VAL Dependency Model / VP / model / first author / VP payrolls-NNS NN NNS VBD / head / second author / /

Product

Pentax K-x Digital Camera / /

ProgrammingLanguage

Java / /

ProvinceOrState

Pennsylvania / New York / /

PublishedMedium

Computational Linguistics / New York Press / /

Technology

speech recognition / RAM / inside-outside algorithm / artificial intelligence / Java / /

SocialTag