@inproceedings{dyer-2019-depdist,
    title = "{D}ep{D}ist: Surface realization via regex and learned dependency-distance tolerance",
    author = "Dyer, William",
    editor = "Mille, Simon  and
      Belz, Anja  and
      Bohnet, Bernd  and
      Graham, Yvette  and
      Wanner, Leo",
    booktitle = "Proceedings of the 2nd Workshop on Multilingual Surface Realisation (MSR 2019)",
    month = nov,
    year = "2019",
    address = "Hong Kong, China",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/jlcl-multiple-ingestion/D19-6303/",
    doi = "10.18653/v1/D19-6303",
    pages = "25--34",
    abstract = "This paper describes a method of inflecting and linearizing a lemmatized dependency tree by: (1) determining a regular expression and substitution to describe each productive wordform rule; (2) learning the dependency distance tolerance for each head-dependent pair, resulting in an edge-weighted directed acyclic graph (DAG); and (3) topologically sorting the DAG into a surface realization based on edge weight. The method`s output for 11 languages across 18 treebanks is competitive with the other submissions to the Second Multilingual Surface Realization Shared Task (SR {\textquoteleft}19)."
}