Jan Daciuk

Publications

THESES

BOOKS AND BOOK CHAPTERS

  1. Jan Daciuk, Optimization of Automata, Gdańsk University of Technology Publishing House, 2014.

  2. Jan Daciuk, Incremental Construction of Finite-State Automata, in: Handbook of Finite State Based Models and Applications, Jiacun Wang (ed.), pp. 171-190, CRC Press, 2013.

  3. Jan Daciuk, Przetwarzanie języka naturalnego (Natural language processing), in: Bodgan Wiszniewski (ed.), Inteligentne wydobywanie informacji z internetowych serwisów społecznościowych (Intelligent information extraction from internet services), Pomorskie Wydawnictwo Naukowo-Techniczne, 2011.

  4. Jan Daciuk, Mariusz Szwoch, Automaty jako narzędzia w przetwarzaniu języka (Automata as tools in natural language processing), in: Bodgan Wiszniewski (ed.), Inteligentne wydobywanie informacji z internetowych serwisów społecznościowych (Intelligent information extraction from internet services), Pomorskie Wydawnictwo Naukowo-Techniczne, 2011.

  5. Jan Daciuk, Jakub Piskorski, Strahil Ristov, Natural Language Dictionaries Implemented as Finite Automata, in: Scientific Applications of Language Methods, Carlos Martín-Vide (ed.), pp. 133-204, Imperial College Press, 2010.

PAPERS
  1. Jan Daciuk, Preserving Trees in Minimal Automata, proceedings of FSMNLP 2015, Düsseldorf, Germany, June 2015

  2. Jan Daciuk, Dawid Weiss, Smaller representation of finite-state automata, Theoretical Computer Science, vol. 450, pp. 10-21, 7 September 2012.

  3. Jan Daciuk, Dawid Weiss, Smaller Representation of Finite State Automata, in: Implementation and Application of Automata. 16th International Conference, CIAA 2011, Blois, France, July 2011. Proceeedings, Beatrice Bouchou-Markhoff, Pascal Caron, Jean-Marc Champarnaud, Denis Maurel (eds.), LNCS 6807, Springer, 2011.

  4. Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada, Incremental Construction of Minimal Tree Automata, Algorithmica, Volume 55, Number 1, pp. 95-110, September 2009.

  5. Rafael C. Carrasco, Jan Daciuk, A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata, RAIRO - Theoretical Informatics and Applications, Volume 43, Issue 04, pp 779-790, DOI: http://dx.doi.org/10.1051/ita/2009018, October 2009.

  6. Jan Daciuk, Rafael C. Carrasco, Perfect Hashing with Pseudo-minimal Bottom-up Deterministic Tree Automata, Intelligent Information Systems XVI, Proceedings of the International IIS'08 Conference held in Zakopane, Poland, June 16-18, 2008, Mieczysław A. Kłopotek, Adam Przepiórkowski, Sławomir T. Wierzchoń, Krzysztof Trojanowski (eds.), Academic Publishing House Exit, Warszawa 2008.

  7. Jan Daciuk, Perfect Hashing Tree Automata, FSMNLP 2007, Potsdam, Germany, 2007.

  8. Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada, An Implementation of Deterministic Tree Automata Minimization, Implementation and Application of Automata. 12th International Conference, CIAA 2007, Prague, Czech Republic, July 2007, Revised Selected Papers, Jan Holub, Jan Zdarek (eds.), LNCS 4783, Springer 2007.

  9. Jan Daciuk, Jakub Piskorski, Gazetteer compression technique based on substructure recognition, In: Intelligent information processing and web mining, Proceedings of the International IIS:IIPWM'06 Conference held in Ustroń, Poland, June 19-22, 2006, pp. 87-95, Springer Verlag, Advances in Soft Computing, 2006.

  10. Denis Maurel, Jan Daciuk, Les transducteurs a sorties variables, Verbum ex machina, Actes de la 13eme conference annuelle sur le traitement des langues naturelles, Piet Mertens, Cedrick Fairon, Anne Dister, Patrick Watrin (eds.), pp. 237-245, volume 1, UCL Presses Universitaires de Louvain, Louvain, Belgium, 10-13 April 2006.

  11. Jan Daciuk, Denis Maurel, Agata Savary, Incremental and Semi-incremental Construction of Pseudo-Minimal Automata, Implementation and Application of Automata: 10th International Conference, CIAA 2005, Sophia Antipolis, France, June 27-29, 2005, Revised Selected Papers, pp. 341-342, Jacques Farre, Igor Litovsky, Sylvain Schmitz, LNCS Vol. 3845/2006, Springer 2006.

  12. Jan Daciuk, Denis Maurel, Agata Savary, Dynamic Perfect Hashing with Finite-State Automata, in Intelligent Information Processing and Web Mining, Proceedings of the International IIS: IIPWM'05 Conference held in Gdańsk, Poland, June 13-16, 2005, Mieczysław A. Kłopotek, Sławomir Wierzchoń, Krzysztof Trojanowski (eds.), Advances in Soft Computing, Springer, 2005.

  13. Jan Daciuk, Extension of Selected ADFA Construction Algorithms to the Case of Cyclic Automata, Eindhoven FASTAR Days 2004, Eindhoven, the Netherlands, September 2004.

  14. Jan Daciuk, Comments on Incremental Construction and Maintenance of Minimal Finite-State Automata, by Rafael C. Carrasco and Mikel L. Forcada, Computational Linguistics, 30(2), pp. 227-235, June 2004.

  15. Jan Daciuk, Semi-incremental Addition of Strings to a Cyclic Finite Automaton, Intelligent Information Processing and Web Mining, Proceedings of the International IIS: IIP WM'04 Conference held in Zakopane, Poland, May 17-20, 2004. Advances in Soft Computing, pp. 201-207, Mieczysław A. Kłopotek, Sławomir T. Wierzchoń, Krzysztof Trojanowski (eds.), Springer-Verlag, 2004.

  16. Jan Daciuk, Finite-State Lexical Tools, BIS 2004, 7th International Conference on Business Information Systems, pp. 373-380, Witold Abramowicz (ed.), Wydawnictwo Akademii Ekonomicznej w Poznaniu, Poznań, Poland, 21-23 April, 2004.

  17. Jan Daciuk, Gertjan van Noord, Finite automata for compact representation of tuple dictionaries, Theoretical Computer Science, 313(1), 16 Feb., 2004

  18. Bruce W. Watson, Jan Daciuk, An efficient incremental DFA minimization algorithm, Natural Language Engineering, 9(1), pp. 49-64, Cambridge University Press, March 2003.

  19. Jan Daciuk, Semi-Incremental Construction of Minimal Cyclic Finite-State Automata Using Continuation Classes, Proceeding of the Workshop on Finite-State Methods in Natural Language Processing at the 10th Conference of the European Chapter of the Association for Computational Linguistics, Budapest, Hungary, April 13th-14th, 2003.

  20. Jan Daciuk, Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings, Seventh International Conference on Implementation and Application of Automata CIAA '2002, Tours, France, 2002. (C) Springer Verlag LNCS Series 2608, pp. 255-261, January 2003.

  21. Jan Daciuk, Computer-Assisted Enlargement of Morphological Dictionaries, Finite State Methods in Natural Language Processing, Workshop at 13th European Summer School in Logic, Language and Information, Helsinki, Finland, 13-24 August, 2001.

  22. Jan Daciuk, Gertjan van Noord, Finite Automata for Compact Representation of Language Models in NLP, Sixth International Conference on Implementation and Application of Automata, CIAA'2001, Pretoria, South Africa, July 23-25, 2001. (C) Springer Verlag LNCS Series 2494, pp. 65-73, 2003.

  23. Jan Daciuk, Finite State Tools for Natural Language Processing, proceedings of the COLING 2000 workshop Using Toolsets and Architectures to Build NLP Systems, pp. 34-37, Centre Universitaire, Luxembourg, August 5th, 2000.

  24. Jan Daciuk, Experiments with Automata Compression, proceedings of Conference on Implementation and Application of Automata CIAA'2000, London, Ontario, Canada, July 24-26, 2000, (C) Springer Verlag LNCS Series 2088, pp. 105-112, 2001.

  25. Jan Daciuk, Stoyan Mihov, Bruce Watson, and Richard Watson, Incremental Construction of Minimal Acyclic Finite State Automata, Computational Linguistics, 26(1), pp. 3-16, March 2000.

  26. Jan Daciuk, Treatment of Unknown Words, proceedings of Workshop on Implementing Automata WIA'99, Potsdam, Germany, 1999, (C) Springer Verlag LNCS Series Volume 2214, pp. 71-80, 2001.

  27. Jan Daciuk, A Module for Treatment of Unknown Words, Speech and Language Technology, Wiktor Jassem, Czesław Basztura, Grażyna Demenko and Krzysztof Jassem (eds.), Volume 3, pp. 165-169, Poznań, Poland, 1999.

  28. Jan Daciuk, Bruce Watson, and Richard Watson, Incremental Construction of Minimal Acyclic Finite State Automata and Transducers, proceedings of Finite State Methods in Natural Language Processing, pp. 48-56, Bilkent University, Ankara, Turkey, June 29 - July 1, 1998.

  29. Jan Daciuk, Finite-State Automata in Document Retrieval, Intelligent Information Systems VII, Proceedings of the Workshop held in Malbork, Poland, June 15-19, 1998.

  30. Jan Daciuk, Dopisywanie polskich znaków diakrytycznych za pomocą automatów (Restoring Polish diacritics using automata), Krajowe Sympozjum Telekomunikacji (State Symposium of Telecommunication), Bydgoszcz, 1997.

  31. Jan Daciuk, Automaty jedno- i dwupoziomowe w przetwarzaniu języka naturalnego (Automata and Transducers in Natural Language Processing), proceedings of Informatyka na Wyższych Uczelniach dla Gospodarki Narodowej (Computer Science at Universities for National Economy), Gdańsk, 1996.

  32. Jan Daciuk, Wspomagana komputerowo korekta tekstów pisanych w języku polskim (Computer Aided Correction of Texts Written in Polish), Seminarium Język i Technologia 1995 (Language and Technology Seminar 1995), Poznań, 1995.

  33. Jan Daciuk, Zastosowania przetwarzania języka naturalnego (Natural Language Processing Applications), proceedings of Informatyka na Wyższych Uczelniach dla Gospodarki Narodowej (Computer Science at Universities for National Economy), Gdańsk, 1994.

  34. Jan Daciuk, Andrzej Jędruch, Statystyczna metoda polonizacji tekstów (Statistical Method of Restoring Diacritics in Texts in Polish), Krajowe Sympozjum Telekomunikacji (State Symposium of Telecommunication), Bydgoszcz, 1994.

  35. Andrzej Guziński, Andrzej Borzyszkowski, Jan Daciuk, and Maciej Guziński, Application of the CITIUS System to Teaching Electronic Circuits, "III Seminarium Zastosowanie komputerów w dydaktyce '93" (3rd Seminar "Application of Computers in Didactics '93", Zeszyty Naukowe Wydziału Elektrycznego Politechniki Gdańskiej (Scientific Papers of the Electric Faculty of the Technical University of Gdańsk) No 3, Gdańsk, 1993.

  36. Andrzej Guziński , Andrzej Borzyszkowski , Jan Daciuk, and Maciej Guziński, CITIUS CAT System. Part II: Lecture Presentation Program, Fourth CITIUS Workshop, Gdańsk, 1993.

  37. Andrzej Guziński, Andrzej Borzyszkowski , Jan Daciuk, and Maciej Guziński, CITIUS CAT System. Part I; Lecture Preparation System, Third Citius Workshop, Mulhouse, 1992.

  38. Jan Daciuk, Andrzej Borzyszkowski , and Andrzej Guziński, and Maciej Guziński , CITIUS Computer Aided Teaching System, Second CITIUS Workshop, Gdańsk, 1992.

  39. Andrzej Guziński , Jan Daciuk, and Maciej Guziński, CAT of Electronic Circuits, First CITIUS Workshop, Strasbourg - Karlsruhe, 1991.

UNPUBLISHED PAPERS

  1. Jan Daciuk, Gertjan van Noord, A Finite-State Library for NLP, presented at CLIN 2001 (Twelfth Meeting of Computational Linguistics in the Netherlands), University of Twente, Enschede, 30 November 2001.

  2. Jan Daciuk, Gramatyki połączeniowe w korekcie polskich tekstów (Link Grammars in Correction of Texts in Polish), technical report, Technical University of Gdańsk, 1993.

  3. Jan Daciuk, Wymagania dla słownika języka polskiego do sprawdzania poprawności tekstów w języku polskim (Requirements for a Polish Language Lexicon for Correction of Texts in Polish), technical report, Technical University of Gdańsk, 1992.

INVITED TALKS

  1. "Incremental Construction of Minimal Deterministic Tree Automata". Presented at the Seminar für Sprachwissenschaft, Tübingen University, Germany, May 19th, 2006.

  2. "Extension of Selected ADFA Construction Algorithms to the Case of Cyclic Automata". Presented at a Seminar in IUT Blois, Universite de Tours, Blois, France, November 25th, 2004.

  3. "Extension of Selected ADFA Construction Algorithms to the Case of Cyclic Automata". Presented at a Seminar in Departement d'Informatique, Ecole Polytechnique de l'Université de Tours, Tours, France, November 17st, 2004.

  4. "Guessing Automata". Presented at a seminar of a research group Langues et Representations, Université de Tours, Tours, France, November 2nd, 2004.

  5. "Incremental Construction of Minimal Finite State Automata". Presented at Université de Tours, Tours, France, October 21st, 2004.

  6. "Extension of Selected ADFA Construction Algorithms to the Case of Cyclic Automata". Presented at a Seminar in Departament de Llenguathes i Sistems Informatics, Universitat d'Alacant, Alacant/Alicante, Spain, September 20th, 2004.

  7. "Computer-Aided Enlargment of Morphological Dictionaries". Presented at the Natural Language Processing Seminar, The Linguistic Engineering / Formal Linguistics Group, Linguistic Engineering Group at the Department of Artificial Intelligence, Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland, June 25th, 2001.

  8. "Incremental Construction of Minimal, Deterministic, Acyclic, Finite-State Automata". Presented at the Seminar für Sprachwissenschaft, Tübingen University, Germany, May 24th, 2000.

  9. "Construction of Guessing Automata for Morphological Analysis and Morphological Descriptions". Presented at the Seminar für Sprachwissenschaft, Tübingen University, Germany, May 22nd, 2000.

  10. "Incremental Construction of Finite-State Automata". Presented at the Mathematical Faculty of the University of Gdańsk, Gdańsk, Poland, 1999.

  11. "Link Grammars". Presented at the Mathematical Faculty of the University of Gdańsk, Gdańsk, Poland, 1993.

REPORTS AND PROPOSALS

SOFTWARE AND DOCUMENTATION

  1. adfa: a program for testing various acyclic automata construction methods, Rijksuniversiteit Groningen, the Netherlands, 2002.

  2. A set of programs for testing automata minimization algorithms, and in particular the new (my) version of the incremental algorithm by Bruce Watson, Rijksuniversiteit Groningen, the Netherlands, 2002.

  3. Fadd: a library for accessing dictionaries in form of finite-state automata, finite-state perfect hashing functions, and compressed finite-state language models, Rijksuniversiteit Groningen, the Netherlands, 2001. Based on the fsa package.

  4. Fsa: A package of programs for construction and use of finite-state automata for morphological analysis, spelling correction, restoration of diacritics, and perfect hashing. Written at ISSCO, University of Geneva, Switzerland, 1995-96, maintained at the Technical University of Gdańsk, Poland.

  5. Utr: A package for construction and use of finite-state transducers for morphological analysis and synthesis, spelling correction, and restoration of diacritics. Written at ISSCO, University of Geneva, Switzerland, 1995-96, maintained at the Technical University of Gdańsk, Poland.

  6. Opis procedur dostępu do ekranu komputera Jantar (Description of Procedures that Access the Screen of Jantar Computer), internal publication of the Technical University of Gdańsk, 1991.

Jan Daciuk
email: jjaannddaacc@eti.pg.gda.pl
(remove the stuttering!)