@inproceedings{DakotaGilmanovLietal.2017,
  author    = {Daniel Dakota and Timur Gilmanov and Wen Li and Christopher Kuzma and Evgeny Kim and Noor Abo Mokh and Sandra K{\"u}bler},
  title     = {Do FreeWord Order Languages Need More Treebank Data? Investigating Dative Alternation in German, English, and Russian},
  series = {Proceedings of the 6th Workshop on Statistical Parsing of Morphologically Rich Languages (SPMRL 2015). July 23rd in Bilbao, Basque Country, Spain},
  editor    = {Marie Candito and Jinho Choi and Yannick Versley},
  url       = {https://nbn-resolving.org/urn:nbn:de:bsz:mh39-61847},
  pages     = {14 -- 20},
  year      = {2017},
  abstract  = {We investigate whether non-configurational languages, which display more word order variation than configurational ones, require more training data for a phenomenon to be parsed successfully. We perform a tightly controlled study comparing the dative alternation for English (a configurational language), German, and Russian (both non-configurational). More specifically, we compare the performance of a dependency parser when only canonical word order is present with its performance on data sets when all word orders are present. Our results show that for all languages, canonical data not only is easier to parse, but there exists no direct correspondence between the size of training sets containing free(er) word order variation and performance.},
  language  = {en}
}