Analysis by Reduction of Analytical PDT-trees

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10370193" target="_blank" >RIV/00216208:11320/17:10370193 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Analysis by Reduction of Analytical PDT-trees

Popis výsledku v původním jazyce

In this paper is introduced the notion of full analysis by reduction on A-trees, and some of its constraints. It serves as a formal tool that helps to find adequate (types of) rules for restarting automata describing Czech syntax. A-trees represents a formalization of trees as they are used in the Prague Dependency Treebank (PDT). The full analysis by reduction of A-trees consists of all minimal correct reductions using two elementary operations, namely the delete and shift. The main focus is on the development of a formalism allowing for an exact formulation of linguistic properties of individual parameters of analysis by reduction of trees in the PDT format. With the help of linguistic observations we refine complexity properties of A-trees with respect to dependency and coordination relations. We emphasize those properties in which these relations differ.

Název v anglickém jazyce

Analysis by Reduction of Analytical PDT-trees

Popis výsledku anglicky

In this paper is introduced the notion of full analysis by reduction on A-trees, and some of its constraints. It serves as a formal tool that helps to find adequate (types of) rules for restarting automata describing Czech syntax. A-trees represents a formalization of trees as they are used in the Prague Dependency Treebank (PDT). The full analysis by reduction of A-trees consists of all minimal correct reductions using two elementary operations, namely the delete and shift. The main focus is on the development of a formalism allowing for an exact formulation of linguistic properties of individual parameters of analysis by reduction of trees in the PDT format. With the help of linguistic observations we refine complexity properties of A-trees with respect to dependency and coordination relations. We emphasize those properties in which these relations differ.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA15-04960S" target="_blank" >GA15-04960S: SeLeCt - struktury, učení a kognice</a><br>

Návaznosti

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

Rok uplatnění

2017

Kód důvěrnosti údajů

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

Název statě ve sborníku

Ninth Workshop on Non-Classical Models of Automata and Applications

ISBN

978-3-903035-18-8

ISSN

—

e-ISSN

neuvedeno

Počet stran výsledku

16

Strana od-do

211-226

Název nakladatele

Oesterreichische Computer Gesellschaft

Místo vydání

Neuvedeno

Místo konání akce

Praha

Datum konání akce

17. 8. 2017

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—