Abstract
By means of a factorization of linear precedence (LP) information in tree‐adjoining grammar (TAG), the possibility to capture syntactic generalizations can be enhanced, especially with respect to languages which exhibit relative free word‐order. In TAG(LD/LP) LP‐information is factorized in a way reminiscent of the ID/LP format of CFGs. However, in contrast to its context‐free counterpart, in TAG(LD/LP) entanglement of constituents is allowed by admitting not only the permutation of sister nodes, but also of non‐sister nodes in a structural description. In this paper a generalization of the predictive left‐to‐right parser for TAG is presented which is able to handle a restricted variant of TAG(LD/LP), which allows the permutation of sister nodes and non‐sister nodes within elementary structures, the basic building blocks of TAG(LD/LP).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
