tailieunhanh - Báo cáo khoa học: "An expressive formalism for describing tree-based grammars"

In this paper1 we introduce eXtensible MetaGrammar, a system that facilitates the development of tree based grammars. This system includes both (1) a formal language adapted to the description of linguistic information and (2) a compiler for this language. It applies techniques of logic programming (. Warren’s Abstract Machine), thus providing an efficient and theoretically motivated framework for the processing of linguistic metadescriptions. | XMG - An expressive formalism for describing tree-based grammars Yannick Parmentier INRIA LORIA Joseph Le Roux LORIA Benoit Crabbe HCRC ICCS Universite Henri Poincare 615 Rue du Jardin Botanique 54 600 Villers-Les-Nancy France parmenti@ Institut National Polytechnique de Lorraine 615 Rue du Jardin Botanique 54 600 Villers-Les-Nancy France University of Edinburgh 2 Buccleuch Place EH8 9LW Edinburgh Scotland bcrabbe@ leroux@ Abstract In this paper1 we introduce extensible MetaGrammar a system that facilitates the development of tree based grammars. This system includes both 1 a formal language adapted to the description of linguistic information and 2 a compiler for this language. It applies techniques of logic programming . Warren s Abstract Machine thus providing an efficient and theoretically motivated framework for the processing of linguistic metadescriptions. 1 Introduction It is well known that grammar engineering is a complex task and that factorizing grammar information is crucial for the rapid development the maintenance and the debugging of large scale grammars. While much work has been deployed into producing such factorizing environments for standard unification grammars less attention has been paid to the issue of developing such environments for tree based grammars that is grammars like Tree Adjoining Grammars TAG or Tree Description Grammars where the basic unit of information is a tree rather than a category encoded in a feature structure. For these grammars two trends have emerged to automatize tree-based grammar production systems based on lexical rules see Becker 2000 and systems based on combination of classes also called metagrammar systems see Candito 1999 Gaffe et al. 2002 . 1We are grateful to Claire Gardent for useful comments on this work. This work is partially supported by an INRIA grant. In this paper we present a metagrammar system for tree-based grammars which differs from comparable existing approaches .

TỪ KHÓA LIÊN QUAN
crossorigin="anonymous">
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.