<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Netvouz / mcswell / tag / transducer</title>
<link>http://netvouz.com/mcswell/tag/transducer?feed=rss</link>
<description>mcswell&#39;s bookmarks tagged &quot;transducer&quot; on Netvouz</description>
<item><title>ACL morphology software listing</title>
<link>http://aclweb.org/aclwiki/index.php?title=Morphology_software</link>
<description>ACL wiki page</description>
<category domain="http://netvouz.com/mcswell?category=5852569776243502720">Computational Linguistics &gt; Morphology</category>
<author>mcswell</author>
<pubDate>Thu, 24 Apr 2008 17:15:08 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://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>Foma: a finite-state toolkit and library</title>
<link>http://foma.sourceforge.net/</link>
<description>Foma is a compiler, programming language, and C library for constructing finite-state automata and transducers</description>
<category domain="http://netvouz.com/mcswell?category=1398948865057197610">Computational Linguistics &gt; Finite State</category>
<author>mcswell</author>
<pubDate>Sat, 23 May 2009 19:51:58 GMT</pubDate>
</item><item><title>OpenFST library</title>
<link>http://www.openfst.org/</link>
<description>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.</description>
<category domain="http://netvouz.com/mcswell?category=1398948865057197610">Computational Linguistics &gt; Finite State</category>
<author>mcswell</author>
<pubDate>Wed, 25 Jul 2007 19:01:35 GMT</pubDate>
</item><item><title>Portuguese Lemmatizer</title>
<link>http://lxlemmatizer.di.fc.ul.pt/</link>
<description>Lemmatizer, links to paradigm generator and multilingual dictionary.</description>
<category domain="http://netvouz.com/mcswell?category=1044764025486538530">Languages &gt; Romance Languages &gt; Portuguese</category>
<author>mcswell</author>
<pubDate>Thu, 14 Sep 2006 18:38:11 GMT</pubDate>
</item></channel></rss>