%0 Conference Proceedings
%T Extended Partial Parsing for Lexicalized Tree Grammars
%A Lopez, Patrice
%Y Lavelli, Alberto
%Y Carroll, John
%Y Berwick, Robert C.
%Y Bunt, Harry C.
%Y Carpenter, Bob
%Y Church, Ken
%Y Johnson, Mark
%Y Joshi, Aravind
%Y Kaplan, Ronald
%Y Kay, Martin
%Y Lang, Bernard
%Y Lavie, Alon
%Y Nijholt, Anton
%Y Samuelsson, Christer
%Y Steedman, Mark
%Y Stock, Oliviero
%Y Tanaka, Hozumi
%Y Tomita, Masaru
%Y Uszkoreit, Hans
%Y Vijay-Shanker, K.
%Y Weir, David
%Y Wiren, Mats
%S Proceedings of the Sixth International Workshop on Parsing Technologies
%D 2000
%8 feb 23 25
%I Association for Computational Linguistics
%C Trento, Italy
%F lopez-2000-extended
%X 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.
%U https://aclanthology.org/2000.iwpt-1.17
%P 159-170