Difference: PyniniOperatorsDoc (2 vs. 3)

Revision 32018-03-03 - KyleGorman

Line: 1 to 1
 

Specialty operators

This describes specialty FST functions for grammar compilation.

Deleted:
<
<

fst::Containment

The containment (Beesley & Karttunen 2003: 48f.) of a relation A (with respect to some alphabet) is the union of all relations that contain some path through A. We can implement this in Thrax as follows:

func Containment[A, sigma_star] {
  return sigma_star A sigma_star;
}

where sigma_star represents the closure over the alphabet.

If A is a transducer, than its containment can be thought of as a single unconditioned rewrite operation. The fst::CDRewrite function is a generalization of this rewriting operation which permits repeated rewrites and conditional restrictions.

 

fst::CrossProduct

Line: 111 to 91
 

References

Deleted:
<
<
Beesley, K. R., and Karttunen, L. 2003. Finite state morphology. Stanford, CA: CSLI.
 Karttunen, L. 1998. The proper treatment of Optimality Theory in computational phonology. In Proc. FSMNLP, 1-12.
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2019 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback