{"title":"ConlluEditor: a fully graphical editor for Universal dependencies treebank files","authors":"Johannes Heinecke","doi":"10.18653/v1/W19-8010","DOIUrl":"https://doi.org/10.18653/v1/W19-8010","url":null,"abstract":"In this paper we present the ConlluEditor annotation tool for manual annotation of files in CoNLL-U format, such as Universal Dependencies treebanks. Apart from providing a graphical editor for basic and enhanced dependencies, multi-token words, it also runs validation scripts to find potential errors. ConlluEditor uses a client-server architecture. It is freely-available under the 3-Clause BSD License.","PeriodicalId":294555,"journal":{"name":"Proceedings of the Third Workshop on Universal Dependencies (UDW, SyntaxFest 2019)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115536650","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Towards transferring Bulgarian Sentences with Elliptical Elements to Universal Dependencies: issues and strategies","authors":"P. Osenova, K. Simov","doi":"10.18653/v1/W19-8014","DOIUrl":"https://doi.org/10.18653/v1/W19-8014","url":null,"abstract":"The paper considers the problems in transferring the sentences with elliptical elements from the original BulTreeBank into the Universal Dependencies style. The similarities and differences between the original constituency annotation scheme and the target dependency one are outlined to show that the current UD scheme needs elaboration to capture more complex cases.","PeriodicalId":294555,"journal":{"name":"Proceedings of the Third Workshop on Universal Dependencies (UDW, SyntaxFest 2019)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128264666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"SyntaxFest 2019 Invited talk - Arguments and adjuncts","authors":"A. Przepiórkowski","doi":"10.18653/v1/w19-8001","DOIUrl":"https://doi.org/10.18653/v1/w19-8001","url":null,"abstract":"Linguists agree that the phrase “two hours” is an argument in “John only lost two hours” but an adjunct in “John only slept two hours”, and similarly for “well” in “John behaved well” (an argument) and “John played well” (an adjunct). While the argument/adjunct distinction is hardwired in major linguistic theories, Universal Dependencies eschews this dichotomy and replaces it with the core/non-core distinction. The aim of this talk is to add support to the UD approach by critically examinining the argument/adjunct distinction. I will suggest that not much progress has been made during the last 60 years, since Tesnière used three pairwise-incompatible criteria to distinguish arguments from adjuncts. This justifies doubts about the linguistic reality of this purported dichotomy. But – given that this distinction is built into the internal machinery and/or resulting representations of perhaps all popular linguistic theories – what would a linguistic theory not making such an argument–adjunct distinction look like? I will briefly sketch the main components of such an approach, based on ideas from diverse corners of linguistic and lexicographic theory and practice.","PeriodicalId":294555,"journal":{"name":"Proceedings of the Third Workshop on Universal Dependencies (UDW, SyntaxFest 2019)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115243373","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Emanuel Borges Völker, M. Wendt, Felix Hennig, Arne Köhn
{"title":"HDT-UD: A very large Universal Dependencies Treebank for German","authors":"Emanuel Borges Völker, M. Wendt, Felix Hennig, Arne Köhn","doi":"10.18653/v1/W19-8006","DOIUrl":"https://doi.org/10.18653/v1/W19-8006","url":null,"abstract":"We report on the conversion of the Hamburg Dependency Treebank (Foth et al., 2014) to Universal Dependencies. The HDT consists of more than 200.000 sentences annotated with dependency structure, making every attempt at manual conversion or manual post-processing extremely costly. The conversion employs an unranked tree transducer. This formalism allows to express transformation rules in a concise way, guarantees the well-formedness of the output and is predictable to the rule writers. Together with the release of a converted subset of the HDT spanning 3 million tokens, we release an interactive workbench for writing and refining tree transducer rules. Our conversion achieves a very high labeled accuracy with respect to a manually converted gold standard of 97.3%. Up to now, the conversion effort took about 1000 hours of work.","PeriodicalId":294555,"journal":{"name":"Proceedings of the Third Workshop on Universal Dependencies (UDW, SyntaxFest 2019)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134380790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Nested Coordination in Universal Dependencies","authors":"A. Przepiórkowski, Agnieszka Patejuk","doi":"10.18653/v1/W19-8007","DOIUrl":"https://doi.org/10.18653/v1/W19-8007","url":null,"abstract":"One principled problem with the UD approach to coordination known to the Universal Dependencies (UD; http://universaldependencies.org/; Nivre et al., 2016) community concerns nested – i.e. immediately embedded – coordination, as in:1 (1) Tom and Jerry and Scooby-Doo There are three possible ways to structure (1): (2) Tom and Jerry and Scooby-Doo (3) [Tom and Jerry] and Scooby-Doo (4) Tom and [Jerry and Scooby-Doo] That is, (1) may be construed as flat ternary coordination (cf. (2)), or as binary coordination whose first (cf. (3)) or second (cf. (4)) conjunct is itself a coordinate structure. UD is not able to distinguish the first two structures, (2)–(3) – it assigns the same representation (5) to both, while representing (4) as (6):","PeriodicalId":294555,"journal":{"name":"Proceedings of the Third Workshop on Universal Dependencies (UDW, SyntaxFest 2019)","volume":"288 1-2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116858957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Rediscovering Greenberg’s Word Order Universals in UD","authors":"Kim Gerdes, Sylvain Kahane, Xinying Chen","doi":"10.18653/v1/W19-8015","DOIUrl":"https://doi.org/10.18653/v1/W19-8015","url":null,"abstract":"This paper discusses an empirical refoundation of selected Greenbergian word order universals based on a data analysis of the Universal Dependencies project. The nature of the data we work on allows us to extract rich details for testing well-known typological universals and constitutes therefore a valuable basis for validating Greenberg’s universals. Our results show that we can refine some Greenbergian universals in a more empirical and accurate way by means of a data-driven typological analysis.","PeriodicalId":294555,"journal":{"name":"Proceedings of the Third Workshop on Universal Dependencies (UDW, SyntaxFest 2019)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125070395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}