Back to Results
First PageMeta Content
Science / Stochastic context-free grammar / Combinatory categorial grammar / Context-free grammar / Parsing / Bottom-up parsing / Formal grammar / Algorithm / Categorial grammar / Formal languages / Linguistics / Grammar


Recognizing Plans with Loops Represented in a Lexicalized Grammar
Add to Reading List

Document Date: 2011-08-12 18:54:30


Open Document

File Size: 474,03 KB

Share Result on Facebook

City

Vilain / Work Graph / Minneapolis / /

Company

Grammars Limited / EU Cognitive Systems / Wellman / Dover Publications Inc. / MIT Press / SIFT LLC / /

/

Facility

terminal X / Informatics University of Edinburgh / /

IndustryTerm

step algorithm / incremental parsing algorithms / polynomial time algorithms / plan recognition systems / polynomial time algorithm / effective algorithms / incremental algorithms / machinery / incremental plan recognition systems / natural language processing / plan recognition applications / hierarchical task network / incremental parsing algorithm / probabilistic plan recognition algorithm / in-order processing / efficient algorithms / /

Organization

Artificial Intelligence / Artificial Copyright Intelligence / MIT / University of Edinburgh / European Commission / Association for the Advancement / European Union / /

Person

Addison Wesley / Robert P. Goldman / Pelavin / Morgan Kaufmann / Christopher W. Geib Robert / /

/

Position

R. N. / programmer / /

ProvinceOrState

Minnesota / M. B. / /

Technology

natural language processing / Prior Work Graph-based algorithms / artificial intelligence / polynomial time algorithm / efficient algorithms / incremental parsing algorithms / effective algorithms / incremental parsing algorithm / polynomial time algorithms / two step algorithm / existing parsing algorithms / ELEXIR algorithm / probabilistic plan recognition algorithm / existing parsing algorithm / /

URL

www.aaai.org / /

SocialTag