• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher:
    
    • Krieger, Hans-Ulrich (5)
    • Schäfer, Ulrich (5)
    • Xu, Feiyu (2)
    • Bering, Christian (1)
    • Crysmann, Bernd (1)
    • Droźdźyński, Witold (1)
    • Erbach, Gregor (1)
    • Frank, Anette (1)
    • Guasch, Clara (1)
    • Homola, Petr (1)
    •   more
  • 
    Year
  • 
    Medium
  • 
    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 Question answering from structured knowledge sources Schäfer, Ulrich; Uszkoreit, Hans; Crysmann, Bernd. - : Elsevier, 2007 BASE Show details 2 Corpora and evaluation tools for multilingual named entity grammar development Bering, Christian; Droźdźyński, Witold; Erbach, Gregor... In: <Titel nicht gefunden> (2003) UB Frankfurt Linguistik Show details 3 Efficient parameterizable type expansion for typed feature formalisms Krieger, Hans-Ulrich; Schäfer, Ulrich. - 1995 BASE Show details 4 TDL : a type description language for HPSG. - Part 1: Overview Schäfer, Ulrich; Krieger, Hans-Ulrich. - 1994 Abstract: Unification-based grammar formalisms have become the predominant paradigm in natural language processing NLP and computational linguistics CL. Their success stems from the fact that they can be seen as high-level declarative programming languages for linguists, which allow them to express linguistic knowledge in a monotonic fashion. More over, such formalisms can be given a precise set theoretical semantics. This paper presents mathcal{TDL}, a typed featurebased language and inference system, which is specically designed to support highly lexicalized grammar theories like HPSG, FUG, or CUG. mathcal{TDL} allows the user to define possibly recursive hierarchically ordered types consisting of type constraints and feature constraints over the boolean connectives wedge, vee, and neg. mathcal{TDL} distinguishes between avm types (open-world reasoning), sort types (closed-world reasoning), built-in types and atoms, and allows the declaration of partitions and incompatible types. Working with partially as well as with fully expanded types is possible, both at definition time and at run time. mathcal{TDL} is incremental, i.e., it allows the redefinition of types and the use of undefined types. Efficient reasoning is accomplished through four specialized reasoners. Keyword: ddc:004; Künstliche Intelligenz URL: https://doi.org/10.22028/D291-25048 http://nbn-resolving.org/urn:nbn:de:bsz:291-scidok-38980 BASE Hide details 5 TDL ExtraLight user's guide Krieger, Hans-Ulrich; Schäfer, Ulrich. - 1993 BASE Show details

Mobile view All Catalogues UB Frankfurt Linguistik 1 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 4 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0