<?xml version="1.0"?>
<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:title xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">An   approach for output decoding of neural networks</dc:title>
  <dc:contributor xmlns:dc="http://purl.org/dc/elements/1.1/">Strauß, Tobias , 1984- (VerfasserIn)</dc:contributor>
  <dc:contributor xmlns:dc="http://purl.org/dc/elements/1.1/">Labahn, Roger , 1959- (VerfasserIn)</dc:contributor>
  <dc:contributor xmlns:dc="http://purl.org/dc/elements/1.1/">Leifert, Gundram (VerfasserIn)</dc:contributor>
  <dc:contributor xmlns:dc="http://purl.org/dc/elements/1.1/">Wustlich, Welf (VerfasserIn)</dc:contributor>
  <dc:type xmlns:dc="http://purl.org/dc/elements/1.1/">Text</dc:type>
  <dc:type xmlns:dc="http://purl.org/dc/elements/1.1/">Text</dc:type>
  <dc:date xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">2012</dc:date>
  <dc:date xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">2012</dc:date>
  
  <dc:language xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">eng</dc:language>
  <dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">electronic resource</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">remote</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">Computermedien</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">Online-Ressource</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">1 Online-Ressource (7 Seiten)</dc:format>
  <dc:description xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">We review two decoding methods for recurrent neural networks – based on the well known weighted Levenshtein distance and the connectionist temporal classification (CTC) – and we introduce a new method – the dynamic Levenstein distance (DynWL). We compare these three methods analytically in terms of time complexity and error performance. Although the approaches are different, there are deep connections between These ways of decoding. Finally, we test on the Arabic and French ICDAR data sets. Our experiments show that CTC yields the smallest error rates. Nevertheless, there are scenarios where DynWL is a good choice between performance and time complexity.&lt;eng&gt;</dc:description>
  <dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">Open Access</dc:rights>
  <dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">Urheberrechtsschutz 1.0</dc:rights>
  <dc:description xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">Tobias Strauß, Roger Labahn, Gundram Leifert, Welf Wustlich</dc:description>
  <dc:subject xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">510</dc:subject>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">https://purl.uni-rostock.de/rosdok/id00005820</dc:identifier>
  
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">urn:nbn:de:gbv:28-rosdok_id00005820-5</dc:identifier>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">doi: 10.18453/rosdok_id00005820</dc:identifier>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">oclc: 1621163060</dc:identifier>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">ppn:
				(DE-627)1986180786</dc:identifier>
</oai_dc:dc>
