• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium:
    
    • Online (168)
  • 
    Type
  • 
    BLLDB-Access:
    • free (168)
    • 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 Page: 1 2 3 4 5...9 Hits 1 – 20 of 168 1 A Computational Simulation of Children’s Language Acquisition (Crazy New Idea) ... Ambridge, Ben. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 2 Consistent unsupervised estimators for anchored PCFGs Clark, Alexander; Fijalkow, Nathanaël In: Proceedings of the Society for Computation in Linguistics (2021) BASE Show details 3 Learnability and Overgeneration in Computational Syntax Hao, Yiding In: Proceedings of the Society for Computation in Linguistics (2019) BASE Show details 4 Characters Who Speak Their Minds: Dialogue Generation in Talk of the Town Ryan, James; Mateas, Michael; Wardrip-Fruin, Noah In: Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment; Vol. 12 No. 1 (2016): Twelfth Artificial Intelligence and Interactive Digital Entertainment Conference ; 2334-0924 ; 2326-909X (2016) BASE Show details 5 Weighted tree automata and transducers for syntactic natural language processing ... May, Jonathan David Louis. - : University of Southern California Digital Library (USC.DL), 2015 BASE Show details 6 МЕТОД РЕГУЛЯРИЗАЦИИ ГРАММАТИК В СИСТЕМАХ ПОСТРОЕНИЯ ЯЗЫКОВЫХ ПРОЦЕССОРОВ ФЕДОРЧЕНКО ЛЮДМИЛА НИКОЛАЕВНА. - : Федеральное государственное автономное образовательное учреждение высшего образования «Санкт-Петербургский национальный исследовательский университет информационных технологий, механики и оптики», 2014 BASE Show details 7 Improving Statistical Machine Translation Through N-best List Re-ranking and Optimization Keefer, Jordan S In: DTIC (2014) BASE Show details 8 On the relation between context-free grammars and parsing expression grammars Medeiros, Sérgio Queiroz de; Mascarenhas, Fabio; Roberto Ierusalimschy, Natural semantics. - : Elsevier, 2014 BASE Show details 9 Toric grammars: a new statistical approach to natural language modeling Catoni, Olivier; Mainguy, Thomas In: https://hal.archives-ouvertes.fr/hal-00934487 ; 2013 (2013) BASE Show details 10 MSEE: Stochastic Cognitive Linguistic Behavior Models for Semantic Sensing Man, Hong; Yao, Yu-dong In: DTIC (2013) BASE Show details 11 Intensional Context-Free Grammar Little, Richard. - 2013 BASE Show details 12 DOI:10.1007/978-3-642-23211-4 A Datalog recognizer for almost-affine λ-CFGs Pierre Bourreau; Sylvain Salvati; Université Bordeaux In: http://hal.inria.fr/docs/00/74/07/01/PDF/parseAffine.pdf (2012) BASE Show details 13 Μαθηματική Γλωσσολογία: από τη Θεωρία Κατηγοριών στις Κατηγοριακές Γραμματικές ... : Mathematical Linguistics: from Category Theory to Categorial Grammars ... Nisidis, Nikolaos D.. - : National Technological University of Athens, 2012 BASE Show details 14 The motion grammar: Linguistic perception, planning, and control Neil Dantam; Mike Stilman In: https://smartech.gatech.edu/bitstream/handle/1853/36485/yama.pdf (2011) BASE Show details 15 Minimalist Grammars in the Light of Logic Salvati, Sylvain In: https://hal.inria.fr/inria-00563807 ; [Research Report] 2011, pp.39 (2011) BASE Show details 16 A Datalog recognizer for almost affine lambda-CFGs Bourreau, Pierre; Salvati, Sylvain In: Mathematics of Language ; https://hal.archives-ouvertes.fr/hal-00740701 ; Mathematics of Language, Sep 2011, Nara, Japan. pp.21-38, ⟨10.1007/978-3-642-23211-4⟩ (2011) BASE Show details 17 Incremental Syntactic Language Models for Phrase-Based Translation Schwartz, Lane; Callison-Burch, Chris; Schuler, William... In: DTIC (2011) BASE Show details 18 CSSG: Learning within NLP Pipelines for Scalable Data Mining and Information Extraction Roark, Brian In: DTIC (2011) BASE Show details 19 The Copying Power of Well-Nested Multiple Context-Free Grammars Makoto, Kanazawa; Salvati, Sylvain In: Language and Automata Theory and Applications ; https://hal.inria.fr/inria-00525077 ; Language and Automata Theory and Applications, 2010, Trier, Germany. pp.344-355, ⟨10.1007/978-3-642-13089-2_29⟩ ; http://www.springerlink.com/content/b8w7r53761614lk7/ (2010) Abstract: International audience ; We prove a copying theorem for well-nested multiple context- free languages: if L = { w#w | w ∈ L0 } has a well-nested m-MCFG, then L has a 'non-branching' well-nested m-MCFG. This can be used to give simple examples of multiple context-free languages that are not generated by any well-nested MCFGs. ; Nous démontrons un théorème de copie pour les grammaires hors-contexte multiples bien imbriquées : si L = { w#w | w ∈ L0 } est décrit par une m-MCFG bien imbriquée, alors L peut être décrit par une m-MCFG bien imbriquée non-branchante. Ce théorème peut être utilisé pour donner des exemples simples de languages hors contexte multiples qui ne sont générés par aucune MCFG bien imbriquée. Keyword: [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.2: Grammars and Other Rewriting Systems/F.4.2.1: Grammar types (e.g.; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.2: Grammars and Other Rewriting Systems/F.4.2.2: Parallel rewriting systems (e.g.; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.0: Algebraic language theory; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.1: Classes defined by grammars or automata (e.g.; context-free; context-free languages; context-sensitive); developmental systems; L-systems); recursive sets); regular sets URL: https://doi.org/10.1007/978-3-642-13089-2_29 https://hal.inria.fr/inria-00525077 BASE Hide details 20 Recognizability in the Simply Typed Lambda-Calculus Salvati, Sylvain In: 16th Workshop on Logic, Language, Information and Computation ; https://hal.inria.fr/inria-00412654 ; 16th Workshop on Logic, Language, Information and Computation, 2009, Tokyo, Japan (2009) BASE Show details Page: 1 2 3 4 5...9

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 168 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0