Abstract

AbstractIn the first part of this book, we have looked at formal properties of individual dependency structures. In this chapter, we turn our attention to sets of such structures, or dependency languages. Specifically, we investigate the languages that arise when we equip dependency structures with a ‘regular’ means of syntactic composition.We start by defining regular dependency languages as the recognizable subsets in dependency algebras and provide natural notions of automata and grammars for this class of languages (Section 7.1).We then develop a powerful pumping lemma for regular dependency languages (Section 7.2) and apply it to show that the languages in this class are of constant growth, a property characteristic for mildly context-sensitive languages (Section 7.3).

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 call

Disclaimer: 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.