@inproceedings{becker-rambow-1995-parsing,
    title = "Parsing Non-Immediate Dominance Relations",
    author = "Becker, Tilman  and
      Rambow, Owen",
    editor = "Hajicova, Eva  and
      Lang, Bernard  and
      Berwick, Robert  and
      Bunt, Harry  and
      Carpenter, Bob  and
      Church, Ken  and
      Joshi, Aravind  and
      Kaplan, Ronald  and
      Kay, Martin  and
      Nagao, Makoto  and
      Nijholt, Anton  and
      Steedman, Mark  and
      Thompson, Henry  and
      Tomita, Masaru  and
      Vijay-Shanker, K.  and
      Wilks, Yorick  and
      Wittenburg, Kent",
    booktitle = "Proceedings of the Fourth International Workshop on Parsing Technologies",
    month = sep # " 20-24",
    year = "1995",
    address = "Prague and Karlovy Vary, Czech Republic",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/Author-page-Marten-During-lu/1995.iwpt-1.6/",
    pages = "26--33",
    abstract = "We present a new technique for parsing grammar formalisms that express non-immediate dominance relations by {\textquoteleft}dominance-links'. Dominance links have been introduced in various formalisms such as extensions to CFG and TAG in order to capture long-distance dependencies in free-word order languages (Becker et al., 1991; Rambow, 1994). We show how the addition of {\textquoteleft}link counters' to standard parsing algorithms such as CKY- and Earley-based methods for TAG results in a polynomial time complexity algorithm for parsing lexicalized V-TAG, a multi-component version of TAGs defined in (Rambow, 1994). A variant of this method has previously been applied to context-free grammar based formalisms such as UVG-DL."
}