Back to Results
First PageMeta Content
Software engineering / CYK algorithm / Formal grammar / Context-free grammar / Parsing / Automata theory / Categorial grammar / Formal languages / Grammar / Linguistics


Proc. of the 37th ACL (Assoc. for Computational LinguisticsEfficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars∗ Jason Eisner
Add to Reading List

Document Date: 2012-09-12 23:56:12


Open Document

File Size: 171,88 KB

Share Result on Facebook

City

Madrid / Cambridge / Los Altos / Budapest / Reading / Nantes / Santa Cruz / /

Company

Prentice-Hall / State University of New York Press / MIT Press / /

Country

France / /

/

Facility

Informatica University of Pennsylvania Universit`a di Padova / University of Chicago Press / /

IndustryTerm

context-free parsing algorithms / natural language processing systems / faster parsing algorithms / grammatical rewriting systems / head-automaton parsing algorithm / syntactic processing / declarative algorithm / recognition algorithm / chart parsing algorithms / /

Organization

Assoc. for Computational Linguistics / National Park Service / University of Chicago Press / University of Pennsylvania / MIT / Univ. of Pennsylvania / Informatica University / State University of New York / /

Person

Gonzales / Yves Schabes / Nat / Automaton Grammars∗ Jason Eisner / /

Position

VP / grammar writer / head / left end / lexical head / /

ProvinceOrState

Vermont / Pennsylvania / California / Massachusetts / /

PublishedMedium

Computational Linguistics / New York Press / /

Technology

faster parsing algorithms / Human Language Technology / natural language processing / declarative algorithm / previous algorithms / head-automaton parsing algorithm / CKY algorithm / context-free parsing algorithms / disambiguation.1 The chart parsing algorithms / recognition algorithm / /

SocialTag