• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher
  • 
    Year
  • 
    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 A high-level syntactic formalism for natural language processing ; Mise au point d'un formalisme syntaxique de haut niveau pour le traitement automatique des langues Kirman, Jerome. - : HAL CCSD, 2015 In: https://tel.archives-ouvertes.fr/tel-01267716 ; Informatique. Université de Bordeaux, 2015. Français. ⟨NNT : 2015BORD0330⟩ (2015) BASE Show details 2 A high-level formalism for natural language processing ; Mise au point d'un formalisme de haut niveau pour le traitement automatique des langues Kirman, Jérôme. - : HAL CCSD, 2015 In: https://tel.archives-ouvertes.fr/tel-01251668 ; Informatique et langage [cs.CL]. Université de Bordeaux, 2015. Français (2015) BASE Show details 3 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) Abstract: Abstract. The recent emergence of linguistic formalisms exclusively based on the simply-typed λ-calculus to represent both syntax and semantics led to the presentation of innovative techniques which apply to both the problems of parsing and generating natural languages. A common feature of these techniques consists in using strong relations between typing properties and syntactic structures of families of simply-typed λ-terms. Among significant results, an efficient algorithm based on Datalog programming is presented in [Kan07] for context-free grammar of almost linear λ-terms, which are linear λ-terms augmented with a restricted form of copy. We present an extension of this method to terms for which deletion is allowed. Keyword: Abstract categorial grammars; Context-Free λ-Grammars; Datalog; Deleting grammars; Key words; Parsing; Typing properties URL: http://hal.inria.fr/docs/00/74/07/01/PDF/parseAffine.pdf http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.392.9319 BASE Hide details 4 Game semantics and parsing context-free lambda-grammars ; Jeux de typage et analyse de lambda-grammaires non-contextuelles Bourreau, Pierre. - : HAL CCSD, 2012 In: https://tel.archives-ouvertes.fr/tel-00733964 ; Informatique et langage [cs.CL]. Université Sciences et Technologies - Bordeaux I, 2012. Français (2012) BASE Show details 5 Chapter 9 An Automata-Theoretic Approach to Gregory M. Kobele; Christian Retoré; Sylvain Salvati In: http://cs.earlham.edu/esslli07mts/mtspapers/KRS.pdf 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