• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium
  • 
    Type
  • 
    BLLDB-Access:
    • free (6)
    • subject to license (0)

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Hits 1 – 6 of 6 1 DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures Nakashima, Katsuhito; Fujisato, Noriki; Hendrian, Diptarama. - : LIPIcs - Leibniz International Proceedings in Informatics. 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), 2020 BASE Show details 2 DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures ... Nakashima, Katsuhito; Fujisato, Noriki; Hendrian, Diptarama. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 BASE Show details 3 DAWGs for parameterized matching: online construction and related indexing structures ... Nakashima, Katsuhito; Fujisato, Noriki; Hendrian, Diptarama. - : arXiv, 2020 BASE Show details 4 An Extension of Linear-size Suffix Tries for Parameterized Strings ... Nakashima, Katsuhito; Hendrian, Diptarama; Yoshinaka, Ryo; Shinohara, Ayumi. - : arXiv, 2019 Abstract: In this paper, we propose a new indexing structure for parameterized strings which we call PLSTs, by generalizing linear-size suffix tries for ordinary strings. Two parameterized strings are said to match if there is a bijection on the symbol set that makes the two coincide. PLSTs are applicable to the parameterized pattern matching problem, which is to decide whether the input parameterized text has a substring that matches the input parameterized pattern. The size of PLSTs is linear in the text size, with which our algorithm solves the parameterized pattern matching problem in linear time in the pattern size. PLSTs can be seen as a compacted version of parameterized suffix tries and a combination of linear-size suffix tries and parameterized suffix trees. We experimentally show that PLSTs are more space efficient than parameterized suffix trees for highly repetitive strings. ... : 13 pages, 6 figures ... Keyword: Data Structures and Algorithms cs.DS; FOS Computer and information sciences URL: https://dx.doi.org/10.48550/arxiv.1902.00216 https://arxiv.org/abs/1902.00216 BASE Hide details 5 Efficiency in the Identification in the Limit Learning Paradigm Eyraud, Rémi; Heinz, Jeffrey; Yoshinaka, Ryo In: Topics in Grammatical Inference ; https://hal.archives-ouvertes.fr/hal-01399418 ; Jeffrey Heinz and José M. Sempere. Topics in Grammatical Inference, pp.25 - 46, 2016, 978-3-662-48395-4. ⟨10.1007/978-3-662-48395-4_2⟩ ; http://www.springer.com/la/book/9783662483930 (2016) BASE Show details 6 Well-Nestedness Properly Subsumes Strict Derivational Minimalism Kanazawa, Makoto; Michaelis, Jens; Salvati, Sylvain... In: LACL 2011 ; Logical Aspects of Computational Linguistics - 6th international conference ; https://hal.archives-ouvertes.fr/hal-00959629 ; Logical Aspects of Computational Linguistics - 6th international conference, 2011, Montpellier, France. pp.112-128 (2011) BASE Show details

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 6 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0