๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An algorithm for inversing a unification parser into an efficient unification generator

โœ Scribed by Tomek Strzalkowski

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
338 KB
Volume
3
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

โœฆ Synopsis

An algorithm that inverses a unifkaticn parser written in FXOLOG into a generator for naNd language is presented. Some aspects of applicability of the algorithm arc discussed. ' MSEA'S of basic predicates, such as mncat. art assumed to k known apriori; MSEA'S for recunive predicates are first computed from non-recursive clauses. Automated inversion of unification parser into an e@cient generator for natural bnguage. In preparation.

๐Ÿ“œ SIMILAR VOLUMES

A New Efficient Algorithm for Embedding
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
โœ Volker Heun; Ernst W. Mayr ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 250 KB

The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making it desirable to simulate binary trees on a hypercube. In this paper, we present a simple one-to-one embedding of arbitrar

An Accurate and Efficient Algorithm for
An Accurate and Efficient Algorithm for the Computation of the Characteristic Polynomial of a General Square Matrix
โœ S. Rombouts; K. Heyde ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 99 KB

An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant quantum Monte-Carlo methods.