Backlinks to ComposeDoc in all Webs (Search FST Web only)

Results from FST web retrieved at 09:24 (GMT)

Difference Description This operation computes the difference between two FSAs. Only strings that are in the first automaton but not in second are retained in the...
OpenFst Advanced Usage Below are a variety of topics covered in greater depth or of more specialized interest than found in the Quick Tour. Reading the Quick...
Efficiency By reading the Quick Tour and Conventions and working through the examples, users typically can create correct implementations of applications. What...
OpenFst Examples Reading the quick tour first is recommended. That includes a simple example of FST application using either the C template level or the shell...
OpenFst Quick Tour Below is a brief tutorial on the OpenFst library. After reading this, you may wish to browse the Advanced Usage topic for greater detail...
Intersect Description This operation computes the intersection (Hadamard product) of two FSAs. Only strings that are in both automata are retained in the result...
Multi Pushdown Transducer Library (MPDTs) The multi pushdown transducer (MPDT) extension extends the Transducer Library extension to allow for multiple stacks. As...
Pushdown Transducer Library (PDTs) This is a push down transducer (PDT) extension of the OpenFst library. A PDT is encoded as an FST, where some transitions are labeled...
Last Published Publisher CyrilAllauzen Date 30 Apr 2009 19:29 {PublishContrib}{Dir} /var/www/twiki/pub/publish/ {PublishContrib}{URL} http://mohri lt.cs.nyu...
OpenFst Python extension This extension exposes the OpenFst scripting API to Python. Like the scripting API, it supports arbitrary arcs and weights. The extension...
OpenFst Library OpenFst version 1.7.3 is now available for download. OpenFst is a library for constructing, combining, optimizing, and searching weighted finite...
Statistics for FST Web Month: Topic views: Topic saves: File uploads: Most popular topic views: Top contributors for topic save and...
Number of topics: 12

Results from Forum web retrieved at 09:24 (GMT)

OpenFst Forum 2009 Archive Finding n shortest paths NewUser 29 Dec 2009 16:44 I was wondering what is the best way to go about finding n shortest paths in...
Number of topics: 1

Results from GRM web retrieved at 09:24 (GMT)

Pynini: Grammar compilation in Python ,ggggggggggg, dP```88``````Y8, Yb, 88 `8b `` 88 ,8P gg...
Number of topics: 1

 
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