Type-driven semantic interpretation and feature dependencies in R-LFG
<|reference_start|>Type-driven semantic interpretation and feature dependencies in R-LFG: Once one has enriched LFG's formal machinery with the linear logic mechanisms needed for semantic interpretation as proposed by Dalrymple et. al., it is natural to ask whether these make any existing components of LFG redundant. As Dalrymple and her colleagues note, LFG's f-structure completeness and coherence constraints fall out as a by-product of the linear logic machinery they propose for semantic interpretation, thus making those f-structure mechanisms redundant. Given that linear logic machinery or something like it is independently needed for semantic interpretation, it seems reasonable to explore the extent to which it is capable of handling feature structure constraints as well.   R-LFG represents the extreme position that all linguistically required feature structure dependencies can be captured by the resource-accounting machinery of a linear or similiar logic independently needed for semantic interpretation, making LFG's unification machinery redundant. The goal is to show that LFG linguistic analyses can be expressed as clearly and perspicuously using the smaller set of mechanisms of R-LFG as they can using the much larger set of unification-based mechanisms in LFG: if this is the case then we will have shown that positing these extra f-structure mechanisms is not linguistically warranted.<|reference_end|>
@article{johnson1997type-driven,
    title={Type-driven semantic interpretation and feature dependencies in R-LFG},
    author={Mark Johnson (Brown University)},
    journal={arXiv preprint arXiv:cmp-lg/9711014},
    year={1997},
    archivePrefix={arXiv},
    eprint={cmp-lg/9711014},
    primaryClass={cmp-lg cs.CL}
}