• 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. - : Underline Science Inc., 2021 BASE Show details 3 Inferring Minimalist Grammars with an SMT-Solver Indurkhya, Sagar In: Proceedings of the Society for Computation in Linguistics (2020) Abstract: We present an implemented novel procedure for inferring Minimalist Grammars (MG). Our procedure models an MG as a system of first-order logic formulae that is evaluated with the Z3 SMT solver. The input to the procedure is a sequence of sentences annotated with syntactic relations encoding predicate-argument structure and subject-verb agreement. The implementation outputs a set of MGs that can parse each input sentence, yielding the same syntactic relations as in the original input. We present and analyze how MGs inferred by this procedure align with contemporary theories of minimalist syntax. Keyword: Computational Linguistics; grammar inference; minimalist grammars; satisfiability modulo theories URL: https://scholarworks.umass.edu/cgi/viewcontent.cgi?article=1150&context=scil https://scholarworks.umass.edu/scil/vol3/iss1/56 BASE Hide 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