Till sidans topp

Sidansvarig: Webbredaktion
Sidan uppdaterades: 2012-09-11 15:12

Tipsa en vän

From Universal Dependenci… - Göteborgs universitet Till startsida
Till innehåll Läs mer om hur kakor används på gu.se

From Universal Dependencies to Abstract Syntax

Paper i proceeding
Författare Aarne Ranta
Kolachina Prasanth
Publicerad i Proceedings of the NoDaLiDa 2017 Workshop on Universal Dependencies (UDW 2017)
Publiceringsår 2017
Publicerad vid Institutionen för data- och informationsteknik (GU)
Språk en
Länkar https://www.aclweb.org/anthology/W1...
Ämnesord Universal Dependencies, Grammatical Framework, robust parsing
Ämneskategorier Datorlingvistik


Abstract syntax is a tectogrammatical tree representation, which can be shared between languages. It is used for programming languages in compilers, and has been adapted to natural languages in GF (Grammatical Framework). Recent work has shown how GF trees can be converted to UD trees, making it possible to generate parallel synthetic treebanks for those 30 languages that are currently covered by GF. This paper attempts to invert the mapping: take UD trees from standard treebanks and reconstruct GF trees from them. Such a conversion is potentially useful in bootstrapping treebanks by translation. It can also help GF-based interlingual translation by providing a robust, efficient front end. However, since UD trees are based on natural (as opposed to generated) data and built manually or by machine learning (as opposed to rules), the conversion is not trivial. This paper will present a basic algorithm, which is essentially based on inverting the GF to UD conversion. This method enables covering around 70% of nodes, and the rest can be covered by approximative back up strategies. Analysing the reasons of the incompleteness reveals structures missing in GF grammars, but also some problems in UD treebanks.

Sidansvarig: Webbredaktion|Sidan uppdaterades: 2012-09-11

På Göteborgs universitet använder vi kakor (cookies) för att webbplatsen ska fungera på ett bra sätt för dig. Genom att surfa vidare godkänner du att vi använder kakor.  Vad är kakor?