On the Complexity of Non-Projective Data-Driven Dependency Parsing

doi 10.3115/1621410.1621426
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computational Linguistics

Related search

Data-Driven Dependency Parsing of New Languages Using Incomplete and Noisy Training Data

2009English

Sorting Out Dependency Parsing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Dependency Parsing Based on Dynamic Local Optimization

2006English

Application of Feature Propagation to Dependency Parsing

2009English

Mining Feature-Opinion From Reviews Based on Dependency Parsing

2016English

Query Term Ranking Based on Dependency Parsing of Verbose Queries

2010English

Multi-Lingual Dependency Parsing at NAIST

2006English

Research on Methods of Microblogging Sentiment Feature Extraction Based on Dependency Parsing

2015English

On the Complexity of Parallel Parsing of General Context-Free Languages

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1986English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy