Difference: WebHome (1 vs. 109)

Revision 1092019-07-13 - KyleGorman

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst version 1.7.2 is now available for download.
>
>
Red led OpenFst version 1.7.3 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 1082019-04-11 - KyleGorman

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst version 1.7.1 is now available for download.
>
>
Red led OpenFst version 1.7.2 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 1072019-01-31 - KyleGorman

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst version 1.7.0 is now available for download.
>
>
Red led OpenFst version 1.7.1 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 1062018-12-21 - KyleGorman

Line: 1 to 1
 

OpenFst Library


Changed:
<
<

Red led OpenFst version 1.7.0 is now available for download.
>
>
Red led OpenFst version 1.7.0 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 1052018-12-21 - KyleGorman

Line: 1 to 1
 

OpenFst Library

Deleted:
<
<
 
Changed:
<
<
Red led OpenFst Version 1.6.9 is now available for download.
>
>

Red led OpenFst version 1.7.0 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 1042018-07-24 - KyleGorman

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.6.8 is now available for download.
>
>
Red led OpenFst Version 1.6.9 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 1032018-06-22 - KyleGorman

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.6.7 is now available for download.
>
>
Red led OpenFst Version 1.6.8 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 1022018-05-09 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Revision 1012018-03-03 - KyleGorman

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.6.6 is now available for download.
>
>
Red led OpenFst Version 1.6.7 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 1002018-02-09 - KyleGorman

Line: 1 to 1
 

OpenFst Library

Line: 26 to 26
 models can be applied to hypothesis sets (also represented as automata) or cascaded by finite-state composition, and the best results can be selected by shortest-path algorithms.
Changed:
<
<
This library was developed by contributors from Google Research and NYU's Courant Institute. It is intended to be comprehensive, flexible, efficient and scale well to large problems. It has been extensively tested. It is an open source project distributed under the Apache license.
>
>
This library was developed by contributors from Google Research and NYU's Courant Institute. It is intended to be comprehensive, reliable, flexible, efficient, and to scale well. It is an open source project distributed under the Apache license.
 

Revision 992018-01-28 - KyleGorman

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.6.5 is now available for download.
>
>
Red led OpenFst Version 1.6.6 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 982017-11-01 - KyleGorman

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.6.3 is now available for download.
>
>
Red led OpenFst Version 1.6.5 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 972017-07-05 - KyleGorman

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.6.2 is now available for download.
>
>
Red led OpenFst Version 1.6.3 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 962017-03-14 - KyleGorman

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.6.1 is now available for download.
>
>
Red led OpenFst Version 1.6.2 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 952017-02-06 - KyleGorman

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.6.0 is now available for download.
>
>
Red led OpenFst Version 1.6.1 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 942017-01-07 - KyleGorman

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.5.4 is now available for download.
>
>
Red led OpenFst Version 1.6.0 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 932016-08-24 - KyleGorman

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.5.3 is now available for download.
>
>
Red led OpenFst Version 1.5.4 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 922016-05-24 - KyleGorman

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.5.2 is now available for download.
>
>
Red led OpenFst Version 1.5.3 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 912016-04-12 - KyleGorman

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.5.1 is now available for download.
>
>
Red led OpenFst Version 1.5.2 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 902016-02-12 - KyleGorman

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.5.0 is now available for download.
>
>
Red led OpenFst Version 1.5.1 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 892016-01-26 - KyleGorman

Line: 1 to 1
 

OpenFst Library

Line: 6 to 6
 Red led OpenFst Version 1.5.0 is now available for download.
Changed:
<
<
OpenFst is a library for constructing, combining, optimizing, and
>
>
OpenFst is a library for constructing, combining, optimizing, and
 searching weighted finite-state transducers (FSTs). Weighted finite-state transducers are automata where each transition has an input label, an output label, and a weight. The more familiar
Line: 52 to 52
 
META FILEATTACHMENT attachment="openfst.jpg" attr="" comment="" date="1181798274" name="openfst.jpg" path="openfst.jpg" size="14965" stream="openfst.jpg" user="Main.MichaelRiley" version="11"
META FILEATTACHMENT attachment="openfst-1.3.3.tar.gz" attr="h" comment="" date="1358955554" name="openfst-1.3.3.tar.gz" path="openfst-1.3.3.tar.gz" size="759829" stream="openfst-1.3.3.tar.gz" tmpFilename="/var/tmp/CGItemp10315" user="RichardSproat" version="1"
Added:
>
>
META FILEATTACHMENT attachment="openfst.png" attr="h" comment="" date="1453823967" name="openfst.png" path="openfst.png" size="29132" user="KyleGorman" version="1"

Revision 882015-06-30 - KyleGorman

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.4.1 is now available for download.
>
>
Red led OpenFst Version 1.5.0 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 872014-04-29 - MichaelRiley

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.4.0 is now available for download.
>
>
Red led OpenFst Version 1.4.1 is now available for download.
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 862014-04-24 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Changed:
<
<
  OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted

Revision 852014-04-19 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Deleted:
<
<

[4/18/2014] We have been having problems with runaway TWiki processes that causes this server to eventually freeze. We are investigating and trying some fixes.
 
 
Added:
>
>
-->
  OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted

Revision 842014-04-18 - MichaelRiley

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
[4/18/2014] Sorry for the recent downtimes - we have been having problems with runaway TWiki processes that causes this server to eventually freeze. We are investigating.
>
>
[4/18/2014] We have been having problems with runaway TWiki processes that causes this server to eventually freeze. We are investigating and trying some fixes.
 
Added:
>
>
 

OpenFst is a library for constructing, combining, optimizing, and

Revision 832014-04-18 - MichaelRiley

Line: 1 to 1
 

OpenFst Library


Added:
>
>
[4/18/2014] Sorry for the recent downtimes - we have been having problems with runaway TWiki processes that causes this server to eventually freeze. We are investigating.
  Red led OpenFst Version 1.3.4 is now available for download.

Revision 822013-11-02 - MichaelRiley

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.3.3 is now available for download.
>
>
Red led OpenFst Version 1.3.4 is now available for download.
 

Revision 812013-01-23 - RichardSproat

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.3.2 is now available for download.
>
>
Red led OpenFst Version 1.3.3 is now available for download.
 
Line: 48 to 48
 
Added:
>
>
 
META FILEATTACHMENT attachment="openfst.jpg" attr="" comment="" date="1181798274" name="openfst.jpg" path="openfst.jpg" size="14965" stream="openfst.jpg" user="Main.MichaelRiley" version="11"
Added:
>
>
META FILEATTACHMENT attachment="openfst-1.3.3.tar.gz" attr="h" comment="" date="1358955554" name="openfst-1.3.3.tar.gz" path="openfst-1.3.3.tar.gz" size="759829" stream="openfst-1.3.3.tar.gz" tmpFilename="/var/tmp/CGItemp10315" user="RichardSproat" version="1"

Revision 802012-05-31 - MichaelRiley

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.3.1 is now available for download.
>
>
Red led OpenFst Version 1.3.2 is now available for download.
 

Revision 792012-05-12 - MichaelRiley

Line: 1 to 1
 

OpenFst Library


Line: 41 to 41
 
Added:
>
>
 

Revision 782012-03-02 - MichaelRiley

Line: 1 to 1
 

OpenFst Library


Changed:
<
<
Red led OpenFst Version 1.2.10 is now available for download.
  • Fixes for GNU build issues seen on newer installations
>
>
Red led OpenFst Version 1.3.1 is now available for download.
 

Revision 772011-12-30 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Added:
>
>

 
Changed:
<
<
Red led OpenFst Version 1.2.9 is now available for download.
>
>
Red led OpenFst Version 1.2.10 is now available for download.
  • Fixes for GNU build issues seen on newer installations


  OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted

Revision 762011-12-05 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Changed:
<
<
Red led OpenFst Version 1.2.8 is now available for download.
>
>
Red led OpenFst Version 1.2.9 is now available for download.
  OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted

Revision 752011-11-08 - CyrilAllauzen

Line: 1 to 1
 

OpenFst Library

Changed:
<
<
Red led OpenFst Version 1.2.7 is now available for download.
>
>
Red led OpenFst Version 1.2.8 is now available for download.
  OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted

Revision 742011-08-02 - AntoineAmarilli

Line: 1 to 1
 

OpenFst Library

Red led OpenFst Version 1.2.7 is now available for download.

Line: 23 to 23
 models can be applied to hypothesis sets (also represented as automata) or cascaded by finite-state composition, and the best results can be selected by shortest-path algorithms.
Changed:
<
<
This library was developed by contributors from Google Research and NYU's Courant Institute. It is intended to be comprehensive, flexible, efficient and scale well to large problems. it has been extensively tested. It is an open source project distributed under the Apache license.
>
>
This library was developed by contributors from Google Research and NYU's Courant Institute. It is intended to be comprehensive, flexible, efficient and scale well to large problems. It has been extensively tested. It is an open source project distributed under the Apache license.
 

Revision 732011-04-06 - AntoineAmarilli

Line: 1 to 1
 

OpenFst Library

Red led OpenFst Version 1.2.7 is now available for download.

Line: 40 to 40
 
Changed:
<
<
>
>
 

Revision 722011-03-31 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Red led OpenFst Version 1.2.7 is now available for download.

Revision 712011-02-05 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Changed:
<
<
Red led OpenFst Version 1.2.6 is now available for download.
>
>
Red led OpenFst Version 1.2.7 is now available for download.
  OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted

Revision 702011-02-01 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Red led OpenFst Version 1.2.6 is now available for download.

Line: 25 to 25
  This library was developed by contributors from Google Research and NYU's Courant Institute. It is intended to be comprehensive, flexible, efficient and scale well to large problems. it has been extensively tested. It is an open source project distributed under the Apache license.
Changed:
<
<
>
>
 
Line: 37 to 37
 
Changed:
<
<
>
>
 
Changed:
<
<
>
>
 

Revision 692010-12-12 - CyrilAllauzen

Line: 1 to 1
 

OpenFst Library

Red led OpenFst Version 1.2.6 is now available for download.

Line: 25 to 25
  This library was developed by contributors from Google Research and NYU's Courant Institute. It is intended to be comprehensive, flexible, efficient and scale well to large problems. it has been extensively tested. It is an open source project distributed under the Apache license.
Changed:
<
<
>
>
 

Revision 682010-12-08 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Red led OpenFst Version 1.2.6 is now available for download.

Line: 37 to 37
 
Changed:
<
<
>
>
 

Revision 672010-12-01 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Changed:
<
<
Red led OpenFst Version 1.2.5 is now available for download.
>
>
Red led OpenFst Version 1.2.6 is now available for download.
  OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted

Revision 662010-11-01 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Changed:
<
<
Red led OpenFst Version 1.2.4 is now available for download.
>
>
Red led OpenFst Version 1.2.5 is now available for download.
  OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted
Line: 34 to 34
 
Changed:
<
<
>
>
 
Changed:
<
<
>
>
 
Changed:
<
<
>
>
 

Revision 652010-10-20 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Changed:
<
<
Red led OpenFst Version 1.2.3 is now available for download.
>
>
Red led OpenFst Version 1.2.4 is now available for download.
  OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted

Revision 642010-09-13 - CyrilAllauzen

Line: 1 to 1
 

OpenFst Library

Red led OpenFst Version 1.2.3 is now available for download.

Line: 40 to 40
 
Changed:
<
<
>
>
 

Revision 632010-09-09 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Changed:
<
<
Red led OpenFst Version 1.2.2 is now available for download.
>
>
Red led OpenFst Version 1.2.3 is now available for download.
  OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted

Revision 622010-09-03 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Changed:
<
<
Red led OpenFst Version 1.2 is now available for download.
>
>
Red led OpenFst Version 1.2.2 is now available for download.
  OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted

Revision 612010-09-02 - CyrilAllauzen

Line: 1 to 1
 

OpenFst Library

Red led OpenFst Version 1.2 is now available for download.

Line: 40 to 40
 
Added:
>
>
 

Revision 602010-08-26 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Red led OpenFst Version 1.2 is now available for download.

Revision 592010-08-12 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Changed:
<
<
Red led OpenFst Version 1.2 now available.
>
>
Red led OpenFst Version 1.2 is now available for download.
  OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted

Revision 582010-08-12 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Added:
>
>
Red led OpenFst Version 1.2 now available.
 OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted finite-state transducers are automata where each transition has an
Line: 32 to 34
 
Changed:
<
<
>
>
 
Changed:
<
<
>
>
 
Changed:
<
<
>
>
 

Revision 572010-08-11 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 35 to 35
 
Added:
>
>
 

Revision 562010-08-11 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 34 to 34
 
Added:
>
>
 

Revision 552010-07-31 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 23 to 23
  This library was developed by contributors from Google Research and NYU's Courant Institute. It is intended to be comprehensive, flexible, efficient and scale well to large problems. it has been extensively tested. It is an open source project distributed under the Apache license.
Changed:
<
<
>
>
 

Revision 542009-06-11 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Deleted:
<
<
NEW Faster server; OpenFst Version 1.1
 OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted finite-state transducers are automata where each transition has an
Line: 34 to 32
 
Changed:
<
<
>
>
 
Changed:
<
<
>
>
 

Revision 532009-06-08 - CyrilAllauzen

Line: 1 to 1
 

OpenFst Library

NEW Faster server; OpenFst Version 1.1

Line: 25 to 25
  This library was developed by contributors from Google Research and NYU's Courant Institute. It is intended to be comprehensive, flexible, efficient and scale well to large problems. it has been extensively tested. It is an open source project distributed under the Apache license.
Changed:
<
<
>
>
 

Revision 522009-03-21 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Changed:
<
<
NEW Faster Server!
>
>
NEW Faster server; OpenFst Version 1.1
  OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted

Revision 512009-03-21 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

NEW Faster Server!

Revision 502009-03-13 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

NEW Faster Server!

Line: 23 to 23
 models can be applied to hypothesis sets (also represented as automata) or cascaded by finite-state composition, and the best results can be selected by shortest-path algorithms.
Changed:
<
<
This library was developed by contributors from Google Research and NYU's Courant Institute. It is intended to be comprehensive, flexible, efficient and scale well to large problems. it has been extensively tested. It is an open source project distributed under the Apache license.
>
>
This library was developed by contributors from Google Research and NYU's Courant Institute. It is intended to be comprehensive, flexible, efficient and scale well to large problems. it has been extensively tested. It is an open source project distributed under the Apache license.
 

Revision 492009-03-11 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Added:
>
>
NEW Faster Server!
 OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted finite-state transducers are automata where each transition has an

Revision 482009-03-11 - CyrilAllauzen

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 37 to 37
 
Changed:
<
<
>
>
 
META FILEATTACHMENT attachment="openfst.jpg" attr="" comment="" date="1181798274" name="openfst.jpg" path="openfst.jpg" size="14965" stream="openfst.jpg" user="Main.MichaelRiley" version="11"

Revision 472009-03-10 - CyrilAllauzen

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 36 to 36
 
Changed:
<
<
>
>
 

META FILEATTACHMENT attachment="openfst.jpg" attr="" comment="" date="1181798274" name="openfst.jpg" path="openfst.jpg" size="14965" stream="openfst.jpg" user="Main.MichaelRiley" version="11"

Revision 462009-03-06 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 31 to 31
 
Changed:
<
<
>
>
 

Revision 452009-03-05 - CyrilAllauzen

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Revision 442009-03-04 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 17 to 17
 string processing, machine learning, information extraction and retrieval among others. Often a weighted transducer is used to represent a probabilistic model (e.g., an n-gram model,
Changed:
<
<
pronunciation model). FSTs can be optimized by determinization and minimization,
>
>
pronunciation model). FSTs can be optimized by determinization and minimization,
 models can be applied to hypothesis sets (also represented as automata) or cascaded by finite-state composition, and the best results can be selected by shortest-path algorithms.
Changed:
<
<
This library was developed by contributors from Google Research and NYU's Courant Institute. It is intended to be comprehensive, flexible, efficient and scale well to large problems and it has been extensively tested. It is an open source project distributed under the Apache license.
>
>
This library was developed by contributors from Google Research and NYU's Courant Institute. It is intended to be comprehensive, flexible, efficient and scale well to large problems. it has been extensively tested. It is an open source project distributed under the Apache license.
 

Revision 432009-03-04 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 32 to 32
 
Added:
>
>
 
Deleted:
<
<
 

Revision 422009-03-03 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 31 to 31
 
Changed:
<
<
>
>
 

Revision 412009-03-03 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 21 to 21
 models can be applied to hypothesis sets (also represented as automata) or cascaded by finite-state composition, and the best results can be selected by shortest-path algorithms.
Changed:
<
<
This library was developed by contributors from Google Research and NYU's Courant Institute. It is intended to be comprehensive, flexible, efficient and scale well to large problems. It is an open source project distributed under the Apache license.
>
>
This library was developed by contributors from Google Research and NYU's Courant Institute. It is intended to be comprehensive, flexible, efficient and scale well to large problems and it has been extensively tested. It is an open source project distributed under the Apache license.
 

Revision 402009-03-03 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 33 to 33
 
Changed:
<
<
>
>
 

Revision 392009-03-01 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Revision 362009-02-26 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 36 to 36
 
Changed:
<
<
>
>
 
META FILEATTACHMENT attachment="openfst.jpg" attr="" comment="" date="1181798274" name="openfst.jpg" path="openfst.jpg" size="14965" stream="openfst.jpg" user="Main.MichaelRiley" version="11"

Revision 352009-02-26 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 19 to 19
 probabilistic model (e.g., an n-gram model, pronunciation model). FSTs can be optimized by determinization and minimization, models can be applied to hypothesis sets (also represented as automata) or cascaded
Changed:
<
<
by finite-state composition, and the best results can be selected by shortest-path algorithms.
>
>
by finite-state composition, and the best results can be selected by shortest-path algorithms.
 
Changed:
<
<
This library was developed at Google Research (M. Riley, J. Schalkwyk, W. Skut) and NYU's Courant Institute (C. Allauzen, M. Mohri). It is intended to be comprehensive, flexible, efficient and scale well to large problems. It is an open source project distributed under the Apache license.
>
>
This library was developed by contributors from Google Research and NYU's Courant Institute. It is intended to be comprehensive, flexible, efficient and scale well to large problems. It is an open source project distributed under the Apache license.
 
Line: 35 to 34
 
Changed:
<
<
>
>
 

Revision 342008-09-25 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 37 to 37
 
Changed:
<
<
>
>
 
META FILEATTACHMENT attachment="openfst.jpg" attr="" comment="" date="1181798274" name="openfst.jpg" path="openfst.jpg" size="14965" stream="openfst.jpg" user="Main.MichaelRiley" version="11"

Revision 332008-09-24 - CyrilAllauzen

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 37 to 37
 
Added:
>
>
 
META FILEATTACHMENT attachment="openfst.jpg" attr="" comment="" date="1181798274" name="openfst.jpg" path="openfst.jpg" size="14965" stream="openfst.jpg" user="Main.MichaelRiley" version="11"

Revision 322008-02-29 - CyrilAllauzen

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 35 to 35
 
Changed:
<
<
>
>
 

META FILEATTACHMENT attachment="openfst.jpg" attr="" comment="" date="1181798274" name="openfst.jpg" path="openfst.jpg" size="14965" stream="openfst.jpg" user="Main.MichaelRiley" version="11"

Revision 312007-07-30 - CyrilAllauzen

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 21 to 21
 models can be applied to hypothesis sets (also represented as automata) or cascaded by finite-state composition, and the best results can be selected by shortest-path algorithms.
Changed:
<
<
This library was developed at Google Research (M. Riley, J. Schalkwyk, W. Skut) and NYU's Courant Institute
>
>
This library was developed at Google Research (M. Riley, J. Schalkwyk, W. Skut) and NYU's Courant Institute
 (C. Allauzen, M. Mohri). It is intended to be comprehensive, flexible, efficient and scale well to large problems. It is an open source project distributed under the Apache license.

Revision 302007-07-12 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 38 to 38
 
Deleted:
<
<
-- CyrilAllauzen
-- MichaelRiley
 
META FILEATTACHMENT attachment="openfst.jpg" attr="" comment="" date="1181798274" name="openfst.jpg" path="openfst.jpg" size="14965" stream="openfst.jpg" user="Main.MichaelRiley" version="11"

Revision 292007-07-12 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 35 to 35
 
Changed:
<
<
>
>
 

-- CyrilAllauzen

Revision 282007-07-11 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 21 to 21
 models can be applied to hypothesis sets (also represented as automata) or cascaded by finite-state composition, and the best results can be selected by shortest-path algorithms.
Changed:
<
<
This library was developed at Google Research (M. Riley, J. Schalkwyk, W. Skut) and NYU's Courant Institute
>
>
This library was developed at Google Research (M. Riley, J. Schalkwyk, W. Skut) and NYU's Courant Institute
 (C. Allauzen, M. Mohri). It is intended to be comprehensive, flexible, efficient and scale well to large problems. It is an open source project distributed under the Apache license.

Revision 272007-07-06 - CyrilAllauzen

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 22 to 22
 by finite-state composition, and the best results can be selected by shortest-path algorithms.

This library was developed at Google Research (M. Riley, J. Schalkwyk, W. Skut) and NYU's Courant Institute

Changed:
<
<
(C. Allauzen, M. Mohri). It is intended to be comprehensive, flexible, efficient and scale well to large problems.. It is an open source project distributed under the Apache license.
>
>
(C. Allauzen, M. Mohri). It is intended to be comprehensive, flexible, efficient and scale well to large problems. It is an open source project distributed under the Apache license.
 

Revision 262007-07-05 - CyrilAllauzen

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 19 to 19
 probabilistic model (e.g., an n-gram model, pronunciation model). FSTs can be optimized by determinization and minimization, models can be applied to hypothesis sets (also represented as automata) or cascaded
Changed:
<
<
by finite-state composition, and the best results can be selected by shortest-path algorithms.
>
>
by finite-state composition, and the best results can be selected by shortest-path algorithms.
  This library was developed at Google Research (M. Riley, J. Schalkwyk, W. Skut) and NYU's Courant Institute (C. Allauzen, M. Mohri). It is intended to be comprehensive, flexible, efficient and scale well to large problems.. It is an open source project distributed under the Apache license.

Revision 252007-07-04 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 22 to 22
 by finite-state composition, and the best results can be selected by shortest-path algorithms.

This library was developed at Google Research (M. Riley, J. Schalkwyk, W. Skut) and NYU's Courant Institute

Changed:
<
<
(C. Allauzen, M. Mohri). It is an open source project distributed under the Apache license.

>
>
(C. Allauzen, M. Mohri). It is intended to be comprehensive, flexible, efficient and scale well to large problems.. It is an open source project distributed under the Apache license.
 

Revision 242007-06-21 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 17 to 17
 string processing, machine learning, information extraction and retrieval among others. Often a weighted transducer is used to represent a probabilistic model (e.g., an n-gram model,
Changed:
<
<
pronunciation model). FSTs can be optimized by determinization and minimization,
>
>
pronunciation model). FSTs can be optimized by determinization and minimization,
 models can be applied to hypothesis sets (also represented as automata) or cascaded by finite-state composition, and the best results can be selected by shortest-path algorithms.

Revision 232007-06-16 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 35 to 35
 
Added:
>
>
 

Revision 222007-06-16 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted finite-state transducers are automata where each transition has an

Changed:
<
<
input label, an output label, and a weight. The more familiar
>
>
input label, an output label, and a weight. The more familiar
 finite-state acceptor is represented as a transducer with each transition's input and output label equal. Finite-state acceptors are used to represent sets of strings (specifically, regular or
Line: 19 to 19
 probabilistic model (e.g., an n-gram model, pronunciation model). FSTs can be optimized by determinization and minimization, models can be applied to hypothesis sets (also represented as automata) or cascaded
Changed:
<
<
by finite-state composition, and the best results can be selected by shortest-path algorithms.
>
>
by finite-state composition, and the best results can be selected by shortest-path algorithms.
  This library was developed at Google Research (M. Riley, J. Schalkwyk, W. Skut) and NYU's Courant Institute (C. Allauzen, M. Mohri). It is an open source project distributed under the Apache license.

Revision 212007-06-15 - CyrilAllauzen

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 36 to 36
 
Added:
>
>
  -- CyrilAllauzen
-- MichaelRiley

Revision 202007-06-15 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 35 to 35
 
Added:
>
>
  -- CyrilAllauzen
-- MichaelRiley

Revision 192007-06-14 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 6 to 6
 finite-state transducers are automata where each transition has an input label, an output label, and a weight. The more familiar finite-state acceptor is represented as a transducer with each
Changed:
<
<
transition's input and output the same. Finite-state acceptors
>
>
transition's input and output label equal. Finite-state acceptors
 are used to represent sets of strings (specifically, regular or rational sets); finite-state transducers are used to represent binary relations between pairs of strings (specifically, rational transductions). The weights can be used to represent the cost of taking a particular transition.
Changed:
<
<
FSTs have been applied to a variety of problems in speech and text processing, OCR, and information retrieval. Typically a weighted transducer is used to represent either hypothesis sets (e.g., word lattices) or probabilistic models (e.g., ngram models, pronunciation models). The FSTs can be optimized by determinization and minimization, models can be applied to hypothesis sets via finite-state composition, and the best results can be selected by shortest-path algorithms.
>
>
FSTs have key applications in speech recognition and synthesis, machine translation, optical character recognition, pattern matching, string processing, machine learning, information extraction and retrieval among others. Often a weighted transducer is used to represent a probabilistic model (e.g., an n-gram model, pronunciation model). FSTs can be optimized by determinization and minimization, models can be applied to hypothesis sets (also represented as automata) or cascaded by finite-state composition, and the best results can be selected by shortest-path algorithms.
 
Changed:
<
<
This library was developed at Google Research (M. Riley, J. Schalkwyk, W. Skut) and NYU's Courant Institute (C. Allauzen, M. Mohri).
>
>
This library was developed at Google Research (M. Riley, J. Schalkwyk, W. Skut) and NYU's Courant Institute (C. Allauzen, M. Mohri). It is an open source project distributed under the Apache license.
 

Revision 182007-06-14 - MichaelRiley

Line: 1 to 1
Deleted:
<
<
 

OpenFst Library

OpenFst is a library for constructing, combining, optimizing, and

Line: 35 to 34
 
Added:
>
>
-- CyrilAllauzen
-- MichaelRiley
 
Deleted:
<
<
-- CyrilAllauzen - 25 May 2007
-- MichaelRiley - 25 May 2007
 
META FILEATTACHMENT attachment="openfst.jpg" attr="" comment="" date="1181798274" name="openfst.jpg" path="openfst.jpg" size="14965" stream="openfst.jpg" user="Main.MichaelRiley" version="11"

Revision 172007-06-14 - MichaelRiley

Line: 1 to 1
Deleted:
<
<
openfst.jpg
 

OpenFst Library

Line: 40 to 39
 -- CyrilAllauzen - 25 May 2007
-- MichaelRiley - 25 May 2007
Changed:
<
<
META FILEATTACHMENT attachment="openfst.jpg" attr="" comment="" date="1181757714" name="openfst.jpg" path="openfst.jpg" size="20182" stream="openfst.jpg" user="Main.MichaelRiley" version="10"
>
>
META FILEATTACHMENT attachment="openfst.jpg" attr="" comment="" date="1181798274" name="openfst.jpg" path="openfst.jpg" size="14965" stream="openfst.jpg" user="Main.MichaelRiley" version="11"

Revision 162007-06-14 - MichaelRiley

Line: 1 to 1
Deleted:
<
<

OpenFst Library

 openfst.jpg
Added:
>
>

OpenFst Library

 OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted finite-state transducers are automata where each transition has an

Revision 152007-06-14 - MichaelRiley

Line: 1 to 1
Deleted:
<
<
  • Set USERSTYLEURL=http://www.opengrm.org/twiki/pub/FST/WebHome/notopbar.css
 

OpenFst Library

openfst.jpg

Revision 142007-06-13 - MichaelRiley

Line: 1 to 1
Added:
>
>
  • Set USERSTYLEURL=http://www.opengrm.org/twiki/pub/FST/WebHome/notopbar.css
 

OpenFst Library

openfst.jpg

Revision 132007-06-13 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

Changed:
<
<
This is a library for constructing, combining, optimizing, and
>
>
openfst.jpg

OpenFst is a library for constructing, combining, optimizing, and

 searching weighted finite-state transducers (FSTs). Weighted finite-state transducers are automata where each transition has an input label, an output label, and a weight. The more familiar
Line: 12 to 14
 binary relations between pairs of strings (specifically, rational transductions). The weights can be used to represent the cost of taking a particular transition.
Changed:
<
<
FSTs have been applied to a variety of problems in speech, natural language processing and information retrieval. Typically a weighted transducer is used to represent either hypothesis sets (e.g., speech lattices) or probabilistic models (e.g., language models or pronunciation models). The FSTs can be optimized by determinization and minimization,
>
>
FSTs have been applied to a variety of problems in speech and text processing, OCR, and information retrieval. Typically a weighted transducer is used to represent either hypothesis sets (e.g., word lattices) or probabilistic models (e.g., ngram models, pronunciation models). The FSTs can be optimized by determinization and minimization,
 models can be applied to hypothesis sets via finite-state composition, and the best results can be selected by shortest-path algorithms.
Changed:
<
<
This library was developed at Google Research and NYU's Courant Institute.
>
>
This library was developed at Google Research (M. Riley, J. Schalkwyk, W. Skut) and NYU's Courant Institute (C. Allauzen, M. Mohri).
 

Line: 36 to 39
  -- CyrilAllauzen - 25 May 2007
-- MichaelRiley - 25 May 2007
Added:
>
>
META FILEATTACHMENT attachment="openfst.jpg" attr="" comment="" date="1181757714" name="openfst.jpg" path="openfst.jpg" size="20182" stream="openfst.jpg" user="Main.MichaelRiley" version="10"

Revision 122007-05-26 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

This is a library for constructing, combining, optimizing, and

Line: 22 to 22
 This library was developed at Google Research and NYU's Courant Institute.

Deleted:
<
<

Available Information

 

Revision 112007-05-25 - MichaelRiley

Line: 1 to 1
 

OpenFst Library

This is a library for constructing, combining, optimizing, and

Line: 19 to 19
 models can be applied to hypothesis sets via finite-state composition, and the best results can be selected by shortest-path algorithms.

Added:
>
>
This library was developed at Google Research and NYU's Courant Institute.

 

Available Information

Added:
>
>
 
Added:
>
>
-- CyrilAllauzen - 25 May 2007
-- MichaelRiley - 25 May 2007

Revision 102006-12-12 - CyrilAllauzen

Line: 1 to 1
 

OpenFst Library

This is a library for constructing, combining, optimizing, and

Line: 25 to 25
 
Changed:
<
<

FST Web Utilities

>
>

Revision 92006-12-12 - CyrilAllauzen

Line: 1 to 1
Changed:
<
<

OpenFst Library

>
>

OpenFst Library

  This is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted
Line: 24 to 24
 
Added:
>
>

FST Web Utilities

Revision 82006-12-12 - MichaelRiley

Line: 1 to 1
Changed:
<
<

Welcome to the FST web

FST Library

>
>

OpenFst Library

  This is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted
Line: 26 to 24
 
Deleted:
<
<

FST Web Utilities

Revision 72006-11-21 - CyrilAllauzen

Line: 1 to 1
 

Welcome to the FST web

Added:
>
>

FST Library

This is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted finite-state transducers are automata where each transition has an input label, an output label, and a weight. The more familiar finite-state acceptor is represented as a transducer with each transition's input and output the same. Finite-state acceptors are used to represent sets of strings (specifically, regular or rational sets); finite-state transducers are used to represent binary relations between pairs of strings (specifically, rational transductions). The weights can be used to represent the cost of taking a particular transition.

FSTs have been applied to a variety of problems in speech, natural language processing and information retrieval. Typically a weighted transducer is used to represent either hypothesis sets (e.g., speech lattices) or probabilistic models (e.g., language models or pronunciation models). The FSTs can be optimized by determinization and minimization, models can be applied to hypothesis sets via finite-state composition, and the best results can be selected by shortest-path algorithms.

 

Available Information

Changed:
<
<
  • ...
  • ...
  • ...
>
>
 

FST Web Utilities

Revision 62005-03-28 - TWikiContributor

Line: 1 to 1
 

Welcome to the FST web

Available Information

Revision 52005-03-28 - TWikiContributor

Line: 1 to 1
Changed:
<
<
Welcome to the home of TWiki.FST. This is a web-based collaboration area for ...
>
>

Welcome to the FST web

 
Changed:
<
<
>
>

Available Information

  • ...
  • ...
  • ...
 
Changed:
<
<

Site Tools of the FST Web

>
>

FST Web Utilities

 
Deleted:
<
<

Notes:

  • You are currently in the FST web. The color code for this web is this background, so you know where you are.
  • If you are not familiar with the TWiki collaboration platform, please visit WelcomeGuest first.

Web Description Links
TWiki home with users and groups for access control
Search Changes Notification Statistics Preferences
TWiki documentation, welcome guest and user registration
Search Changes Notification Statistics Preferences
Contributions and work related to the OpenFst library
Search Changes Notification Statistics Preferences
FST
FST Library Wiki
Search Changes Notification Statistics Preferences
Discussion forums
Search Changes Notification Statistics Preferences
GRM
GRM Project Wiki
Search Changes Notification Statistics Preferences
OpenKernel Library Wiki
Search Changes Notification Statistics Preferences
Sandbox web to experiment in an open hands-on area
Search Changes Notification Statistics Preferences
TWiki home with users and groups for access control
Search Changes Notification Statistics Preferences
TIP Webs are color-coded for identification and reference. Contact fst@openfst.org if you need a workspace web for your team.

Legend:   Search topic Search the web
Recent changes See recent changes in the web
Notify Subscribe to get notified of changes by e-mail
Statistics Usage statistics of the web
Wrench, tools Web-specific preferences

Revision 42002-04-14 - PeterThoeny

Line: 1 to 1
 Welcome to the home of TWiki.FST. This is a web-based collaboration area for ...

Changed:
<
<

Maintenance of the FST web

  •    (More options in WebSearch)
  • WebChanges: Find out recent modifications to the TWiki.FST web.
  • WebIndex: Display all TWiki.FST topics in alphabetical order. See also the faster WebTopicList
  • WebNotify: Subscribe to be automatically notified when something changes in the TWiki.FST web.
  • WebStatistics: View access statistics of the TWiki.FST web.
  • WebPreferences: Preferences of the TWiki.FST web.
>
>

Site Tools of the FST Web

  Notes:
Changed:
<
<
  • You are currently in the TWiki.FST web. The color code for this web is a (SPECIFY COLOR) background, so you know where you are.
  • If you are not familiar with the TWiki collaboration tool, please visit WelcomeGuest in the TWiki.TWiki web first.
>
>
  • You are currently in the FST web. The color code for this web is this background, so you know where you are.
  • If you are not familiar with the TWiki collaboration platform, please visit WelcomeGuest first.
 
Web Description Links
TWiki home with users and groups for access control
Search Changes Notification Statistics Preferences
TWiki documentation, welcome guest and user registration
Search Changes Notification Statistics Preferences
Contributions and work related to the OpenFst library
Search Changes Notification Statistics Preferences
FST
FST Library Wiki
Search Changes Notification Statistics Preferences
Discussion forums
Search Changes Notification Statistics Preferences
GRM
GRM Project Wiki
Search Changes Notification Statistics Preferences
OpenKernel Library Wiki
Search Changes Notification Statistics Preferences
Sandbox web to experiment in an open hands-on area
Search Changes Notification Statistics Preferences
TWiki home with users and groups for access control
Search Changes Notification Statistics Preferences
TIP Webs are color-coded for identification and reference. Contact fst@openfst.org if you need a workspace web for your team.

Legend:   Search topic Search the web
Recent changes See recent changes in the web
Notify Subscribe to get notified of changes by e-mail
Statistics Usage statistics of the web
Wrench, tools Web-specific preferences

Revision 32002-04-07 - PeterThoeny

Line: 1 to 1
 Welcome to the home of TWiki.FST. This is a web-based collaboration area for ...

Line: 18 to 18
 
  • You are currently in the TWiki.FST web. The color code for this web is a (SPECIFY COLOR) background, so you know where you are.
  • If you are not familiar with the TWiki collaboration tool, please visit WelcomeGuest in the TWiki.TWiki web first.
Changed:
<
<
Warning: Can't find topic TWiki.TWikiWebsTable
>
>
Web Description Links
TWiki home with users and groups for access control
Search Changes Notification Statistics Preferences
TWiki documentation, welcome guest and user registration
Search Changes Notification Statistics Preferences
Contributions and work related to the OpenFst library
Search Changes Notification Statistics Preferences
FST
FST Library Wiki
Search Changes Notification Statistics Preferences
Discussion forums
Search Changes Notification Statistics Preferences
GRM
GRM Project Wiki
Search Changes Notification Statistics Preferences
OpenKernel Library Wiki
Search Changes Notification Statistics Preferences
Sandbox web to experiment in an open hands-on area
Search Changes Notification Statistics Preferences
TWiki home with users and groups for access control
Search Changes Notification Statistics Preferences
TIP Webs are color-coded for identification and reference. Contact fst@openfst.org if you need a workspace web for your team.

Legend:   Search topic Search the web
Recent changes See recent changes in the web
Notify Subscribe to get notified of changes by e-mail
Statistics Usage statistics of the web
Wrench, tools Web-specific preferences

Revision 22001-11-24 - PeterThoeny

Line: 1 to 1
 Welcome to the home of TWiki.FST. This is a web-based collaboration area for ...

Line: 8 to 8
 
  •    (More options in WebSearch)
  • WebChanges: Find out recent modifications to the TWiki.FST web.
Changed:
<
<
  • WebIndex: Display all TWiki.FST topics in alphabetical order.
>
>
 
  • WebNotify: Subscribe to be automatically notified when something changes in the TWiki.FST web.
  • WebStatistics: View access statistics of the TWiki.FST web.
  • WebPreferences: Preferences of the TWiki.FST web.

Revision 12001-08-08 - PeterThoeny

Line: 1 to 1
Added:
>
>
Welcome to the home of TWiki.FST. This is a web-based collaboration area for ...

Maintenance of the FST web

  •    (More options in WebSearch)
  • WebChanges: Find out recent modifications to the TWiki.FST web.
  • WebIndex: Display all TWiki.FST topics in alphabetical order.
  • WebNotify: Subscribe to be automatically notified when something changes in the TWiki.FST web.
  • WebStatistics: View access statistics of the TWiki.FST web.
  • WebPreferences: Preferences of the TWiki.FST web.

Notes:

  • You are currently in the TWiki.FST web. The color code for this web is a (SPECIFY COLOR) background, so you know where you are.
  • If you are not familiar with the TWiki collaboration tool, please visit WelcomeGuest in the TWiki.TWiki web first.

Warning: Can't find topic TWiki.TWikiWebsTable

 
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