This HTML5 document contains 41 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n8http://localhost/temp/predkladatel/
n16http://linked.opendata.cz/resource/domain/vavai/projekt/
n5http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/ontology/domain/vavai/
n18http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F10%3A10071188%21RIV11-GA0-11320___/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F10%3A10071188%21RIV11-GA0-11320___
rdf:type
skos:Concept n12:Vysledek
dcterms: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. 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.
dcterms:title
Dependency Parsing as a Sequence Labeling Task Dependency Parsing as a Sequence Labeling Task
skos:prefLabel
Dependency Parsing as a Sequence Labeling Task Dependency Parsing as a Sequence Labeling Task
skos:notation
RIV/00216208:11320/10:10071188!RIV11-GA0-11320___
n3:aktivita
n13:P
n3:aktivity
P(GA405/09/0278)
n3:cisloPeriodika
94
n3:dodaniDat
n15:2011
n3:domaciTvurceVysledku
n5:7699611 n5:1305522
n3:druhVysledku
n10:J
n3:duvernostUdaju
n17:S
n3:entitaPredkladatele
n18:predkladatel
n3:idSjednocenehoVysledku
253340
n3:idVysledku
RIV/00216208:11320/10:10071188
n3:jazykVysledku
n11:eng
n3:klicovaSlova
task; labeling; sequence; parsing; dependency
n3:klicoveSlovo
n4:labeling n4:task n4:dependency n4:sequence n4:parsing
n3:kodStatuVydavatele
CZ - Česká republika
n3:kontrolniKodProRIV
[AE4A339ECFC8]
n3:nazevZdroje
The Prague Bulletin of Mathematical Linguistics
n3:obor
n14:AI
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n16:GA405%2F09%2F0278
n3:rokUplatneniVysledku
n15:2010
n3:svazekPeriodika
Neuveden
n3:tvurceVysledku
Spoustová, Drahomíra Spousta, Miroslav
s:issn
0032-6585
s:numberOfPages
8
n8:organizacniJednotka
11320