Back to Results
First PageMeta Content
Grammar / Compiler construction / Parsing / SYNTAX / Tree-adjoining grammar / Earley parser / Parse tree / Dependency grammar / Context-free grammar / Linguistics / Formal languages / Programming language implementation


MICA: A Probabilistic Dependency Parser Based on Tree Insertion Grammars Application Note Srinivas Bangalore AT&T Labs – Research
Add to Reading List

Document Date: 2010-06-14 21:18:14

Open Document

File Size: 109,91 KB

Share Result on Facebook

City

Boulder / Vancouver / Prague / Amsterdam / Nancy / Marseille / /

Company

AT&T Labs / Srinivas Bangalore AT&T Labs / WSJ PennTreebank / Parsing Technologies / Penn Treebank / /

Country

France / Canada / Czech Republic / /

/

Facility

University of Delaware / Johan Hall / Harvard University / /

IndustryTerm

lexicalized probabilistic recursive transition networks / natural language processing / /

OperatingSystem

Linux / Aix / /

Organization

PP V / Harvard University / University of Delaware / NP PP / Stanford / Association for Computational Linguistics / /

Person

Wen Wang / David Chiang / Richard C. Waters / Mary arc / Owen Rambow / Mary P. Harper / Libin Shen / Alexis Nasr / John Chen / Christopher Manning / Philippe Deschamp / Patrick Haffner / Aravind Joshi / Stephen Clark / Stuart Shieber / Ryan Roth / Roger Levy / Liang Huang / James R. Curran / Aravind K. Joshi / Jay Earley / John Benjamins / John arc / Yves Schabes / Rebecca Hwa / Pierre Boullier / Jens Nilsson / Pierre Boulllier / /

Position

extractor / VP / editor / dependency extractor / VP NP0 / co-head / VP treebank / lexical head / /

ProvinceOrState

Delaware / Colorado / /

PublishedMedium

Computational Linguistics / /

Technology

Linux / natural language processing / /

URL

http /

SocialTag