Dependency Parsing as a Sequence Labeling Task

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10071188" target="_blank" >RIV/00216208:11320/10:10071188 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Dependency Parsing as a Sequence Labeling Task

Original language description

The aim of this paper is to explore the feasibility of solving the dependency parsing problem using sequence labeling tools. We introduce an algorithm to transform a dependency tree into a tag sequence suitable for a sequence labeling algorithm and evaluate several parameter settings on the standard treebank data. We focus mainly on Czech, as a high-inflective free-word-order language, which is not so easy to parse using traditional techniques, but we also test our approach on English for comparison.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

AI - Linguistics

OECD FORD branch

—

Project

<a href="/en/project/GA405%2F09%2F0278" target="_blank" >GA405/09/0278: Internet as a language corpus</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2010

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

The Prague Bulletin of Mathematical Linguistics

ISSN

0032-6585

e-ISSN

—

Volume of the periodical

Neuveden

Issue of the periodical within the volume

94

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

8

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—