4 found
Sort by:
  1. Alexander Koller & Alex Lascarides, A Logic of Semantic Representations for Shallow Parsing.
    One way to construct semantic representations in a robust manner is to enhance shallow language processors with semantic components. Here, we provide a model theory for a semantic formalism that is designed for this, namely Robust Minimal Recursion Semantics (RMRS). We show that RMRS supports a notion of entailment that allows it to form the basis for comparing the semantic output of different parses of varying depth.
    Direct download  
     
    My bibliography  
     
    Export citation  
  2. Alexander Koller & Matthew Stone, Sentence Generation as a Planning Problem.
    We translate sentence generation from TAG grammars with semantic and pragmatic information into a planning problem by encoding the contribution of each word declaratively and explicitly. This allows us to exploit the performance of off-the-shelf planners. It also opens up new perspectives on referring expression generation and the relationship between language and action.
    Direct download  
     
    My bibliography  
     
    Export citation  
  3. Alexander Koller, Ralph Debusmann, Malte Gabsdil & Kristina Striegnitz (2004). Put My Galakmid Coin Into the Dispenser and Kick It: Computational Linguistics and Theorem Proving in a Computer Game. [REVIEW] Journal of Logic, Language and Information 13 (2):187-206.
    We combine state-of-the-art techniques from computational linguisticsand theorem proving to build an engine for playing text adventures,computer games with which the player interacts purely through naturallanguage. The system employs a parser for dependency grammar and ageneration system based on TAG, and has components for resolving andgenerating referring expressions. Most of these modules make heavy useof inferences offered by a modern theorem prover for descriptionlogic. Our game engine solves some problems inherent in classical textadventures, and is an interesting test case for (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  4. Markus Egg, Alexander Koller & Joachim Niehren (2001). The Constraint Language for Lambda Structures. Journal of Logic, Language and Information 10 (4):457-485.
    This paper presents the Constraint Language for Lambda Structures(CLLS), a first-order language for semantic underspecification thatconservatively extends dominance constraints. It is interpreted overlambda structures, tree-like structures that encode -terms. Based onCLLS, we present an underspecified, uniform analysis of scope,ellipsis, anaphora, and their interactions. CLLS solves a variablecapturing problem that is omnipresent in scope underspecification andcan be processed efficiently.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation