default search action
Search dblp for Publications
export results for "toc:db/journals/pbml/pbml105.bht:"
@article{DBLP:journals/pbml/EgerBM16, author = {Steffen Eger and Tim vor der Br{\"{u}}ck and Alexander Mehler}, title = {A Comparison of Four Character-Level String-to-String Translation Models for {(OCR)} Spelling Error Correction}, journal = {Prague Bull. Math. Linguistics}, volume = {105}, pages = {77--100}, year = {2016}, url = {http://ufal.mff.cuni.cz/pbml/105/art-eger-vor-der-brueck.pdf}, timestamp = {Thu, 23 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pbml/EgerBM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pbml/Ferrandez-Tordera16, author = {Jorge Ferr{\'{a}}ndez{-}Tordera and Sergio Ortiz{-}Rojas and Antonio Toral}, title = {CloudLM: a Cloud-based Language Model for Machine Translation}, journal = {Prague Bull. Math. Linguistics}, volume = {105}, pages = {51--62}, year = {2016}, url = {http://ufal.mff.cuni.cz/pbml/105/art-ferrandez-tordera-ortiz-rojas-toral.pdf}, timestamp = {Thu, 23 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pbml/Ferrandez-Tordera16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pbml/Guinard16, author = {Theresa Guinard}, title = {An Algorithm for Morphological Segmentation of Esperanto Words}, journal = {Prague Bull. Math. Linguistics}, volume = {105}, pages = {63--76}, year = {2016}, url = {http://ufal.mff.cuni.cz/pbml/105/art-guinard.pdf}, timestamp = {Thu, 23 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pbml/Guinard16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pbml/LeeuwenbergVDG16, author = {Artuur Leeuwenberg and Mihaela Vela and Jon Dehdari and Josef van Genabith}, title = {A Minimally Supervised Approach for Synonym Extraction with Word Embeddings}, journal = {Prague Bull. Math. Linguistics}, volume = {105}, pages = {111--142}, year = {2016}, url = {http://ufal.mff.cuni.cz/pbml/105/art-leeuwenberg-et-al.pdf}, timestamp = {Thu, 23 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pbml/LeeuwenbergVDG16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pbml/MarecekZ16, author = {David Marecek and Zdenek Zabokrtsk{\'{y}}}, title = {Gibbs Sampling Segmentation of Parallel Dependency Trees for Tree-Based Machine Translation}, journal = {Prague Bull. Math. Linguistics}, volume = {105}, pages = {101--110}, year = {2016}, url = {http://ufal.mff.cuni.cz/pbml/105/art-marecek-zabokrtsky.pdf}, timestamp = {Thu, 23 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pbml/MarecekZ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pbml/UresovaFS16, author = {Zdenka Uresov{\'{a}} and Eva Fuc{\'{\i}}kov{\'{a}} and Jana Sindlerov{\'{a}}}, title = {CzEngVallex: a Bilingual Czech-English Valency Lexicon}, journal = {Prague Bull. Math. Linguistics}, volume = {105}, pages = {17--50}, year = {2016}, url = {http://ufal.mff.cuni.cz/pbml/105/art-uresova-fucikova-sindlerova.pdf}, timestamp = {Thu, 23 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pbml/UresovaFS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pbml/Zeman16, author = {Daniel Zeman}, title = {Universal Annotation of Slavic Verb Forms}, journal = {Prague Bull. Math. Linguistics}, volume = {105}, pages = {143--193}, year = {2016}, url = {http://ufal.mff.cuni.cz/pbml/105/art-zeman.pdf}, timestamp = {Thu, 23 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pbml/Zeman16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.