<?xml version="1.0" encoding="UTF-8" standalone="yes"?><add><doc><field name="objectKind">mycoreobject</field><field name="id">rosdok_document_0000027951</field><field name="returnId">rosdok_document_0000027951</field><field name="objectProject">rosdok</field><field name="objectType">document</field><field name="link">rosdok_derivate_0000229862</field><field name="modified">2026-10-13T13:21:01.452Z</field><field name="created">2026-10-10T09:49:36.678Z</field><field name="modifiedby">editorKE</field><field name="createdby">editorKE</field><field name="state">published</field><field name="derCount">1</field><field name="derivates">rosdok_derivate_0000229862</field><field name="worldReadable">true</field><field name="worldReadableComplete">true</field><field name="category">derivate_types:fulltext</field><field name="allMeta">Volltext</field><field name="allMeta">fulltext</field><field name="allMeta">wf_edit_epub wf_register_epub</field><field name="category">state:published</field><field name="category.top">state:published</field><field name="allMeta">veröffentlicht</field><field name="allMeta">published</field><field name="allMeta">rosdok_id00005820</field><field name="allMeta">1986180786</field><field name="allMeta">Oau</field><field name="allMeta">2026-10-10</field><field name="allMeta">2026-10-13T13:21:00Z</field><field name="allMeta">rda</field><field name="allMeta">Converted from PICA to MODS using Pica2MODS XSLT Transformer 2.14-SNAPSHOT [SCM: "" "" ""] with mode 'DEFAULT'.</field><field name="allMeta">Workingpaper</field><field name="allMeta">An</field><field name="allMeta">approach for output decoding of neural networks</field><field name="allMeta">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.</field><field name="allMeta">Tobias</field><field name="allMeta">Strauß</field><field name="allMeta">1984 -</field><field name="allMeta">VerfasserIn</field><field name="allMeta">aut</field><field name="allMeta">1136294554</field><field name="allMeta">0000-0002-5344-4188</field><field name="allMeta">Roger</field><field name="allMeta">Labahn</field><field name="allMeta">1959 -</field><field name="allMeta">VerfasserIn</field><field name="allMeta">aut</field><field name="allMeta">170999645</field><field name="allMeta">0000-0003-1901-9644</field><field name="allMeta">Gundram</field><field name="allMeta">Leifert</field><field name="allMeta">VerfasserIn</field><field name="allMeta">aut</field><field name="allMeta">Welf</field><field name="allMeta">Wustlich</field><field name="allMeta">VerfasserIn</field><field name="allMeta">aut</field><field name="allMeta">https://purl.uni-rostock.de/rosdok/id00005820</field><field name="allMeta">urn:nbn:de:gbv:28-rosdok_id00005820-5</field><field name="allMeta">10.18453/rosdok_id00005820</field><field name="allMeta">510 Mathematik</field><field name="allMeta">Mathematisch-Naturwissenschaftliche Fakultät</field><field name="allMeta">alle Rechte vorbehalten</field><field name="allMeta">Rechteinhaber Universität Rostock</field><field name="allMeta">frei zugänglich (Open Access)</field><field name="allMeta">Lizenz Metadaten: CC0</field><field name="allMeta">en</field><field name="allMeta">1 Online-Ressource (7 Seiten)</field><field name="allMeta">2012</field><field name="allMeta">University of Rostock, Institute of Mathematics</field><field name="allMeta">Rostock</field><field name="allMeta">monographic</field><field name="allMeta">2012</field><field name="allMeta">2026</field><field name="allMeta">Universitätsbibliothek Rostock</field><field name="allMeta">Rostock</field><field name="allMeta">2026</field><field name="allMeta">Universitätsbibliothek Rostock</field><field name="allMeta">https://purl.uni-rostock.de/rosdok/id00005820</field><field name="allMeta">Tobias Strauß, Roger Labahn, Gundram Leifert, Welf Wustlich</field><field name="allMeta">rosdok_id00005816</field><field name="allMeta">1986139832</field><field name="allMeta">Odv</field><field name="allMeta">https://purl.uni-rostock.de/rosdok/id00005816</field><field name="allMeta">Preprints aus dem Institut für Mathematik</field><field name="allMeta">3255797-8</field><field name="allMeta">12/3</field><field name="allMeta">0012-0003</field><field name="category">doctype:epub</field><field name="category.top">doctype:epub</field><field name="allMeta">Dokumenttyp</field><field name="allMeta">Document type</field><field name="category">doctype:epub.workingpaper</field><field name="category.top">doctype:epub.workingpaper</field><field name="allMeta">Workingpaper</field><field name="allMeta">working paper</field><field name="allMeta">diniPublType:workingPaper diniPublType2022:WorkingPaper</field><field name="allMeta">info:eu-repo/semantics/workingPaper</field><field name="allMeta">document</field><field name="category">diniPublType2022:WorkingPaper</field><field name="category.top">diniPublType2022:WorkingPaper</field><field name="allMeta">Arbeitspapier</field><field name="allMeta">Working paper</field><field name="allMeta">KDSF (Pu37)</field><field name="category">SDNB:510</field><field name="category.top">SDNB:510</field><field name="allMeta">510 Mathematik</field><field name="allMeta">510 Mathematics</field><field name="category">institution:unirostock</field><field name="category.top">institution:unirostock</field><field name="allMeta">Universität Rostock</field><field name="allMeta">University of Rostock</field><field name="allMeta">Universität Rostock</field><field name="allMeta">Universität Rostock</field><field name="allMeta">Uni.Rostock</field><field name="allMeta">http://d-nb.info/gnd/38329-6</field><field name="category">institution:unirostock.mnf</field><field name="category.top">institution:unirostock.mnf</field><field name="allMeta">Mathematisch-Naturwissenschaftliche Fakultät</field><field name="allMeta">Faculty of Mathematics and Natural Sciences</field><field name="allMeta">Universität Rostock. Mathematisch-Naturwissenschaftliche Fakultät</field><field name="allMeta">Mathematisch-Natur-&lt;br /&gt;wissenschaftliche Fakultät</field><field name="allMeta">Uni.Rostock.Fakultaet.MNF</field><field name="allMeta">http://d-nb.info/gnd/2147083-2</field><field name="category">licenseinfo:work</field><field name="category.top">licenseinfo:work</field><field name="allMeta">Werk</field><field name="allMeta">work</field><field name="category">licenseinfo:work.rightsreserved</field><field name="category.top">licenseinfo:work.rightsreserved</field><field name="allMeta">alle Rechte vorbehalten</field><field name="allMeta">all rights reserved</field><field name="allMeta">/creativecommons/r/reserved/0.9/88x31.png</field><field name="allMeta">[DE-28]Urheberrechtsschutz 1.0$gRights Statements$uhttp://rightsstatements.org/vocab/InC/1.0/</field><field name="allMeta">http://rightsstatements.org/vocab/InC/1.0/</field><field name="allMeta">http://rightsstatements.org/vocab/InC/1.0/</field><field name="category">licenseinfo:deposit</field><field name="category.top">licenseinfo:deposit</field><field name="allMeta">Veröffentlichungsgenehmigung</field><field name="allMeta">permission to store</field><field name="category">licenseinfo:deposit.rightsunirostock</field><field name="category.top">licenseinfo:deposit.rightsunirostock</field><field name="allMeta">Rechteinhaber Universität Rostock</field><field name="allMeta">rightsholder Rostock University</field><field name="category">accesscondition:openaccess</field><field name="category.top">accesscondition:openaccess</field><field name="allMeta">frei zugänglich (Open Access)</field><field name="allMeta">open access</field><field name="allMeta">http://purl.org/coar/access_right/c_abf2</field><field name="allMeta">OA</field><field name="allMeta">free</field><field name="allMeta">info:eu-repo/semantics/openAccess</field><field name="allMeta">[DE-28]Open Access$gControlled Vocabulary for Access Rights$uhttp://purl.org/coar/access_right/c_abf2</field><field name="category">licenseinfo:metadata</field><field name="category.top">licenseinfo:metadata</field><field name="allMeta">Lizenzen für Metadaten</field><field name="category">licenseinfo:metadata.cc0</field><field name="category.top">licenseinfo:metadata.cc0</field><field name="allMeta">Lizenz Metadaten: CC0</field><field name="allMeta">license metadata: CC0</field><field name="allMeta">/creativecommons/p/zero/1.0/88x31.png</field><field name="allMeta">https://creativecommons.org/publicdomain/zero/1.0/</field><field name="category">rfc5646:en</field><field name="category.top">rfc5646:en</field><field name="allMeta">Englisch</field><field name="allMeta">English</field><field name="allMeta">eng</field><field name="allMeta">eng</field><field name="mods.title">An</field><field name="mods.title">approach for output decoding of neural networks</field><field name="mods.title.main">An approach for output decoding of neural networks</field><field name="mods.title.subtitle"></field><field name="mods.nameIdentifier">gnd:1136294554</field><field name="mods.nameIdentifier">orcid:0000-0002-5344-4188</field><field name="mods.nameIdentifier">gnd:170999645</field><field name="mods.nameIdentifier">orcid:0000-0003-1901-9644</field><field name="mods.nameIdentifier.top">gnd:1136294554</field><field name="mods.nameIdentifier.top">orcid:0000-0002-5344-4188</field><field name="mods.nameIdentifier.top">gnd:170999645</field><field name="mods.nameIdentifier.top">orcid:0000-0003-1901-9644</field><doc><field name="id">rosdok_document_0000027951-d4134118e50</field><field name="mods.nameIdentifier">gnd:1136294554</field><field name="mods.nameIdentifier">orcid:0000-0002-5344-4188</field><field name="mods.name">Tobias Strauß</field><field name="mods.name.top">Tobias Strauß</field></doc><doc><field name="id">rosdok_document_0000027951-d4134118e66</field><field name="mods.nameIdentifier">gnd:170999645</field><field name="mods.nameIdentifier">orcid:0000-0003-1901-9644</field><field name="mods.name">Roger Labahn</field><field name="mods.name.top">Roger Labahn</field></doc><doc><field name="id">rosdok_document_0000027951-d4134118e82</field><field name="mods.name">Gundram Leifert</field><field name="mods.name.top">Gundram Leifert</field></doc><doc><field name="id">rosdok_document_0000027951-d4134118e92</field><field name="mods.name">Welf Wustlich</field><field name="mods.name.top">Welf Wustlich</field></doc><field name="mods.name">Tobias Strauß</field><field name="mods.name">Roger Labahn</field><field name="mods.name">Gundram Leifert</field><field name="mods.name">Welf Wustlich</field><field name="mods.name.top">Tobias Strauß</field><field name="mods.name.top">Roger Labahn</field><field name="mods.name.top">Gundram Leifert</field><field name="mods.name.top">Welf Wustlich</field><field name="mods.author">Tobias Strauß</field><field name="mods.author">Roger Labahn</field><field name="mods.author">Gundram Leifert</field><field name="mods.author">Welf Wustlich</field><field name="mods.place">Rostock</field><field name="mods.publisher">University of Rostock, Institute of Mathematics</field><field name="mods.genre">epub.workingpaper</field><field name="mods.identifier">https://purl.uni-rostock.de/rosdok/id00005820</field><field name="mods.identifier">urn:nbn:de:gbv:28-rosdok_id00005820-5</field><field name="mods.identifier">10.18453/rosdok_id00005820</field><field name="mods.abstract">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.</field><field name="mods.dateIssued">2012</field><field name="mods.yearIssued">2012</field><field name="mods.title.series">Preprints aus dem Institut für Mathematik</field><field name="allMeta">rosdok_id00005816</field><field name="allMeta">1986139832</field><field name="allMeta">Odv</field><field name="allMeta">https://purl.uni-rostock.de/rosdok/id00005816</field><field name="allMeta">Preprints aus dem Institut für Mathematik</field><field name="allMeta">3255797-8</field><field name="allMeta">12/3</field><field name="allMeta">0012-0003</field><field name="mods.identifier.series">https://purl.uni-rostock.de/rosdok/id00005816</field><field name="mods.identifier.series">3255797-8</field><field name="mods.relatedItem"></field><field name="mods.relatedItem.series"></field><field name="mods.note.statement of responsibility">Tobias Strauß, Roger Labahn, Gundram Leifert, Welf Wustlich</field><field name="mods.type">epub.workingpaper</field><field name="search_result_link_text">1
        Strauss_approach_2012.pdf
        
        171020
        10a6aa03bd7824832ec8558852b94e2a
      
    
  
  
    
      
        rosdok_id000058201986180786Oau2026-10-102026-10-13T13:21:00ZrdaConverted from PICA to MODS using Pica2MODS XSLT Transformer 2.14-SNAPSHOT [SCM: "" "" ""] with mode 'DEFAULT'.WorkingpaperAnapproach for output decoding of neural networksWe 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.TobiasStrauß1984 -VerfasserInaut11362945540000-0002-5344-4188RogerLabahn1959 -VerfasserInaut1709996450000-0003-1901-9644GundramLeifertVerfasserInautWelfWustlichVerfasserInauthttps://purl.uni-rostock.de/rosdok/id00005820urn:nbn:de:gbv:28-rosdok_id00005820-510.18453/rosdok_id00005820510 MathematikMathematisch-Naturwissenschaftliche Fakultätalle Rechte vorbehaltenRechteinhaber Universität Rostockfrei zugänglich (Open Access)Lizenz Metadaten: CC0en1 Online-Ressource (7 Seiten)2012University of Rostock, Institute of MathematicsRostockmonographic20122026Universitätsbibliothek RostockRostock2026Universitätsbibliothek Rostockhttps://purl.uni-rostock.de/rosdok/id00005820Tobias Strauß, Roger Labahn, Gundram Leifert, Welf Wustlichrosdok_id000058161986139832Odvhttps://purl.uni-rostock.de/rosdok/id00005816Preprints aus dem Institut für Mathematik3255797-812/30012-0003
      
    
  
  
    
      2026-10-10T09:49:36.678Z
      2026-10-13T13:21:01.452Z
      2026-10-23T13:21:01.461Z
    
    
      editorKE
      {"identifier":"rosdok/id00005820","type":"local_id","additional":"","service":"MCRLocalID","created":"2026-10-10T09:49:36.687Z"}
      {"identifier":"urn:nbn:de:gbv:28-rosdok_id00005820-5","type":"dnbUrn","additional":"","service":"RosDokURN","created":"2026-10-10T09:49:36.694Z"}
      {"identifier":"https://purl.uni-rostock.de/rosdok/id00005820","type":"purl","additional":"","service":"RosDokPURL","created":"2026-10-10T09:49:36.697Z","registrationStarted":"2026-10-10T09:53:32.175Z"}
      {"identifier":"10.18453/rosdok_id00005820","type":"doi","additional":"","service":"RosDokDOI","created":"2026-10-10T09:49:36.700Z","registrationStarted":"2026-10-10T09:53:31.924Z","registered":"2026-10-10T09:53:33.416Z"}
      editorKE</field><field name="derivateLabel">fulltext</field><field name="ir.pdffulltext_url">file/rosdok_document_0000027951/rosdok_derivate_0000229862/Strauss_approach_2012.pdf</field><field name="mods.title">An</field><field name="mods.title">approach for output decoding of neural networks</field><field name="mods.title.main">An approach for output decoding of neural networks</field><field name="mods.title.subtitle"></field><field name="mods.nameIdentifier">gnd:1136294554</field><field name="mods.nameIdentifier">orcid:0000-0002-5344-4188</field><field name="mods.nameIdentifier">gnd:170999645</field><field name="mods.nameIdentifier">orcid:0000-0003-1901-9644</field><field name="mods.nameIdentifier.top">gnd:1136294554</field><field name="mods.nameIdentifier.top">orcid:0000-0002-5344-4188</field><field name="mods.nameIdentifier.top">gnd:170999645</field><field name="mods.nameIdentifier.top">orcid:0000-0003-1901-9644</field><doc><field name="id">rosdok_document_0000027951-d4134118e50</field><field name="mods.nameIdentifier">gnd:1136294554</field><field name="mods.nameIdentifier">orcid:0000-0002-5344-4188</field><field name="mods.name">Tobias Strauß</field><field name="mods.name.top">Tobias Strauß</field></doc><doc><field name="id">rosdok_document_0000027951-d4134118e66</field><field name="mods.nameIdentifier">gnd:170999645</field><field name="mods.nameIdentifier">orcid:0000-0003-1901-9644</field><field name="mods.name">Roger Labahn</field><field name="mods.name.top">Roger Labahn</field></doc><doc><field name="id">rosdok_document_0000027951-d4134118e82</field><field name="mods.name">Gundram Leifert</field><field name="mods.name.top">Gundram Leifert</field></doc><doc><field name="id">rosdok_document_0000027951-d4134118e92</field><field name="mods.name">Welf Wustlich</field><field name="mods.name.top">Welf Wustlich</field></doc><field name="mods.name">Tobias Strauß</field><field name="mods.name">Roger Labahn</field><field name="mods.name">Gundram Leifert</field><field name="mods.name">Welf Wustlich</field><field name="mods.name.top">Tobias Strauß</field><field name="mods.name.top">Roger Labahn</field><field name="mods.name.top">Gundram Leifert</field><field name="mods.name.top">Welf Wustlich</field><field name="mods.author">Tobias Strauß</field><field name="mods.author">Roger Labahn</field><field name="mods.author">Gundram Leifert</field><field name="mods.author">Welf Wustlich</field><field name="mods.place">Rostock</field><field name="mods.publisher">University of Rostock, Institute of Mathematics</field><field name="mods.genre">epub.workingpaper</field><field name="mods.identifier">https://purl.uni-rostock.de/rosdok/id00005820</field><field name="mods.identifier">urn:nbn:de:gbv:28-rosdok_id00005820-5</field><field name="mods.identifier">10.18453/rosdok_id00005820</field><field name="mods.abstract">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.</field><field name="mods.dateIssued">2012</field><field name="mods.yearIssued">2012</field><field name="mods.title.series">Preprints aus dem Institut für Mathematik</field><field name="allMeta">rosdok_id00005816</field><field name="allMeta">1986139832</field><field name="allMeta">Odv</field><field name="allMeta">https://purl.uni-rostock.de/rosdok/id00005816</field><field name="allMeta">Preprints aus dem Institut für Mathematik</field><field name="allMeta">3255797-8</field><field name="allMeta">12/3</field><field name="allMeta">0012-0003</field><field name="mods.identifier.series">https://purl.uni-rostock.de/rosdok/id00005816</field><field name="mods.identifier.series">3255797-8</field><field name="mods.relatedItem"></field><field name="mods.relatedItem.series"></field><field name="mods.note.statement of responsibility">Tobias Strauß, Roger Labahn, Gundram Leifert, Welf Wustlich</field><field name="ir.identifier">[xslt]Saxon</field><field name="recordIdentifier">rosdok_id00005820</field><field name="purl">https://purl.uni-rostock.de/rosdok/id00005820</field><field name="ppn">1986180786</field><field name="doi">10.18453/rosdok_id00005820</field><field name="urn">urn:nbn:de:gbv:28-rosdok_id00005820-5</field><field name="ir.creator.result">Tobias Strauß, Roger Labahn, Gundram Leifert, Welf Wustlich</field><field name="ir.creator.sort">Strauß Tobias, Labahn Roger, Leifert Gundram, Wustlich Welf</field><field name="ir.title.result">An approach for output decoding of neural networks</field><field name="ir.doctype.result">Workingpaper</field><field name="ir.doctype_en.result">working paper</field><field name="ir.originInfo.result">University of Rostock, Institute of Mathematics, 2012</field><field name="ir.abstract300.result">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…</field><field name="ir.host.recordIdentifier">rosdok_id00005816</field><field name="ir.sortstring">0012-0003</field><field name="ir.seriesNumber.result">12/3</field><field name="ir.creator_all">Tobias Strauß</field><field name="ir.creator_all">Roger Labahn</field><field name="ir.creator_all">Gundram Leifert</field><field name="ir.creator_all">Welf Wustlich</field><field name="ir.title_all">An</field><field name="ir.title_all">approach for output decoding of neural networks</field><field name="ir.title_all">Preprints aus dem Institut für Mathematik</field><field name="ir.location_all">Universitätsbibliothek Rostock</field><field name="ir.location_all">https://purl.uni-rostock.de/rosdok/id00005820</field><field name="ir.creator_all">Tobias</field><field name="ir.creator_all">Strauß</field><field name="ir.creator_all">1984 -</field><field name="ir.creator_all"></field><field name="ir.creator_all">VerfasserIn</field><field name="ir.creator_all">aut</field><field name="ir.creator_all">1136294554</field><field name="ir.creator_all">0000-0002-5344-4188</field><field name="ir.creator_all">Roger</field><field name="ir.creator_all">Labahn</field><field name="ir.creator_all">1959 -</field><field name="ir.creator_all"></field><field name="ir.creator_all">VerfasserIn</field><field name="ir.creator_all">aut</field><field name="ir.creator_all">170999645</field><field name="ir.creator_all">0000-0003-1901-9644</field><field name="ir.creator_all">Gundram</field><field name="ir.creator_all">Leifert</field><field name="ir.creator_all"></field><field name="ir.creator_all">VerfasserIn</field><field name="ir.creator_all">aut</field><field name="ir.creator_all">Welf</field><field name="ir.creator_all">Wustlich</field><field name="ir.creator_all"></field><field name="ir.creator_all">VerfasserIn</field><field name="ir.creator_all">aut</field><field name="ir.identifier">[purl]https://purl.uni-rostock.de/rosdok/id00005820</field><field name="ir.identifier">[urn]urn:nbn:de:gbv:28-rosdok_id00005820-5</field><field name="ir.identifier">[doi]10.18453/rosdok_id00005820</field><field name="ir.oai.setspec.open_access">open_access</field><field name="ir.pubyear_start">2012</field><field name="ir.pubyear_end">2012</field><field name="ir.epoch_class.facet">epoch:21th_century</field><field name="ir.language_class.facet">rfc5646:en</field><field name="ir.doctype_class.facet">doctype:epub.workingpaper</field><field name="ir.accesscondition_class.facet">accesscondition:openaccess</field><field name="ir.sdnb_class.facet">SDNB:510</field><field name="ir.institution_class.facet">institution:unirostock.mnf</field><field name="ir.state_class.facet">state:published</field></doc></add>