TY  -  
T1  - Transition-Based Coding and Formal Language Theory for Ordered Digraphs 
SN  -  /  
UR  - http://hdl.handle.net/10138/306880 
T3  - Proceedings of the International Conference on Finite-State Methods and Natural Language Processing 
A1  - Yli-Jyrä, Anssi 
A2  - Vogler, Heiko; Maletti, Andreas 
PB  - The Association for Computational Linguistics 
Y1  - 2019 
LA  - eng 
AB  - Transition-based parsing of natural language uses transition systems to build directed annotation graphs (digraphs) for sentences. In this paper, we define, for an arbitrary ordered digraph, a unique decomposition and a corresponding linear encoding that are associated bijectively with each other via a new transition system. These results give us an efficient and succinct representation for digraphs and sets of digraphs. Based on the system and our analysis of its syntactic properties, we give s... 
VO  -  
IS  -  
SP  -  
OP  -  
KW  - 113 Computer and information sciences; graph representation; encoding; siirtymäjärjestelmöt; 6121 Languages; dependency syntax 
N1  -   
PP  -  
ER  -