• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher
  • 
    Year:
    
    • 2022 (1)
    • 2021 (1)
    • 2020 (1)
    • 2019 (1)
    • 2015 (1)
  • 
    Medium:
    
    • Online (5)
  • 
    Type
  • 
    BLLDB-Access:
    • free (5)
    • 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 – 5 of 5 1 Incremental Acquisition of a Minimalist Grammar using an SMT-Solver Indurkhya, Sagar In: Proceedings of the Society for Computation in Linguistics (2022) BASE Show details 2 Evaluating Universal Dependency Parser Recovery of Predicate Argument Structure via CompChain Analysis ... The Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing 2021; Berwick, Robert; Indurkhya, Sagar; Yankama, Beracah. - : Underline Science Inc., 2021 Abstract: Accurate recovery of predicate-argument structure from a Universal Dependency (UD) parse is central to downstream tasks such as extraction of semantic roles or event representations. This study introduces compchains, a categorization of the hierarchy of predicate dependency relations present within a UD parse. Accuracy of compchain classification serves as a proxy for measuring accurate recovery of predicate-argument structure from sentences with embedding. We analyzed the distribution of compchains in three UD English treebanks, EWT, GUM and LinES, revealing that these treebanks are sparse with respect to sentences with predicate-argument structure that includes predicate-argument embedding. We evaluated the CoNLL 2018 Shared Task UDPipe (v1.2) baseline (dependency parsing) models as compchain classifiers for the EWT, GUMS and LinES UD treebanks. Our results indicate that these three baseline models exhibit poorer performance on sentences with predicate-argument structure with more than one level of ... Keyword: Computational Linguistics; Data Management System; FOS Languages and literature; Linguistics; Natural Language Processing; Semantics URL: https://underline.io/lecture/29792-evaluating-universal-dependency-parser-recovery-of-predicate-argument-structure-via-compchain-analysis https://dx.doi.org/10.48448/cy78-5j21 BASE Hide details 3 Inferring Minimalist Grammars with an SMT-Solver Indurkhya, Sagar In: Proceedings of the Society for Computation in Linguistics (2020) BASE Show details 4 Colorless green ideas do sleep furiously: gradient acceptability and the nature of the grammar Sprouse, Jon; Yankama, Beracah; Indurkhya, Sagar... In: De Gruyter (2019) BASE Show details 5 Acquiring minimalist grammars via constraint satisfaction Indurkhya, Sagar. - : Massachusetts Institute of Technology, 2015 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 5 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0