Anna Kasprzik

Orcid: 0000-0002-1019-3606

Affiliations:
  • ZBW - Leibniz Information Centre for Economics, Hamburg, Germany
  • TIB Leibniz Information Center for Science & Technology, Germany (former)
  • University of Trier, Germany (former)


According to our database1, Anna Kasprzik authored at least 17 papers between 2008 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Putting Research-based Machine Learning Solutions for Subject Indexing into Practice.
Proceedings of the Conference on Digital Curation Technologies (Qurator 2020), Berlin, Germany, January 20th, 2020

2018
Collaboration in supply Chains for Development of CPS Enabled by Semantic Web Technologies.
Proceedings of the 2018 Winter Simulation Conference, 2018

Towards a Knowledge Graph for Science.
Proceedings of the 8th International Conference on Web Intelligence, Mining and Semantics, 2018

The Research Core Dataset (KDSF) in the Linked Data context.
Proceedings of the 14th International Conference on Current Research Information Systems, 2018

Cleaning up a Legacy Thesaurus to Make it Fit for Transformation into a Semantic Web KOS.
Proceedings of the 18th European Networked Knowledge Organization Systems (NKOS) Workshop co-located with the 22nd International Conference on Theory and Practice of Digital Libraries 2018 (TPDL 2018), 2018

2016
Polynomial inference of universal automata from membership and equivalence queries.
Inf. Comput., 2016

2013
Four one-shot learners for regular tree languages and their polynomial characterizability.
Theor. Comput. Sci., 2013

MAT Learning of Universal Automata.
Proceedings of the Language and Automata Theory and Applications, 2013

2012
Learning in the limit with lattice-structured hypothesis spaces.
Theor. Comput. Sci., 2012

2011
Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Distributional Learning of Simple Context-Free Tree Grammars.
Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

2010
Learning Residual Finite-State Automata Using Observation Tables
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

String Extension Learning Using Lattices.
Proceedings of the Language and Automata Theory and Applications, 2010

Generalizing over Several Learning Settings.
Proceedings of the Grammatical Inference: Theoretical Results and Applications, 2010

2009
Two Equivalent Regularizations for Tree Adjoining Grammars.
Proceedings of the Language and Automata Theory and Applications, 2009

2008
A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2008

Making Finite-State Methods Applicable to Languages Beyond Context-Freeness via Multi-dimensional Trees.
Proceedings of the Finite-State Methods and Natural Language Processing, 2008


  Loading...