Line: 1 to 1 | ||||||||
---|---|---|---|---|---|---|---|---|

## Specialty operatorsThis describes specialty FST functions for grammar compilation. | ||||||||

Line: 69 to 69 | ||||||||

where `sigma_star` represents the closure over the alphabet. | ||||||||

Changed: | ||||||||

< < |
## | |||||||

> > |
## | |||||||

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. |

View topic | History: r5 < r4 < r3 < r2 | More topic actions...

Copyright © 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

Ideas, requests, problems regarding TWiki? Send feedback