Back to Results
First PageMeta Content
Compiler construction / Formal languages / LL parser / Dependency grammar / Linear programming / Parse tree / Conditional random field / Combinatory logic / Directed graph / Mathematics / Graph theory / Theoretical computer science


Concise Integer Linear Programming Formulations for Dependency Parsing ∗ Andr´e F. T. Martins∗† Noah A. Smith∗ Eric P. Xing∗ School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA
Add to Reading List

Document Date: 2009-05-19 09:57:02

Open Document

File Size: 370,04 KB

Share Result on Facebook

Company

Princeton University Press / M. Wang N. A. / D. Das N. A. / A. F. T. Martins N. A. / /

Country

Jordan / /

Currency

pence / /

/

Facility

Carnegie Mellon University / Massachusetts Institute of Technology / /

IndustryTerm

http /

Organization

Andr´e F. T. Martins∗† Noah A. Smith∗ Eric P. Xing∗ School of Computer Science / National Science Foundation / Instituto Superior T´ecnico / National Bureau of Standards / IBM Faculty / Princeton University / Carnegie Mellon University / Pittsburgh / Massachusetts Institute of Technology / /

Person

Palmer / Ding / Ai / Az / Eric P. Xing / Noah A. Smith∗ Eric / Dan Bikel / /

Position

generative model / /

ProgrammingLanguage

T / /

ProvinceOrState

Massachusetts / /

PublishedMedium

Machine Learning / /

Technology

quadratic algorithm / projective / cubic-time algorithms / hillclimbing algorithm / av / passive-aggressive algorithm / dynamic programming parsing algorithm / spanning tree algorithms / resulting algorithm / existing combinatorial algorithms / following approximate algorithm / model parsing algorithms / machine translation / polynomial-time algorithms / approximate dependency parsing algorithms / ChuLiu-Edmonds algorithm / Online passive-aggressive algorithms / cuttingplane algorithm / Machine Learning / MIRA algorithm / cutting-plane algorithm / using spanning tree algorithms / /

URL

http /

SocialTag