de.up.ling.irtg.binarization

Class BinarizingAlgebraSeed

java.lang.Object

de.up.ling.irtg.binarization.RegularSeed

de.up.ling.irtg.binarization.BinarizingAlgebraSeed

public class BinarizingAlgebraSeed
extends RegularSeed

A regular seed that binarizes into a BinarizingAlgebra. It maps, for instance, terms f(t1,t2,t3) into terms f(@(@(t1,t2),t3)) and f(@(t1,@(t2,t3))). These are binary terms (f is unary, @ is a binary symbol), and the binarizing algebra will evaluate them to the same value to which the original algebra would have evaluated f(t1,t2,t3).

Author:

koller

Constructor Summary

Constructors

Constructor and Description
BinarizingAlgebraSeed() This is only for technical reasons; don't use this constructor! Use #StringAlgebraSeed(de.up.ling.irtg.signature.Signature, java.lang.String) instead.
BinarizingAlgebraSeed(Algebra sourceAlgebra, Algebra targetAlgebra)

Method Summary

Modifier and Type	Method and Description
TreeAutomaton<String>	binarize(String symbol) Computes an automaton for all binarizations of a given symbol.

Methods inherited from class de.up.ling.irtg.binarization.RegularSeed

binarize, getAllRegularSeedClasses, printStats

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

BinarizingAlgebraSeed

public BinarizingAlgebraSeed()

This is only for technical reasons; don't use this constructor! Use #StringAlgebraSeed(de.up.ling.irtg.signature.Signature, java.lang.String) instead.

BinarizingAlgebraSeed

public BinarizingAlgebraSeed(Algebra sourceAlgebra,
                             Algebra targetAlgebra)

Method Detail

binarize

public TreeAutomaton<String> binarize(String symbol)

Description copied from class: RegularSeed

Computes an automaton for all binarizations of a given symbol. If f is a k-place symbol, then each binarization is a term that contains each variable symbol ?1, ..., ?k exactly once. The intended use of these automata is that every term accepted by the automaton evaluates to the same function over some given algebra as the original k-place symbol (but expresses this function using symbols of lower arity).

The automaton returned by this method must satisfy a number of requirements.

• The automaton has exactly one final state.
• There is no state that expands both into a variable (i.e. there is a rule q -> ?i) and into a terminal symbol (i.e. there is a rule q -> f(q1,...,qn) where f is not of the form ?i).

Specified by:

binarize in class RegularSeed

Returns: