重新发现格林伯格在UD中的语序共性

Proceedings of the Third Workshop on Universal Dependencies (UDW, SyntaxFest 2019) Pub Date : 1900-01-01 DOI:10.18653/v1/W19-8015

Kim Gerdes, Sylvain Kahane, Xinying Chen

{"title":"重新发现格林伯格在UD中的语序共性","authors":"Kim Gerdes, Sylvain Kahane, Xinying Chen","doi":"10.18653/v1/W19-8015","DOIUrl":null,"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.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Rediscovering Greenberg’s Word Order Universals in UD\",\"authors\":\"Kim Gerdes, Sylvain Kahane, Xinying Chen\",\"doi\":\"10.18653/v1/W19-8015\",\"DOIUrl\":null,\"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.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Third Workshop on Universal Dependencies (UDW, SyntaxFest 2019)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18653/v1/W19-8015\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Third Workshop on Universal Dependencies (UDW, SyntaxFest 2019)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18653/v1/W19-8015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

本文基于普遍依赖项目的数据分析，讨论了对选定的格林伯格语序共相的实证重构。我们研究的数据的性质使我们能够提取丰富的细节来测试众所周知的类型共相，因此构成了验证格林伯格共相的有价值的基础。我们的研究结果表明，通过数据驱动的类型学分析，我们可以以更经验和准确的方式提炼一些格林伯格共相。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Rediscovering Greenberg’s Word Order Universals in UD

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the Third Workshop on Universal Dependencies (UDW, SyntaxFest 2019)

自引率

0.00%

发文量