default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStoyan Mihov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Diana Geneva, Georgi Shopov
, Stoyan Mihov:
Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers. Int. J. Found. Comput. Sci. 34(8): 1023-1049 (2023)- [c23]Georgi Shopov, Stefan Gerdjikov, Stoyan Mihov:
StreamSpeech: Low-Latency Neural Architecture for High-Quality on-Device Speech Synthesis. ICASSP 2023: 1-5 - [c22]Diana Geneva, Georgi Shopov, Kostadin Garov, Maria Todorova, Stefan Gerdjikov, Stoyan Mihov:
Accentor: An Explicit Lexical Stress Model for TTS Systems. INTERSPEECH 2023: 4848-4852 - 2021
- [j9]Stoyan Mihov, Klaus U. Schulz:
F-Transducers for Contextual Text Rewriting. J. Autom. Lang. Comb. 26(3-4): 281-332 (2021) - [c21]Diana Geneva, Georgi Shopov, Stoyan Mihov:
Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers. CIAA 2021: 127-139 - 2020
- [i5]Diana Geneva, Georgi Shopov, Stoyan Mihov:
Composition and Weight Pushing of Monotonic Subsequential Failure Transducers Representing Probabilistic Models. CoRR abs/2003.09364 (2020)
2010 – 2019
- 2019
- [j8]Stefan Gerdjikov, Stoyan Mihov, Klaus U. Schulz:
Space-efficient bimachine construction based on the equalizer accumulation principle. Theor. Comput. Sci. 790: 80-95 (2019) - [c20]Diana Geneva, Georgi Shopov, Stoyan Mihov:
Building an ASR Corpus Based on Bulgarian Parliament Speeches. SLSP 2019: 188-197 - 2018
- [i4]Stefan Gerdjikov, Stoyan Mihov, Klaus U. Schulz:
Space-Efficient Bimachine Construction Based on the Equalizer Accumulation Principle. CoRR abs/1803.04312 (2018) - 2017
- [c19]Stoyan Mihov, Klaus U. Schulz:
Failure Transducers and Applications in Knowledge-Based Text Processing. FSMNLP 2017: 1-9 - [c18]Stefan Gerdjikov, Stoyan Mihov:
Over Which Monoids is the Transducer Determinization Procedure Applicable? LATA 2017: 380-392 - [c17]Stefan Gerdjikov, Stoyan Mihov, Klaus U. Schulz:
A Simple Method for Building Bimachines from Functional Finite-State Transducers. CIAA 2017: 113-125 - [i3]Stefan Gerdjikov, Stoyan Mihov:
Myhill-Nerode Relation for Sequentiable Structures. CoRR abs/1706.02910 (2017) - 2016
- [c16]Neli Hateva, Petar Mitankin, Stoyan Mihov:
BulPhonC: Bulgarian Speech Corpus for the Development of ASR Technology. LREC 2016 - 2014
- [c15]Andrey Sariev, Vladislav Nenchev, Stefan Gerdjikov, Petar Mitankin, Hristo Ganchev, Stoyan Mihov, Tinko Tinchev:
Flexible Noisy Text Correction. Document Analysis Systems 2014: 31-35 - [c14]Petar Mitankin, Stefan Gerdjikov, Stoyan Mihov:
An approach to unsupervised historical text normalisation. DATeCH 2014: 29-34 - 2013
- [c13]Stefan Gerdjikov, Stoyan Mihov, Petar Mitankin, Klaus U. Schulz:
WallBreaker: overcoming the wall effect in similarity search. EDBT/ICDT Workshops 2013: 366-369 - [c12]Stefan Gerdjikov, Stoyan Mihov, Vladislav Nenchev:
Extraction of Spelling Variations from Language Structure for Noisy Text Correction. ICDAR 2013: 324-328 - [i2]Stefan Gerdjikov, Stoyan Mihov, Petar Mitankin, Klaus U. Schulz:
Good parts first - a new algorithm for approximate search in lexica and string databases. CoRR abs/1301.0722 (2013) - 2011
- [j7]Petar Mitankin, Stoyan Mihov, Klaus U. Schulz:
Deciding word neighborhood with universal neighborhood automata. Theor. Comput. Sci. 412(22): 2340-2355 (2011) - [c11]Stoyan Mihov, Klaus U. Schulz:
Computation of Similarity - Similarity Search as Computation. CiE 2011: 201-210
2000 – 2009
- 2009
- [c10]Petar Mitankin, Stoyan Mihov, Tinko Tinchev:
Large Vocabulary Continuous Speech Recognition for Bulgarian. RANLP 2009: 246-250 - 2008
- [c9]Galia Angelova, Stoyan Mihov:
Finite State Automata and Simple Conceptual Graphs with Binary Conceptual Relations. ICCS Supplement 2008: 139-148 - 2007
- [j6]Stoyan Mihov, Klaus U. Schulz:
Efficient dictionary-based text rewriting using subsequential transducers. Nat. Lang. Eng. 13(4): 353-381 (2007) - [j5]Christoph Ringlstetter, Klaus U. Schulz, Stoyan Mihov:
Adaptive text correction with Web-crawled domain-dependent dictionaries. ACM Trans. Speech Lang. Process. 4(4): 9 (2007) - [c8]Stoyan Mihov, Petar Mitankin, Annette Gotscharek, Ulrich Reffle, Klaus U. Schulz, Christoph Ringlstetter:
Using Automated Error Profiling of Texts for Improved Selection of Correction Candidates for Garbled Tokens. Australian Conference on Artificial Intelligence 2007: 456-465 - [c7]Klaus U. Schulz, Stoyan Mihov, Petar Mitankin:
Fast Selection of Small and Precise Candidate Sets from Dictionaries for Text Correction Tasks. ICDAR 2007: 471-475 - 2006
- [j4]Christoph Ringlstetter, Klaus U. Schulz, Stoyan Mihov:
Orthographic Errors in Web Pages: Toward Cleaner Web Corpora. Comput. Linguistics 32(3): 295-340 (2006) - 2005
- [c6]Stoyan Mihov, Klaus U. Schulz, Christoph Ringlstetter, Veselka Dojchinova, Vanja Nakova:
A Corpus for Comparative Evaluation of OCR Software and Postcorrection Techniques. ICDAR 2005: 162-166 - [c5]Christoph Ringlstetter, Klaus U. Schulz, Stoyan Mihov, Katerina Louka:
The Same is Not The same - Post Correction of Alphabet Confusion Errors in Mixed-Alphabet OCR Recognation. ICDAR 2005: 406-410 - 2004
- [j3]Stoyan Mihov, Klaus U. Schulz:
Fast Approximate Search in Large Dictionaries. Comput. Linguistics 30(4): 451-477 (2004) - [c4]Veselka Dojchinova, Stoyan Mihov:
High Performance Part-of-Speech Tagging of Bulgarian. AIMSA 2004: 246-255 - 2003
- [c3]Christian M. Strohmaier, Christoph Ringlstetter, Klaus U. Schulz, Stoyan Mihov:
A visual and interactive tool for optimizing lexical postcorrection of OCR results. CVPR Workshops 2003: 32 - [c2]Christian M. Strohmaier, Christoph Ringlstetter, Klaus U. Schulz, Stoyan Mihov:
Lexical Postcorrection of OCR-Results: The Web as a Dynamic Secondary Dictionary? ICDAR 2003: 1133-1137 - 2002
- [j2]Klaus U. Schulz, Stoyan Mihov:
Fast string correction with Levenshtein automata. Int. J. Document Anal. Recognit. 5(1): 67-85 (2002) - 2000
- [j1]Jan Daciuk, Stoyan Mihov, Bruce W. Watson, Richard E. Watson:
Incremental Construction of Minimal Acyclic Finite State Automata. Comput. Linguistics 26(1): 3-16 (2000) - [c1]Stoyan Mihov, Denis Maurel:
Direct Construction of Minimal Acyclic Subsequential Transducers. CIAA 2000: 217-229 - [i1]Jan Daciuk, Stoyan Mihov, Bruce W. Watson, Richard E. Watson:
Incremental construction of minimal acyclic finite-state automata. CoRR cs.CL/0007009 (2000)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
