default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnna Kasprzik
Person information
- affiliation: ZBW - Leibniz Information Centre for Economics, Hamburg, Germany
- affiliation (former): TIB Leibniz Information Center for Science & Technology, Germany
- affiliation (former): University of Trier, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c14]Anna Kasprzik:
Putting Research-based Machine Learning Solutions for Subject Indexing into Practice. Qurator 2020
2010 – 2019
- 2018
- [c13]Anna Kasprzik:
Cleaning up a Legacy Thesaurus to Make it Fit for Transformation into a Semantic Web KOS. NKOS@TPDL 2018: 64-70 - [c12]Tatiana Walther, Christian Hauschke
, Anna Kasprzik:
The Research Core Dataset (KDSF) in the Linked Data context. CRIS 2018: 29-38 - [c11]Sören Auer, Viktor Kovtun, Manuel Prinz, Anna Kasprzik, Markus Stocker, Maria-Esther Vidal:
Towards a Knowledge Graph for Science. WIMS 2018: 1:1-1:6 - [c10]Hartwig Baumgaertel, Hans Ehm, Sabrine Laaouane, Jan Gerhardt, Anna Kasprzik:
Collaboration in supply Chains for Development of CPS Enabled by Semantic Web Technologies. WSC 2018: 3627-3638 - 2016
- [j3]Johanna Björklund, Henning Fernau, Anna Kasprzik:
Polynomial inference of universal automata from membership and equivalence queries. Inf. Comput. 246: 3-19 (2016) - 2013
- [j2]Anna Kasprzik:
Four one-shot learners for regular tree languages and their polynomial characterizability. Theor. Comput. Sci. 485: 85-106 (2013) - [c9]Johanna Björklund, Henning Fernau, Anna Kasprzik:
MAT Learning of Universal Automata. LATA 2013: 141-152 - 2012
- [j1]Jeffrey Heinz, Anna Kasprzik, Timo Kötzing:
Learning in the limit with lattice-structured hypothesis spaces. Theor. Comput. Sci. 457: 111-127 (2012) - 2011
- [c8]Anna Kasprzik, Ryo Yoshinaka:
Distributional Learning of Simple Context-Free Tree Grammars. ALT 2011: 398-412 - [c7]Anna Kasprzik:
Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data. Developments in Language Theory 2011: 476-477 - 2010
- [c6]Anna Kasprzik:
Generalizing over Several Learning Settings. ICGI 2010: 288-292 - [c5]Anna Kasprzik, Timo Kötzing:
String Extension Learning Using Lattices. LATA 2010: 380-391 - [c4]Anna Kasprzik:
Learning Residual Finite-State Automata Using Observation Tables. DCFS 2010: 205-212
2000 – 2009
- 2009
- [c3]Anna Kasprzik:
Two Equivalent Regularizations for Tree Adjoining Grammars. LATA 2009: 469-480 - 2008
- [c2]Anna Kasprzik:
Making Finite-State Methods Applicable to Languages Beyond Context-Freeness via Multi-dimensional Trees. FSMNLP 2008: 98-109 - [c1]Anna Kasprzik:
A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness. ICGI 2008: 111-124
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-05-02 21:45 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:
