• Refine your search:
  • 
    Keyword:
    
    • QA75 (17)
    • QA75 Electronic computers. Computer science (17)
    • Parsing algorithms (6)
    • Natural language processing (5)
    • NDAS (4)
    • T-NDAS (4)
    • Computational Theory and Mathematics (3)
    • P (3)
    • P Language and Literature (3)
    • Artificial Intelligence (2)
    •   more
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium
  • 
    Type
  • 
    BLLDB-Access

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 – 17 of 17 1 Calculating the optimal step of arc-eager parsing for non-projective trees Nederhof, Mark Jan. - : Association for Computational Linguistics, 2021 BASE Show details 2 Calculating the optimal step in shift-reduce dependency parsing : from cubic to linear time Nederhof, Mark Jan. - 2019 BASE Show details 3 Regular transductions with MCFG input syntax Nederhof, Mark Jan; Vogler, Heiko. - : Association for Computational Linguistics, 2019 BASE Show details 4 A probabilistic model of Ancient Egyptian writing Nederhof, Mark Jan; Rahman, Fahrurrozi. - 2017 BASE Show details 5 Hybrid grammars for parsing of discontinuous phrase structures and non-projective dependency structures Gebhardt, Kilian; Nederhof, Mark Jan; Vogler, Heiko. - 2017 Abstract: We explore the concept of hybrid grammars, which formalize and generalize a range of existing frameworks for dealing with discontinuous syntactic structures. Covered are both discontinuous phrase structures and non-projective dependency structures. Technically, hybrid grammars are related to synchronous grammars, where one grammar component generates linear structures and another generates hierarchical structures. By coupling lexical elements of both components together, discontinuous structures result. Several types of hybrid grammars are characterized. We also discuss grammar induction from treebanks. The main advantage over existing frameworks is the ability of hybrid grammars to separate discontinuity of the desired structures from time complexity of parsing. This permits exploration of a large variety of parsing algorithms for discontinuous structures, with different properties. This is confirmed by the reported experimental results, which show a wide variety of running time, accuracy and frequency of parse failures. ; Publisher PDF ; Peer reviewed Keyword: BDC; NDAS; P Philology. Linguistics; P1; QA75; QA75 Electronic computers. Computer science; R2C; ~DC~ URL: https://doi.org/10.1162/COLI_a_00291 http://hdl.handle.net/10023/11713 BASE Hide details 6 A derivational model of discontinuous parsing Nederhof, Mark Jan; Yli-Jyra, Anssi. - : Springer, 2017 BASE Show details 7 Transition-based dependency parsing as latent-variable constituent parsing Nederhof, Mark Jan. - : Association for Computational Linguistics, 2016 BASE Show details 8 A short proof that O2 is an MCFL Nederhof, Mark Jan. - : Association for Computational Linguistics, 2016 BASE Show details 9 Count-based state merging for probabilistic regular tree grammars Dietze, Toni; Nederhof, Mark Jan. - : Association for Computational Linguistics, 2015 BASE Show details 10 A probabilistic model of Ancient Egyptian writing Nederhof, Mark Jan; Rahman, Fahrurrozi. - : Association for Computational Linguistics, 2015 BASE Show details 11 Computation of infix probabilities for probabilistic context-free grammars Satta, Giorgio; Nederhof, Mark Jan. - : Association for Computational Linguistics, 2012 BASE Show details 12 Splittability of bilexical context-free grammars is undecidable Satta, Giorgio; Nederhof, Mark Jan. - 2012 BASE Show details 13 Prefix probabilities for linear context-free rewriting systems Nederhof, Mark Jan; Satta, Giorgio. - : Association for Computational Linguistics, 2012 BASE Show details 14 Tree parsing with synchronous tree-adjoining grammars Nederhof, Mark Jan; Vogler, Heiko; B¨uchse, Matthias. - : Association for Computational Linguistics, 2012 BASE Show details 15 Parsing of partially bracketed structures for parse selection S´anchez-S´aez, Ricardo; Nederhof, Mark Jan. - : Association for Computational Linguistics, 2012 BASE Show details 16 Automatic creation of interlinear text for philological purposes Nederhof, Mark Jan. - 2011 BASE Show details 17 Transforming lexica as trees Nederhof, Mark Jan. - : Curran Associates, Inc., 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 17 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0