50 Recent Changes in FST Web retrieved at 05:16 (GMT)

Statistics for nop FST Web Month: Topic views: Topic saves: File uploads: Most popular topic views: Top contributors for topic save and ...
Map Description This operation transforms each arc and final state in the input FST. The transformation is specified by a function object called a mapper . For ...
nop OpenFst Background Material The following material is provided as background reading about finite state transducers. However, it is not necessary to read this ...
nop FST Web Preferences The following settings are web preferences of the FST web. These preferences overwrite the site level preferences in . and ...
OpenFst Download Latest release (Version 1.1) download: openfst 1.1.tar.gz From the release: list README ( includes system requirements; installation and ...
OpenFst Library OpenFst is a library for constructing, combining, optimizing, and searching weighted finite state transducers (FSTs). Weighted finite state transducers ...
nop OpenFst Tutorial Part 0: Introduction Part 1: Algorithms Part 2: Library Use and Design Part 3: Applications Presented at HLT/NAACL 2009 in ...
nop OpenFst Authors Principal Contacts: Cyril Allauzen allauzen AT google.com Michael Riley riley AT google.com Contributors: Boulos Harb harb ...
Last Published Publisher CyrilAllauzen Date 30 Apr 2009 19:29 {PublishContrib}{Dir} /var/www/twiki/pub/publish/ {PublishContrib}{URL} http://mohri lt.cs.nyu ...
Synchronize Description This operation synchronizes a transducer. The result will be an equivalent FST that has the property that during the traversal of a path, ...
RmEpsilon Description This operation removes epsilon transitions (when both the input and output label are an epsilon) from a transducer. The result will be an equivalent ...
Encode/Decode Description The Encode operation allows the representation of a weighted transducer as a weighted automaton, an unweighted transducer or an unweighted ...
nop OpenFst Quick Tour Below is a brief tutorial on the nop OpenFst library. After reading this, you may wish to browse the Advanced Usage topic for greater detail ...
Minimize Description This operation performs the minimization of deterministic weighted automata and transducers. If the input FST A is an automaton (acceptor) ...
RandEquivalent Description This operation test is two FSTs are equivalent by randomly generating N paths alternatively in each of the two FSTs. For each randomly ...
RandGen Description This operation randomly generates a set of successful paths in the input FST. The operation relies on an ArcSelector object for randomly selecting ...
Relabel Description This operation relabels the input and/or output labels of an FST. The input and/or output relabeling are specified by providing the corresponding ...
nop 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 Tour ...
OpenFst README OpenFst Release 1.1 OpenFst is a library for constructing, combining, optimizing, and searching weighted finite state transducers (FSTs). REQUIREMENTS ...
Compilation on MacOS X Versions 1.0 and later of the OpenFst library cannot be compiled on MacOS X (10.4 Tiger or 10.5 Leopard) using Apple Xcode version of gcc. The ...
OpenFst INSTALL html version Installation Instructions Copyright (C) 1994, 1995, 1996, 1999, 2000, 2001, 2002, 2004, 2005, 2006, 2007 Free ...
OpenFst COPYING Licensed under the Apache License, Version 2.0 (the "License"); you may not use these files except in compliance with the License. You may obtain a ...
nop OpenFst Conventions The nop OpenFst Libary has various conventions and assumptions about its objects and coding style. Object Conventions 1. The StateIds ...
TWikiGuest example #64;your.company .WebChangesAlert, ., .TWikiRegistration
OpenFst Glossary #AcceptorDef $ acceptor : An acceptor is a finite automaton where each transition has a label and possibly a weight. In this library, an acceptor ...
Determinize Description This operation determinizes a weighted transducer. The result will be an equivalent FST that has the property that no state has two transitions ...
Replace Description This operation performs the dynamic replacement of arcs in one FST with another FST, allowing the definition of FSTs analogous to RTNs. It takes ...
FST Weight Requirements A semiring is specified by two binary operations and and two designated elements 0 and 1 with the following properties: : associative ...
Compose Description This operation computes the composition of two transducers. If A transduces string x to y with weight a and B transduces y to z ...
Union Description This operation computes the union ( sum ) of two FSTs. If A transduces string x to y with weight a and B transduces string w to v ...
EpsNormalize Description Returns an equivalent FST that is epsilon normalized. An acceptor is epsilon normalized if it is epsilon removed. A transducer is input epsilon ...
Project Description This operation projects an FST onto its domain or range by either copying each arc's input label to its output label or vice versa. Usage enum ...
Intersect Description This operation computes the intersection (Hadamard product) of two FSAs. Only strings that are in both automata are retained in the result ...
Closure Description This operation computes the concatenative closure. If A transduces string x to y with weight a , then the closure transduces x to y ...
ArcSort Description This operation sorts the arcs in an FST per state. At the C level, the sort order is determined by a function object compare of type Compare ...
Concat Description This operation computes the concatenation ( product ) of two FSTs. If A transduces string x to y with weight a and B transduces string ...
Equivalent Description This operations determines if two epsilon free deterministic weighted acceptors are equivalent. Usage template bool Equivalent(const ...
ShortestPath Description This operation produces an FST containing the n shortest paths in the input FST. The n shortest paths are the n lowest weight paths ...
Reverse Description This operation reverses an FST. If A transduces string x to y with weight a , then the reverse of A transduces the reverse of x to ...
Verify Description This operation checks the sanity of a FST's contents. It returns false if the transducer is incomplete or ill formed (e.g., a non trivial FST ...
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 ...
FST Bib Entry @InProceedings{openfst, author {Cyril Allauzen and Michael Riley and Johan Schalkwyk and Wojciech Skut and Mehryar Mohri}, title ...
Push Description This operation produces an equivalent transducer by pushing the weights and/or the labels towards the initial state or toward the final states. ...
Reweight Description This operation reweights an FST according to the potentials and in the direction specified by the user. An arc of weight w , with an origin ...
ShortestDistance Description This operation computes the shortest distance from the initial state to every state (when reverse is false ) or from every state to ...
Prune Description This operation deletes states and arcs in the input FST that do not belong to a successful path whose weight is no more (w.r.t the natural the natural ...
Topsort Description This operation topologically sorts its input if acyclic, modifying it. Otherwise, the input is unchanged. When sorted, all transitions are from ...
Invert Description This operation inverts the transduction corresponding to an FST by exchanging the FST's input and output labels. Usage template void Invert ...
Connect Description This operation trims an FST, removing states and arcs that are not on successful paths. Usage template void Connect(MutableFst fst); ...
Number of topics: 50

See also: rss-small RSS feed, recent changes with 50, 100, 200, 500, 1000 topics, all changes

Topic revision: r2 - 28 Mar 2005 - 09:40:13 - TWikiContributor
 
This site is powered by the TWiki collaboration platformCopyright &© by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback