List of publications

 

Monograph

Stoyan Mihov and Klaus U. Schulz: Finite-State Techniques, Automata, Transducers and Bimachines, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 2019.


Papers

  1. 1.Geneva, D., Shopov, G., Garov, K., Todorova, M., Gerdjikov, S., Mihov, S.: Accentor: An Explicit Lexical Stress Model for TTS Systems, Proc. in INTERSPEECH 2023. DOI: 10.21437/Interspeech.2023-433
    PDF

  2. 2.Shopov, G., Gerdjikov, S., Mihov, S.: StreamSpeech: Low-Latency Neural Architecture for High-Quality On-Device Speech Synthesis, Proc. in ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing, ISBN:978-1-7281-6327-7, DOI: 10.1109/ICASSP49357.2023.10096566
    PDF

  3. 3.Geneva, D., Shopov, G., Mihov, S.. Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers. International Journal of Foundations of Computer Science, 2022,

  4. 4.Geneva, D., Shopov, G., Mihov, S., Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers, (2021) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 12803 LNCS, pp. 127-139.

  5. 5.Mihov, S., Schulz, K. U., F-Transducers for Contextual Text Rewriting. Journal of Automata, Languages and Combinatorics, 26, 3-4, 2021, ISSN:1430-189X, DOI:10.25596/jalc-2021-281, 281-332

  6. 6.Gerdjikov, S., Mihov, S., Schulz, K.U., Space-efficient bimachine construction based on the equalizer accumulation principle, (2019) Theoretical Computer Science, 790, pp. 80-95.

  7. 7.Geneva, D., Shopov, G., Mihov, S., Building an ASR Corpus Based on Bulgarian Parliament Speeches, (2019) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11816 LNAI, pp. 188-197.

  8. 8.Gerdjikov, S., Mihov, S., Schulz, K.U., A Simple Method for Building Bimachines from Functional Finite-State Transducers. 22nd International Conference, CIAA 2017; Marne-la-Vallee; France; (2017) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10329 LNCS, pp. 113-125.

  9. 9.Gerdjikov, S., Mihov, S., Over which monoids is the transducer determinization procedure applicable? 11th International Conference on Language and Automata Theory and Applications, LATA 2017; Umea; Sweden; (2017) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10168 LNCS, pp. 380-392.

  10. 10.Mihov S., Schulz K. U., Failure Transducers and Applications in Knowledge-Based Text Processing. Proceedings of the 13th International Conference on Finite State Methods and Natural Language Processing (FSMNLP 2017), pp 1-9.
    https://www.aclweb.org/anthology/W17-4001/

  11. 11.Hateva, N., Mitankin, P., Mihov, S., BulPhonC: Bulgarian Speech Corpus for the Development of ASR Technology. Proceedings of the Tenth International Conference on Language Resources and Evaluation (LREC 2016), 2016, ISBN:978-2-9517408-9-1, pp. 771-774

  12. 12.Mitankin, P., Mihov, S., A new method for real-time lattice rescoring in speech recognition, International Conference on Advanced Computing for Innovation, AComIn 2015; Sofia; Bulgaria; (2016) Studies in Computational Intelligence, 648, pp. 283-292.

  13. 13.Mitankin, P., Gerdjikov, S., Mihov, S., An approach to unsupervised historical text normalization, 1st International Conference on Digital Access to Textual Cultural Heritage, DATeCH 2014; Madrid; Spain; (2014) ACM International Conference Proceeding Series, pp. 29-34.

  14. 14.Sariev, A., Nenchev, V., Gerdjikov, S., Mitankin, P., Ganchev, H., Mihov, S., Tinchev, T., Flexible noisy text correction, (2014) Proceedings - 11th IAPR International Workshop on Document Analysis Systems, DAS 2014, art. no. 6830964, pp. 31-35.

  15. 15.Gerdjikov, S., Mihov, S., Mitankin, P., Schulz, K.U., WallBreaker - Overcoming the wall effect in similarity search. In: Proceeding EDBT '13, Proceedings of the Joint EDBT/ICDT 2013 Workshops, Pages 366-369.

  16. 16.Gerdjikov, S., Mihov, S., Nenchev, V., Extraction of Spelling Variations from Language Structure for Noisy Text Correction, In: 12th International Conference on Document Analysis and Recognition (ICDAR), 2013, ACM International Conference Proceeding Series, Pages: 324 - 328

  17. 17.Stefan Gerdjikov, Stoyan Mihov, Petar Mitankin, Klaus U. Schulz: Good parts first - a new algorithm for approximate search in lexica and string databases, arXiv:1301.0722

  18. 18.Mihov, S. and K. U. Schulz. Computation of Similarity - Similarity Search as Computation. In: Löwe, B.; Normann, D.; Soskov, I.; Soskova, A. (Eds.) Models of Computation in Context, Proc. of the 7th Int. Conf. on Computability in Europe, CiE 2011, Sofia, Bulgaria, June 27 - July 2, 2011, Springer, Lecture Notes in Computer Science, Volume 6735, 2011, pp. 201-210

  19. 19.Petar Mitankin, Stoyan Mihov, Klaus U. Schulz: Deciding word neighborhood with universal neighborhood automata, Theoretical Computer Science, Volume 412, Issue 22, 2011, Pages 2340-2355, doi:10.1016/j.tcs.2011.01.013 (IF: 0.643)

  20. 20.Petar Mitankin, Stoyan Mihov, Tinko Tinchev: Large vocabulary continuous speech recognition for Bulgarian, Proceedings of the RANLP 2009, Borovets, September 2009.
    PDF file (1.3MB)

  21. 21.Стоян Михов, Тинко Тинчев, Петър Митанкин: Влиянието на езиковия модел върху качеството на система за разпознаване на българска реч, Български език, ISSN 0005-4283, LVI(3), pp. 17-33, 2009.

  22. 22.Petar Mitankin, Stoyan Mihov and Klaus U. Schulz: Universal levenshtein automata for a generalization of the levenshtein distance, Annuaire de l'Universite de Sofia "St. Kl. Ohridski", Faculte de Mathematique et Informatique, Volume 99, pp. 5-23, 2009

  23. 23.Angelova, G. and S. Mihov: Conceptual Information Compression and Efficient Pattern Search. Serdica Journal of Computing, ISSN 1312-6555, Vol. 2 (2008), pp. 369-402.

  24. 24.Angelova, G. and S. Mihov: Finite State Automata and Simple Conceptual Graphs with Binary Conceptual Relations. In: Eklund, P. and O. Haemmerle (Eds.), Supplementary Proceedings of the 16th International Conference on Conceptual Structures (ICCS'08), Toulouse, France, CEUR Workshop Proceedings 2008, pp. 139-148.
    PDF file (330K)

  25. 25.Hristo Ganchev, Stoyan Mihov and Klaus U. Schulz: One-Letter Automata: How to Reduce k Tapes to One. in Firtz Hamm and Stephan Kepser (eds.). Logics for Linguistic Structures,. Trends in Linguistics 201, pp.35-56, Mouton de Gruyter, 2008
    book

  26. 26.Stoyan Mihov, Klaus U. Schulz: Efficient dictionary-based Text rewriting using subsequential transducers. Natural Language Engineering, Volume 13, Issue 04, pp 353-381, December 2007. (IF: 0.886)

  27. 27.Christoph Ringlstetter, Klaus U. Schulz and Stoyan Mihov: Adaptive text correction with Web-crawled domain-dependent dictionaries. ACM Transactions on Speech and Language Processing (TSLP), Volume 4, Issue 4, pp. 9:1-9:36, October 2007.

  28. 28.Stoyan Mihov, Petar Mitankin, Annette Gotscharek, Ulrich Reffle, Klaus U. Schulz, and Christoph Ringlstetter: Using Automated Error Profiling of Texts for Improved Selection of Correction Candidates for Garbled Tokens. Proceedings of the Twentieth Australian Joint Conference on Artificial Intelligence (AI07). Goldcoast, Australia, December 2007. M.A. Orgun and J. Thornton (Eds.): Lecture Notes in Artificial Intelligence 4830, pp. 456-465, Springer-Verlag Berlin Heidelberg 2007.

  29. 29.Stoyan Mihov, Petar Mitankin, Annette Gotscharek, Ulrich Reffle, Klaus U. Schulz, and Christoph Ringlstetter: Tuning the Selection of Correction Candidates for Garbled Tokens using Error Dictionaries, Proceedings of FSTAS 2007, pp. 25-30, Septmber 2007.

  30. 30.Klaus U. Schulz , Stoyan Mihov and Petar Mitankin: Fast Selection of Small and Precise Candidate Sets from Dictionaries for Text Correction Tasks. Proceedings of the ICDAR 2007, Vol 1, pp. 471-475, September 2007.

  31. 31.Christoph Ringlstetter, Max Hadersbeck, Klaus U. Schulz and Stoyan Mihov: Text Correction Using Domain Dependent Bigram Models from Web Crawls, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-2007) Workshop on Analytics for Noisy Unstructured Text Data, pp. 47-54, Hyderabad, India, January 2007.

  32. 32.Christoph Ringlstetter, Klaus U. Schulz and Stoyan Mihov: Orthographic Errors in Web Pages - Towards Cleaner Web Corpora. Computational Linguistics, September 2006, Vol. 32(3), pp. 295-340. (IF: 2.017)
    PDF file (900K)

  33. 33.Maria Andreeva, Ivaylo Marinov and Stoyan Mihov: SpeechLab 2.0 -- A High-Quality Text-to-Speech System for Bulgarian, Proceedings of the RANLP 2005, pp. 52 -- 58, Borovets, September 2005.
    PDF file (196K)

  34. 34.Stoyan Mihov, Klaus U. Schulz, Christoph Ringlstetter, Veselka Dojchinova, Vanja Nakova, Kristina Kalpakchieva, Ognjan Gerasimov, Annette Gotschareck, and Claudia Gehrcke: A Corpus for Comparative Evaluation of OCR Software and Postcorrection Techniques, Proceedings of the ICDAR 2005, pp. 162 -- 166, Seoul, September 2005.
    PDF file (265K)

  35. 35.Christoph Ringlstetter, Stoyan Mihov, Klaus U. Schulz, and Katerina Louka: The Same is Not The Same - Postcorrection of Alphabet Confusion Errors in Mixed-Alphabet OCR Recognition, Proceedings of the ICDAR 2005, pp. 406 -- 410, Seoul, September 2005.
    PDF file (187K)

  36. 36.Stoyan Mihov, Klaus U. Schulz: Fast Approximate Search in Large Dictionaries. Computational Linguistics, Volume 30, Issue 4, pp. 451 -- 477, December 2004. (IF: 2.017)
    PDF file (448K)

  37. 37.Veselka Doychinova, Stoyan Mihov: High Performance Part-of-Speech Tagging of Bulgarian. Proceedings of Eleventh International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA-2004), Lecture Notes in Artificial Intelligence #3192, pp. 246-255, 2004.
    Abstract, PDF file (191K)

  38. 38.Stoyan Mihov, Svetla Koeva, Christoph Ringlstetter, Klaus U. Schulz, Christian Strohmaier: Precise and Effcient Text Correction using Levenshtein Automata, Dynamic Web Dictionaries and Optimized Correction Models. Proceedings of Workshop on International Proofing Tools and Language Technologies, Patras, Greece, 2004.
    PDF file (136K)

  39. 39.Svetla Koeva, Stoyan Mihov, Tinko Tinchev: Bulgarian Wordnet – Structure and Validation, Romanian Journal of Information Science and Technology, Volume 7, Numbers 1–2, pp. 61-78, 2004. (IF: 0.269)
    PDF file (208K)

  40. 40.Hristo Ganchev, Stoyan Mihov and Klaus U. Schulz: One-Letter Automata: How to Reduce k Tapes to One. CIS-Bericht, Centrum fur Informations- und Sprachverarbeitung, Universitaet Munchen, 2003.
    PDF file (136K)

  41. 41.Christian Strohmaier, Christoph Ringlstetter, Klaus U. Schulz and Stoyan Mihov, A visual and interactive tool for optimizing lexical postcorrection of OCR-results. Proceedings of the Workshop on Document Image Analysis and Retrieval DIAR'03.
    PDF file (170KB)

  42. 42.Tinko Tinchev, Stoyan Mihov, Svetla Koeva, Angel Genov, Logic for WordNet. Annuaire Univ. Sofia, Fac. Math. Inf., vol. 95, 2002 (in print).

  43. 43.Christian Strohmaier, Christoph Ringlstetter, Klaus U. Schulz and Stoyan Mihov, Lexical postcorrection of OCR-results: The web as a dynamic secondary dictionary? Proceedings of the 7th International Conference on Document Analysis and Recognition ICDAR'03, pp. 1133 - 1137, 2003.
    PDF file (81KB)

  44. 44.Klaus U. Schulz, Stoyan Mihov: Fast string correction with Levenshtein automata, International Journal on Document Analysis and Recognition, Volume 5, Issue 1, Nov 2002, Pages 67 - 85
    Paper

  45. 45.Stoyan Mihov, Denis Maurel, Direct Construction of Minimal Acyclic Subsequential Transducers, Implementation and Application of Automata, S. Yu, A. Pun (Eds.), Lecture Notes in Computer Science 2088, Springer 2001, pp 217-229.
    gzipped postscript (140KB)

  46. 46.Klaus U. Schulz and Stoyan Mihov, Fast String Correction with Levenshtein-Automata. CIS-Bericht-01-127, Centrum fur Informations- und Sprachverarbeitung, Universitat Munchen, 2001.
    gzipped postscript (194KB)

  47. 47.Stoyan Mihov, Denis Maurel, Direct Construction of Minimal Acyclic Subsequential Transducers, proceedings of Conference on Implementation and Application of Automata CIAA'2000, pp. 147 -- 156, London, Ontario, Canada, July 24-26, 2000.

  48. 48.Jan Daciuk, Stoyan Mihov, Bruce Watson and Richard Watson, Incremental Construction of Minimal Acyclic Finite State Automata, Computational Linguistics, Volume 26, Issue 1, pp. 3 -- 16, March 2000. (IF: 2.017)
    Abstract, PDF file (872KB)

  49. 49.Svetla Koeva, Stoyan Mihov, Intex 4.0 for Bulgarian. Error checking as an Intex application. Revue Informatique et Statistiques dans les Sciences humaines (RISSH) 36, A. Dister (ed.), CIPL, University of Liege, 2000, pp. 231-240.
    PDF file(1.1MB)

  50. 50.Stoyan Mihov, Minimal Acyclic Automata: Constructions, Algorithms, Applications, Ph.D. dissertation, Bulgarian Academy of Sciences.
    Original version (in Bulgarian) gziped postscript (450KB)

  51. 51.Stoyan Mihov, Direct Construction of Minimal Acyclic Finite States Automata, Annuaire de l'Universite de Sofia ``St. Kl. Ohridski", Faculte de Mathematique et Informatique, volume 92, livre 2, pp. 87 -- 104, 1998.
    Abstract , postscript (133KB)

  52. 52.Stoyan Mihov, Direct Building of Minimal Automaton for Given List, Annuaire de l'Universite de Sofia ``St. Kl. Ohridski", Faculte de Mathematique et Informatique, volume 91, livre 1, pp.33 -- 40, 1997.
    postscript (626KB) , gzipped postscript (64KB)

  53. 53.Elena Paskaleva, Stoyan Mihov, Second Language Acquisition from Aligned Corpora, Language Teaching and Language Technology, Sake Jager, John A. Nerbonne, A. J. van Essen (Eds.), Swets & Zeitlinger Lisse, The Netherlands, pp. 43 -- 52, 1998
    postscript (2.5MB) , gzipped postscript (120KB)

  54. 54.Stoyan Mihov, Automatic Extraction of Translation Equivalents from Aligned Corpora of Legal Texts, Proceedings of the Third European Seminar "Translation Equivalence", pp. 175 -- 181, Montecatini Terme, October 1997.
    zipped WinWord doc file (89KB)

  55. 55.Stoyan Mihov, MARK ALISTeR: MARKing, ALIgning and Searching TRanslation equivalents, Proceedings of the Second European Seminar "Language Applications for a Multilingual Europe", pp. 91 -- 97, Kaunas, April 1997.
    zipped WinWord doc file (130KB)

  56. 56.Stoyan Mihov, A Constraint Based System for Lexical Knowledge Retrieval, Proceedings of the Forth Logic Biannual, Govedartzi, September 1996. Annuaire de l'Universite de Sofia ``St. Kl. Ohridski", Faculte de Mathematique et Informatique, volume 90, livre 1, pp. 141 -- 148, 1996
    postscript (82KB)

  57. 57.Atanassov K., Mihov S., Peretti A., Computer calculus related to some problems in number theory (4), Notes on Number Theory and Discrete Mathematics, Vol. 1, 1995, No. 2, 71-92.

  58. 58.Atanassov K., Mihov S., Peretti A., Computer calculus related to some problems in number theory (3), Notes on Number Theory and Discrete Mathematics, Vol. 1, 1995, No. 1, 48-50.

  59. 59.Mihov S., R. Christov, On the possibility for a parallel implementation of the generalized nets, Proceedings of the 39 Internationales Wissenschaftliches Kolloquium, Ilmenau, Sept. 27-30, 1994, Band 1, 576-579.

  60. 60.Stoyan Mihov, Co-Regular Languages and Unification of Co-Regular Languages, Master of Sciences Thesis, Sofia University, December 1993 (in Bulgarian).
    abridged English version postscript (130KB)

  61. 61.Vassilev M., Atanassov K., Mihov S., Shannon A., Some solved and unsolved problems on Euler's j-function, Preprint MRL-3-93, IPACT Sofia, 1993

  62. 62.Christov R. and S. Mihov, Software tools for the GNs, in Applications of generalized nets, (K. Atanassov, Ed.), World Scientific, Singapore, London, New Jersey, 1993, 340-348.

  63. 63.Atanassov K., Mihov S., Peretti A., Computer calculus related to some problems in number theory (2), Bulletin of Number Theory, Vol. XVI, 1992, 145-148.

  64. 64.Atanassov K., Mihov S., Peretti A., Computer calculus related to some problems in number theory (1), Bulletin of Number Theory, Vol. XVI, 1992, 133-139.

  65. 65.Atanassov K., Mihov S., Peretti A., On polynomials with prime number values, Bulletin of Number Theory, Vol. XVI, 1992, 125-132.

  66. 66.Atanassov K., Hlebarska J., Mihov S., Recurrent formulas of the generalized Fibonacci and Tribonacci sequences, The Fibonacci Quarterly, Vol. 30 (1992), No. 1, 77-79, (IF: 0.14)

  67. 67.Mihov S., A realization of the functions and predicates of generalized net in the simulator of PPGN for PC, First Sci. Session of the Math. Found. AI Seminar, Sofia, Oct. 10, 1989, 43-44.