paper-with-me

홈 › Papers

Converting Russian Dependency Treebank to Stanford Typed Dependencies Representation

2014-04-01 · EACL 2014 4 · Janna Lipenkova, Milan Sou{\v{c}}ek
📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Dependency ParsingMachine Translation

Similar Papers 제목 키워드 기반

Converting Italian Treebanks: Towards an Italian Stanford Dependency Treebank

2013-08-01 · WS 2013 8 · Cristina Bosco, Simonetta Montemagni, Maria Simi
Dependency Parsing

A Persian Treebank with Stanford Typed Dependencies

2014-05-01 · LREC 2014 5 · Mojgan Seraji, Carina Jahani, Be{\'a}ta Megyesi, Joakim Nivre

We present the Uppsala Persian Dependency Treebank (UPDT) with a syntactic annotation scheme based on Stanford Typed Dependencies. The treebank consists of 6,000 sentences and 151,671 tokens with an average sentence leng…

ArticlesCultural Vocal Bursts Intensity PredictionSentence

Universal Dependencies for Persian

2016-05-01 · LREC 2016 5 · Mojgan Seraji, Filip Ginter, Joakim Nivre

The Persian Universal Dependency Treebank (Persian UD) is a recent effort of treebanking Persian with Universal Dependencies (UD), an ongoing project that designs unified and cross-linguistically valid grammatical repres…

Sentencevalid

Universal Dependencies for Japanese

2016-05-01 · LREC 2016 5 · Takaaki Tanaka, Yusuke Miyao, Masayuki Asahara, Sumire Uematsu 외

We present an attempt to port the international syntactic annotation scheme, Universal Dependencies, to the Japanese language in this paper. Since the Japanese syntactic structure is usually annotated on the basis of uni…

Efficient Dependency Graph Matching with the IMS Open Corpus Workbench

2012-05-01 · LREC 2012 5 · Thomas Proisl, Peter Uhrig

State-of-the-art dependency representations such as the Stanford Typed Dependencies may represent the grammatical relations in a sentence as directed, possibly cyclic graphs. Querying a syntactically annotated corpus for…

Dependency ParsingGraph MatchingInformation RetrievalSentence