Back to Results
First PageMeta Content
Mathematics / Linguistics / Combinatorics / Parsing / Treebank / Bottom-up parsing / Deterministic parsing / Algorithm / Context-free grammar / Formal languages / Compiler construction / Theoretical computer science


Algorithms for Deterministic Incremental Dependency Parsing Joakim Nivre∗ , ∗∗ V¨axjo¨ University, Uppsala University Parsing algorithms that process the input from left to right and construct a single derivatio
Add to Reading List

Document Date: 2010-06-14 18:55:47


Open Document

File Size: 279,23 KB

Share Result on Facebook

City

Prague / Parsing Dependency / /

Company

Dependency Treebank / Prague Dependency Treebank / Penn Treebank / /

Country

Sweden / /

/

Facility

Uppsala University / V¨axjo¨ University / /

IndustryTerm

grammar parsing algorithms / stack-based algorithms / data-driven systems / projective algorithms / greedy search strategy / deterministic incremental parsing algorithms / stack-based and list-based algorithms / online learning / stack-based parsing algorithm / deterministic search / non-projective list-based algorithm / beam search / search space / transition systems / human sentence processing / search mechanism / /

Organization

School of Mathematics and Systems Engineering / Uppsala University / Department of Linguistics and Philology / Association for Computational Linguistics Computational Linguistics Volume / /

Person

Joakim Nivre / Hudson / Ct / /

Position

correspondent / head / /

ProgrammingLanguage

RC / /

Technology

projective algorithms / stack-based and list-based algorithms / stack-based algorithms / deterministic incremental parsing algorithms / parsing algorithm / grammar parsing algorithms / parsing algorithms / non-projective list-based algorithm / Uppsala University Parsing algorithms / html / stack-based algorithm / four algorithms / stack-based parsing algorithm / /

URL

http /

SocialTag