@inproceedings{lopez-2000-extended,
    title = "Extended Partial Parsing for Lexicalized Tree Grammars",
    author = "Lopez, Patrice",
    editor = "Lavelli, Alberto  and
      Carroll, John  and
      Berwick, Robert C.  and
      Bunt, Harry C.  and
      Carpenter, Bob  and
      Carroll, John  and
      Church, Ken  and
      Johnson, Mark  and
      Joshi, Aravind  and
      Kaplan, Ronald  and
      Kay, Martin  and
      Lang, Bernard  and
      Lavie, Alon  and
      Nijholt, Anton  and
      Samuelsson, Christer  and
      Steedman, Mark  and
      Stock, Oliviero  and
      Tanaka, Hozumi  and
      Tomita, Masaru  and
      Uszkoreit, Hans  and
      Vijay-Shanker, K.  and
      Weir, David  and
      Wiren, Mats",
    booktitle = "Proceedings of the Sixth International Workshop on Parsing Technologies",
    month = feb # " 23-25",
    year = "2000",
    address = "Trento, Italy",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/fix-sig-urls/2000.iwpt-1.17/",
    pages = "159--170",
    abstract = "Existing parsing algorithms for Lexicalized Tree Grammars (LTG) formalisms (LTAG, TIG, DTG, ... ) are adaptations of algorithms initially dedicated to Context Free Grammars (CFG). They do not really take into account the fact that we do not use context free rules but partial parsing trees that we try to combine. Moreover the lexicalization raises up the important problem of multiplication of structures, a problem which does not exist in CFG. This paper presents parsing techniques for LTG taking into account these two fundamental features. Our approach focuses on robust and pratical purposes. Our parsing algorithm results in more extended partial parsing when the global parsing fails and in an interesting average complexity compared with others bottom-up algorithms."
}