<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Netvouz / tag / finite</title>
<link>http://www.netvouz.com/tag/finite?feed=rss</link>
<description>Bookmarks tagged with &quot;finite&quot; on Netvouz</description>
<item><title>RWTH FSA Toolkit</title>
<link>http://www-i6.informatik.rwth-aachen.de/~kanthak/fsa.html</link>
<description>FSA is an efficient and flexible toolkit to create, manipulate and optimize finite-state automata. It supports weighted and unweighted automata as well as transducers and is designed to use on-demand computations in order to keep memory footprint as low as possible. It may be used to model various problems from the field of natural language processing. The toolkit offers three different interfaces: a C++ library, a Python module and a command-line tool.</description>
<category domain="http://www.netvouz.com/mcswell?category=1398948865057197610">Computational Linguistics &gt; Finite State</category>
<author>mcswell</author>
<pubDate>Wed, 22 Apr 2009 16:19:02 GMT</pubDate>
</item><item><title>Differences between functions in SFST and OpenFst interfaces</title>
<link>https://kitwiki.csc.fi/twiki/bin/view/KitWiki/OMorFiWithOpenFst</link>
<description>Compares SFST and OpenFST wrt interfaces, processing speed etc.</description>
<category domain="http://www.netvouz.com/mcswell?category=1398948865057197610">Computational Linguistics &gt; Finite State</category>
<author>mcswell</author>
<pubDate>Tue, 13 May 2008 21:53:53 GMT</pubDate>
</item><item><title>AGFL Grammar Lab</title>
<link>http://www.agfl.cs.ru.nl/</link>
<description>The AGFL formalism for the syntactic description of Natural Languages has been developed by the Computer Science Department of the Radboud University of Nijmegen. It is a formalism in which large context free grammars can be described in a compact way. AGFLs belong to the family of two level grammars, along with attribute grammars and DCG&#39;s: a first, context-free level is augmented with set-valued features for expressing agreement between constituents.</description>
<category domain="http://www.netvouz.com/mcswell?category=5852569776243502720">Computational Linguistics &gt; Morphology</category>
<author>mcswell</author>
<pubDate>Tue, 15 Apr 2008 19:00:47 GMT</pubDate>
</item><item><title>Regular-Expressions Info</title>
<link>http://www.regular-expressions.info/</link>
<description>General site on regex&#39;s, including what can go wrong, tutorials, RegexBuddy.</description>
<category domain="http://www.netvouz.com/mcswell?category=1398948865057197610">Computational Linguistics &gt; Finite State</category>
<author>mcswell</author>
<pubDate>Mon, 31 Mar 2008 21:08:19 GMT</pubDate>
</item><item><title>FsmReg</title>
<link>https://kitwiki.csc.fi/twiki/bin/view/KitWiki/FsmReg</link>
<description>FsmReg — a registry of FSM technology</description>
<category domain="http://www.netvouz.com/mcswell?category=1398948865057197610">Computational Linguistics &gt; Finite State</category>
<author>mcswell</author>
<pubDate>Sun, 20 Jan 2008 06:40:00 GMT</pubDate>
</item><item><title>Koskenniemi Festschrift</title>
<link>http://cslipublications.stanford.edu/koskenniemi-festschrift/</link>
<description>Inquiries into Words, Constraints and Contexts Festschrift for Kimmo Koskenniemi on his 60th Birthday</description>
<category domain="http://www.netvouz.com/mcswell?category=1398948865057197610">Computational Linguistics &gt; Finite State</category>
<author>mcswell</author>
<pubDate>Wed, 24 Oct 2007 02:47:10 GMT</pubDate>
</item><item><title>FSAs and DAWGs</title>
<link>http://www.eti.pg.gda.pl/katedry/kiw/pracownicy/Jan.Daciuk/personal/fsm_algorithms/</link>
<description>Finite-state automata (FSA) and directed acyclic word graphs (DAWG), and some info on transducers</description>
<category domain="http://www.netvouz.com/mcswell?category=1398948865057197610">Computational Linguistics &gt; Finite State</category>
<author>mcswell</author>
<pubDate>Thu, 01 Feb 2007 23:03:26 GMT</pubDate>
</item><item><title>ALE-RA</title>
<link>http://nl.ijs.si/et/Thesis/ALE-RA/</link>
<description>ALE-RA is an ALE extension to:     * Realizational morphology &amp; finite-state     * Automata phonology</description>
<category domain="http://www.netvouz.com/mcswell?category=5852569776243502720">Computational Linguistics &gt; Morphology</category>
<author>mcswell</author>
<pubDate>Tue, 07 Nov 2006 14:59:55 GMT</pubDate>
</item><item><title>Stuttgart FST kit</title>
<link>http://www.ims.uni-stuttgart.de/projekte/gramotron/SOFTWARE/SFST.html</link>
<description>Includes rewrite operator</description>
<category domain="http://www.netvouz.com/mcswell?category=1398948865057197610">Computational Linguistics &gt; Finite State</category>
<author>mcswell</author>
<pubDate>Fri, 15 Sep 2006 13:08:38 GMT</pubDate>
</item><item><title>Finite State Utilities</title>
<link>http://www.eti.pg.gda.pl/katedry/kiw/pracownicy/Jan.Daciuk/personal/fsa.html</link>
<description></description>
<category domain="http://www.netvouz.com/abonch?category=3214798879470698337">Systems</category>
<author>abonch</author>
<pubDate>Mon, 04 Sep 2006 20:53:50 GMT</pubDate>
</item></channel></rss>