Control in Functional Unification Grammars for Text Generation
نویسندگان
چکیده
Standard Functional Unification Grammars (FUGs) provide a structurally guided top-down control regime for text generation that is not appropriate for handling non-structural and dynamic constraints. We introduce two control tools that we have implemented for FUGs to address these limitations: bk-class, a tool to limit search by using a form of dependency-directed backtracking and external, a co-routine mechanism allowing a FUG to cooperate with dynamic constraint sources. We show how these tools complement the top-down regime of FUGs to enhance lexical choice. presses disjunction in FUG. The value of the alt
منابع مشابه
Types in Functional Unification Grammars
In this paper, we present several extensions to the FU formalism that address these limitations. These extensions are based on the formal semantics Functional Unification Grammars (FUGs) are presented in (Elhadad, 1990). They have been impopular for natural language applications because the plemented and tested on several applications. formalism uses very few primitives and is uniform and expre...
متن کاملAn experimental parser for syntemic grammars
We descrlbe a general parsing m e t h o d for systemic grammars. Systemic grammars contain a paradigmatic analysis of language in addition to structural information, so a parser must assign a set o f grammatical features and functions to each constituent in addition to producing a constituent structure. Our method constructs a parser by compiling systemic grammars into the notation of Functiona...
متن کاملOn the Universal Generation Problem for Unification Grammars
The universal generation problem for unification grammars is the problem of determining whether a given grammar derives any terminal string with a given feature structure. It is known that the problem is decidable for LFG and PATR grammars if only acyclic feature structures are taken into consideration. In this brief note, we show that the problem is undecidable for cyclic structures. This hold...
متن کاملAn Open-Source Environment for Compiling Typed Unification Grammars into Speech Recognisers
We present REGULUS, an Open Source environment which compiles typed unification grammars into context free grammar language models compatible with the Nuance Toolkit. The environment includes a large general unification grammar of English and corpus-based tools for creating efficient domainspecific recognisers from it. We will demo applications built using the system, including a speech transla...
متن کاملLearning unification-based natural language grammars
Practical text processing systems need wide covering grammars. When parsing unrestricted language, such grammars often fail to generate all of the sentences that humans would judge to be grammatical. This problem undermines successful parsing of the text and is known as undergeneration. There are two main ways of dealing with undergeneration: either by sentence correction, or by grammar correct...
متن کامل