| Thilo Goetz and Walt Detmar Meurers. 1995. Compiling HPSG type constraints into definite clause programs. In ACL-95. |
....to compile the multiple inheritance out of the type hierarchy and then term encode a semantically equivalent grammar. In this approach, multiple inheritance exists as a convenience to the grammar writer, but is not actually used at run time. 1 Other more complex constraints can be compiled out [13]. So a system that only uses appropriateness conditions is more general than it might first appear. 2 See Pollard Sag [20] p. 21 : a feature structure can be taken as a partial description of any of the well typed (or totally well typed, or totally well typed and sort resolved) feature ....
Thilo Gotz and Walt Detmar Meurers. Compiling hpsg type constraints into definite clause programs. In Proceedings of the Thrirty-Third Annual Meeting of the ACL, Boston, USA, 1995. ACL.
....with this problem is the very active area of grammar migration the automatic compilation of grammar resources implemented in a particular NLP system to another NLP system or programming language. One can find migration programs from hpsg style grammars into relational programming languages ( Goetz and Meurers, 1995 ] from open world systems into closed world systems ( Gerdemann, 1995 ] and from hpsg grammars to tag (see [ Kasper et al. 1995 ] This paper is another contribution to the current discussion in grammar migration. It discusses the transformation of systemic grammar into currently ....
Thilo Goetz and Walt Detmar Meurers. Compiling hpsg type constraints into definite clause programs. In Proceedings of ACL-95, 1995.
....underspecified, the grammar does contain enough constraining information it just needs to be moved to guide processing. Constraint propagation also makes it possible to advance automatically generated encodings, such as, for example, the definite clause encoding of hpsg grammars introduced in Gotz and Meurers (1995). Constraint propagation can be performed on line as in Le Provost and Wallace (1993) or it can be used to make programs more specific through off line compilation as in Marriott, Naish, and Lassez (1988) In this paper we will focus on the off line application of constraint propagation. While ....
....values of the phonology feature are hidden away deep in the covariation encoding of the lexical entries that can be derived from the base lexical entry. 5 Implementation Results The depth bounded constraint propagation method was implemented for the ConTroll system (Gerdemann and King, 1994; Gotz and Meurers, 1995 and 1996) under Prolog. Test results on a complex grammar implementing an analysis of partial vp topicalization in German (Hinrichs, Meurers, and Nakazawa, 1994) show that constraint propagation significantly improves parsing with a covariation encoding of lexical rules. For the lexica produced ....
Gotz, Thilo and Detmar Meurers. 1995. Compiling hpsg Type Constraints into Definite Clause Programs.
No context found.
Thilo Goetz and Walt Detmar Meurers. 1995. Compiling HPSG type constraints into definite clause programs. In ACL-95.
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