K-Best Spanning Tree Dependency Parsing With Verb Valency Lexicon Reranking
Code (0)
등록된 구현이 없습니다.
Tasks
Dependency ParsingRerankingSimilar Papers 제목 키워드 기반
Multi-source synthetic treebank creation for improved cross-lingual dependency parsing
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 TranslationSentenceTranslationOn Finding the K-best Non-projective Dependency Trees
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 ParsingSentenceOn Finding the $K$-best Non-projective Dependency Trees
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 ParsingSentenceMaximising Spanning Subtree Scores for Parsing Tree Approximations of Semantic Dependency Digraphs
A Dependency Treebank of the Chinese Buddhist Canon
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