Difference: PyniniOperatorsDoc (4 vs. 5)

Revision 52019-08-11 - KyleGorman

Line: 1 to 1
 

Specialty operators

This describes specialty FST functions for grammar compilation.

Line: 69 to 69
  where sigma_star represents the closure over the alphabet.
Changed:
<
<

fst::Repeat

>
>

fst::ConcatRange

 
Changed:
<
<
The repeat operation is a generalization of
>
>
The range-based concatenation operation is a generalization of
 closure. A path through the closure of an FST A is valid if it can be generated by taking zero or more paths through A.
Changed:
<
<
The first argument to fst::Repeat represents a lower bound on the number
>
>
The first argument to fst::ConcatRange represents a lower bound on the number
 of paths through the input FST required to form a valid path in the output FST. The second argument represents the upper bound on the number of paths through the input FST; by convention, 0 is used to indicate an infinite upper bound.
 
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