Extended partial parsing for lexicalized tree grammars
P Lopez - Proceedings of the Sixth International Workshop on …, 2000 - aclanthology.org
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 …
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 …
以上显示的是最相近的搜索结果。 查看全部搜索结果