Paper: On The Portability Of Complex Constraint-Based Grammars

ACL ID C94-2145
Title On The Portability Of Complex Constraint-Based Grammars
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1994
Authors

In fact in TFS relational constructs actually take the form of types with features expressing their argument structure, although a relational notation is provided to sweeten the syntax slightly. Since definite relations occur in each of the formalisms, their translation does not pose any immediate problems, and many of their usages are the same, e.g. accounting for relational dependencies and principles in llPSG-style grammars, cf Figure 3. Difficulties do however occur where the usage of relational constructs is restricted. ALE imposes the restriction that true definite relations may only be used in the phrasal domain, attached to phrase structure rules. On first impression, this could pose a serious problem for translations from other formalisms where relations may be used freely in the ...