✦ LIBER ✦

A sentence generator for testing parsers

✍ Scribed by Paul Purdom

Publisher: Springer Netherlands
Year: 1972
Tongue: English
Weight: 685 KB
Volume: 12
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01932308

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ P. Purdom 📂 Article 📅 1972 🏛 Springer Netherlands 🌐 English ⚖ 37 KB

Taggers for parsers

✍ E. Charniak; G. Caroll; J. Adcock; A. Cassandra; Y. Gotoh; J. Katz; M. Littman; 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 90 KB

We consider what tagging models are most appropriate as front ends for probabilistic context-free grammar parsers. In particular, we ask if using a "multiple tagger", a tagger that returns more than one tag, improves parsing performance. Our conclusion is somewhat surprising: single-tag Markov-mode

A stand for testing acetylene generator

A stand for testing acetylene generator diaphragms

✍ V. V. Kolotushkin; V. Ya. Govorov 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 195 KB

Custom pulse generator for RPC testing

✍ A. Gil; E. Castro; J. Díaz; P. Fonte; J.A. Garzón; N. Montes; M. Zapata 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 968 KB

Big — A binary generator for testing dig

Big — A binary generator for testing digital devices

✍ Massimo Annunziata; Walter Bragagnini; Paolo Guazzoni; Giacomo Sechi; Gianfranco 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 443 KB

An algorithm for inversing a unification

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

✍ Tomek Strzalkowski 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 338 KB

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 comput