EXPRESSING PROBABILISTIC CONTEXT-FREE GRAMMARS IN THE RELAXED UNIFICATION FORMALISM

摘要

The Theory of Relaxed Unification is a newly proposed theory that extends the power of classical unification. The theory relaxes the rigid constraints of requiring a perfect match between the terms being unified to allow multi-valued attributes. The Relaxed Unification Inference System is an implementation of an inference engine and an interpreter, which uses the relaxed unification mechanism in resolving the rules. We give an overview of the System's capabilities and demonstrate how it can be used to express Probabilistic Context-Free Grammars.