G otz, T. & Meurers, W. D., 1995. Compiling HPSG Type Constraints into Definite Clause Programs. In Proceedings of the 33nd Annual Meeting of the Association for Computational Linguistics (ACL 95). Cambridge, MA: MIT, pp. 85--91. http://ling.osu.edu/dm/papers/acl95.html. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On expressing lexical generalizations in HPSG - Meurers Self-citation (Meurers) (Correct)
....of meta regime which (s)he follows in writing the grammar, but it does not follow from anything in the grammar itself. 3 That no generalization in a theoretically 1 On the computational side, the idea to express macros just like other kinds of relations is incorporated in the ConTroll system (G otz Meurers 1995, 1997a,b) To be efficient this requires a dedicated computational treatment of deterministic relations. 2 That a meta level is involved here is clearly expressed in the discussion of descriptive adequacy, where Chomsky (1965:24) states that a linguistic theory must contain a definition of ....
G otz, T. & Meurers, W. D., 1995. Compiling HPSG Type Constraints into Definite Clause Programs. In Proceedings of the 33nd Annual Meeting of the Association for Computational Linguistics (ACL 95). Cambridge, MA: MIT, pp. 85--91. http://ling.osu.edu/dm/papers/acl95.html.
The importance of being lazy - Using lazy evaluation to.. - Götz, Meurers (1996) Self-citation (Meurers) (Correct)
....are satisfied. For the example of walked above this means that no agreement information is provided in the answer if there are no grammar constraints on the agreement features of that lexical entry. Computational approaches implementing this approach are, for example, the compiler described in G otz and Meurers (1995) or the WildLIFE system (Ait Kaci et al. 1994) The authors are listed alphabetically. The research reported here was sponsored by Teilprojekt b4 From Constraints to Rules: Efficient Compilation of hpsg Grammars of SFB 340 funded by the Deutsche Forschungsgemeinschaft. We would like to thank ....
....there is a solution. This means that our on line proof strategy is exactly identical to the non lazy case, but it needs to do less work. Lazy compilation can quite easily be integrated, e.g. into the compilation method translating hpsg theories into definite clause programs described in G otz and Meurers (1995). In the next section we discuss a small hpsg example to illustrate this. Theoretically, on the other hand, lazy evaluation changes our perspective on program semantics. Whereas the programs previously had the property of persistence (any term subsumed by a solution was also a solution) the ....
[Article contains additional citation context not shown here]
G otz, T. (in preparation). The ConTroll Guide and User's Manual. Seminar f ur Sprachwissenschaft, Universit at T ubingen. G otz, T. and W. D. Meurers (1995). Compiling HPSG type constraints into definite clause programs.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC