Predicative LTAG grammars for Term Analysis.
Patrice Lopez, David Roussel · 2000
In a restricted domain and task, we propose that the elementary tree backbones represent statically the predicative level and the possible distribution of arguments while the syntactic categories and constraints would be only processed dynamically by the way of features. The resulting grammar can be viewed as an intermediate level between the surface syntax of a sentence and its conceptual representation. In addition to possible speed efficiency and robustness relevance, an interesting property is that such a grammar could be tested in a straightforward way to integrate contraints provided by additional trees and to inject progressively semantic and pragmatic constraints during the analysis.