Sciweavers

    76 search results - page 5 / 16
    » Semantics and Algorithms for Data-dependent Grammars
    Sort
    View
    WCRE
    2007
    IEEE
    131views Software Engineering» more  WCRE 2007»
    Recovering Data Models via Guarded Dependences
    14 years 1 months ago
    Recovering Data Models via Guarded Dependences
    Download  pages.cs.wisc.edu
    This paper presents an algorithm for reverse engineering semantically sound object-oriented data models from programs written in weakly-typed languages like Cobol. Our inference i...
    Raghavan Komondoor, G. Ramalingam
    claim paper
    Read More »
    EMNLP
    2007
    115views Natural Language Processing» more  EMNLP 2007»
    Online Learning of Relaxed CCG Grammars for Parsing to Logical Form
    13 years 9 months ago
    Online Learning of Relaxed CCG Grammars for Parsing to Logical Form
    Download  people.csail.mit.edu
    We consider the problem of learning to parse sentences to lambda-calculus representations of their underlying semantics and present an algorithm that learns a weighted combinatory...
    Luke S. Zettlemoyer, Michael Collins
    claim paper
    Read More »
    EACL
    1993
    ACL Anthology
    99views Natural Language Processing» more  EACL 1993»
    Type-Driven Semantic Interpretation of f-Structures
    13 years 8 months ago
    Type-Driven Semantic Interpretation of f-Structures
    Download  acl.ldc.upenn.edu
    The formal architecture of Lexical Functional Grammar offers a particular formal device, the structural correspondence, for modularizing the mapping between the surface forms of a...
    Jürgen Wedekind, Ronald M. Kaplan
    claim paper
    Read More »
    ACL
    2006
    116views Computational Linguistics» more  ACL 2006»
    An Improved Redundancy Elimination Algorithm for Underspecified Representations
    13 years 9 months ago
    An Improved Redundancy Elimination Algorithm for Underspecified Representations
    Download  www.coli.uni-saarland.de
    We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mut...
    Alexander Koller, Stefan Thater
    claim paper
    Read More »
    EACL
    1989
    ACL Anthology
    107views Natural Language Processing» more  EACL 1989»
    Expressing generalizations in unification-based grammar formalisms
    13 years 8 months ago
    Expressing generalizations in unification-based grammar formalisms
    Download  acl.ldc.upenn.edu
    This paper shows how higher levels of generalization can be introduced into unification grammars by exploiting methods for typing grammatical objects. We discuss the strategy of u...
    Marc Moens, Jonathan Calder, Ewan Klein, Mike Reap...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.