✦ LIBER ✦

AUTOMATICALLY GENERATING TREE ADJOINING GRAMMARS FROM ABSTRACT SPECIFICATIONS

✍ Scribed by Fei Xia; Martha Palmer; K. Vijay-Shanker

Book ID: 110983957
Publisher: John Wiley and Sons
Year: 2005
Tongue: English
Weight: 504 KB
Volume: 21
Category: Article
ISSN: 0824-7935
DOI: 10.1111/j.1467-8640.2005.00273.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generation and synchronous tree-adjoinin

Generation and synchronous tree-adjoining grammars

✍ Stuart M. Shieber; Yves Schabes 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 889 KB

Automatically generating SL parsers from

Automatically generating SL parsers from LL(1) grammars

✍ David T. Barnard; James R. Cordy 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 412 KB

TOWARD AN INTEGRATED GENERATION APPROACH

TOWARD AN INTEGRATED GENERATION APPROACH WITH TREE-ADJOINING GRAMMARS

✍ Karin Harbusch 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 994 KB

RESTRICTING THE WEAK-GENERATIVE CAPACITY

RESTRICTING THE WEAK-GENERATIVE CAPACITY OF SYNCHRONOUS TREE-ADJOINING GRAMMARS

✍ Stuart M. Shieber 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 856 KB

A SEMANTIC HEAD-DRIVEN GENERATION SYSTEM

A SEMANTIC HEAD-DRIVEN GENERATION SYSTEM FOR FEATURE STRUCTURE TREE-ADJOINING GRAMMARS

✍ Gen-ichiro Kikui1 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 687 KB

A general scheme for automatic generatio

A general scheme for automatic generation of search heuristics from specification dependencies

✍ Kalev Kask; Rina Dechter 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 396 KB

The paper presents and evaluates the power of a new scheme that generates search heuristics mechanically for problems expressed using a set of functions or relations over a finite set of variables. The heuristics are extracted from a parameterized approximation scheme called Mini-Bucket elimination