paper-with-me

Papers

K-Best Spanning Tree Dependency Parsing With Verb Valency Lexicon Reranking

2012-12-01 · COLING 2012 12 · Zeljko Agic
📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Dependency ParsingReranking

Similar Papers 제목 키워드 기반

Multi-source synthetic treebank creation for improved cross-lingual dependency parsing

2018-11-01 · WS 2018 11 · Francis Tyers, Mariya Sheyanova, Aleks Martynova, ra 외

This paper describes a method of creating synthetic treebanks for cross-lingual dependency parsing using a combination of machine translation (including pivot translation), annotation projection and the spanning tree alg…

Dependency ParsingMachine TranslationSentenceTranslation

On Finding the K-best Non-projective Dependency Trees

2021-08-01 · ACL 2021 5 · Ran Zmigrod, Tim Vieira, Ryan Cotterell

The connection between the maximum spanning tree in a directed graph and the best dependency tree of a sentence has been exploited by the NLP community. However, for many dependency parsing schemes, an important detail o…

Dependency ParsingSentence

On Finding the $K$-best Non-projective Dependency Trees

2021-06-01 · Ran Zmigrod, Tim Vieira, Ryan Cotterell

The connection between the maximum spanning tree in a directed graph and the best dependency tree of a sentence has been exploited by the NLP community. However, for many dependency parsing schemes, an important detail o…

Dependency ParsingSentence

Maximising Spanning Subtree Scores for Parsing Tree Approximations of Semantic Dependency Digraphs

2015-07-01 · WS 2015 7 · Natalie Schluter
Dependency Parsing

A Dependency Treebank of the Chinese Buddhist Canon

2016-05-01 · LREC 2016 5 · Tak-sum Wong, John Lee

We present a dependency treebank of the Chinese Buddhist Canon, which contains 1,514 texts with about 50 million Chinese characters. The treebank was created by an automatic parser trained on a smaller treebank, containi…

Dependency ParsingPart-Of-Speech Tagging