Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Stoyan Mihov"'
Autor:
Stoyan Mihov, Klaus U. Schulz
Publikováno v:
Computational Linguistics, Vol 30, Iss 4 (2021)
Externí odkaz:
https://doaj.org/article/7a714e3b07e64abfb3f68b2cfa5d0a18
Publikováno v:
Computational Linguistics, Vol 26, Iss 1 (2021)
Externí odkaz:
https://doaj.org/article/8ba73a7f7c0f46358d85d8fe77045997
Publikováno v:
Computational Linguistics, Vol 32, Iss 3 (2021)
Externí odkaz:
https://doaj.org/article/70f594bfdea84cddac037f9eef1bc5c4
Publikováno v:
International Journal of Foundations of Computer Science. :1-27
This paper introduces a framework for building probabilistic models with subsequential failure transducers. We first show how various types of subsequential transducers commonly used in natural language processing are represented by conditional proba
Publikováno v:
ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
Publikováno v:
Conservation Evidence Journal. 19:15-20
The Dalmatian pelican Pelecanus crispus is a Near Threatened species of waterbird with populations in the wetlands of the Lower Danube River. Breeding populations declined due to habitat loss and wetland drainage and conservation efforts have focused
Publikováno v:
Journal of Natural History. 55:2279-2297
Publikováno v:
Theoretical Computer Science. 790:80-95
Algorithms for building bimachines from functional transducers found in the literature are based on the following principle: each run of the bimachine simulates a particular successful path of the input transducer. Every single bimachine output exact
Publikováno v:
Implementation and Application of Automata ISBN: 9783030791209
CIAA
CIAA
This paper introduces a framework for building probabilistic models with subsequential failure transducers. We first show how various types of subsequential transducers commonly used in natural language processing are represented by probabilistic and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::990ca079eecba0b34b4702f85bccaf08
https://doi.org/10.1007/978-3-030-79121-6_11
https://doi.org/10.1007/978-3-030-79121-6_11
Autor:
Klaus U. Schulz, Stoyan Mihov
In this chapter we present C(M) implementations of the main automata constructions. Our aim is to provide full descriptions of the implementations that are clear and easy to follow. In some cases the simplicity of the implementation is achieved at th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6da06dc13f74d2af7fa987730d9ba189
https://doi.org/10.1017/9781108756945.009
https://doi.org/10.1017/9781108756945.009