Browsing by Author "Shieber, Stuart"

Now showing items 61-80 of 94

    • Partially ordered multiset context-free grammars and ID/LP parsing 

      Nederhof, Mark-Jan; Satta, Giorgio; Shieber, Stuart (Association for Computational Linguistics, 2003)
      We present a new formalism, partially ordered multiset context-free grammars (poms-CFG), along with an Earley-style parsing algorithm. The formalism, which can be thought of as a generalization of context-free grammars ...

    • Plan Recognition in Exploratory Domains 

      Gal, Ya'akov; Reddy, Swapna; Shieber, Stuart M.; Rubin, Andee; Grosz, Barbara J. (Elsevier, 2012)
      This paper describes a challenging plan recognition problem that arises in environments in which agents engage widely in exploratory behavior, and presents new algorithms for effective plan recognition in such settings. ...

    • Practical secrecy-preserving, verifiably correct and trustworthy auctions 

      Parkes, David; Rabin, Michael; Shieber, Stuart; Thorpe, Christopher (Elsevier, 2008)
      We present a practical protocol based on homomorphic cryptography for conducting provably fair sealed-bid auctions. The system preserves the secrecy of the bids, even after the announcement of auction results, while also ...

    • Predicting individual book use for off-site storage using decision trees 

      Silverstein, Craig; Shieber, Stuart (University of Chicago Press, 1996)
      We explore various methods for predicting library book use, as measured by circulation records. Accurate prediction is invaluable when choosing titles to be stored in an off-site location. Previous researchers in this area ...

    • Principles and implementation of deductive parsing 

      Shieber, Stuart; Schabes, Yves; Pereira, Fernando C. N. (Elsevier, 1995)
      We present a system for generating parsers based directly on the metaphor of parsing as deduction. Parsing algorithms can be represented directly as deduction systems, and a single deduction engine can interpret such ...

    • Principles for Designing an AI Competition, or Why the Turing Test Fails as an Inducement Prize 

      Shieber, Stuart Merrill (Association for the Advancement of Artificial Intelligence, 2016)
      If the artificial intelligence research community is to have a challenge problem as an incentive for research, as many have called for, it behooves us to learn the principles of past successful inducement prize competitions. ...

    • The problem of logical-form equivalence 

      Shieber, Stuart (MIT Press, 1993)

    • Recognition of Users' Activities using Constraint Satisfaction 

      Reddy, Swapna Cherukupalli; Gal, Ya'akov; Shieber, Stuart M. (Springer, 2009)
      Ideally designed software allow users to explore and pursue interleaving plans, making it challenging to automatically recognize user interactions. The recognition algorithms presented use constraint satisfaction techniques ...

    • Recognizing Uncertainty in Speech 

      Pon-Barry, Heather Roberta; Shieber, Stuart M. (Hindawi Publishing Corporation, 2011)
      We address the problem of inferring a speaker’s level of certainty based on prosodic information in the speech signal, which has application in speech-based dialogue systems. We show that using phrase-level prosodic features ...

    • Reconciling Abstract Structure and Concrete Data in Statistical Natural-Language Processing 

      Shieber, Stuart M. (Institute of Electrical and Electronics Engineers, 1991)

    • Reflexives and Reciprocals in Synchronous Tree Adjoining Grammar 

      Aggazzotti, Cristina; Shieber, Stuart (2017-09)
      An attractive feature of the formalism of synchronous tree adjoining grammar (STAG) is its potential to handle linguistic phenomena whose syntactic and semantic derivations seem to diverge. Recent work has aimed at adapting ...

    • Restricting the weak-generative capacity of synchronous tree-adjoining grammars 

      Shieber, Stuart (Association for Computational Linguistics, 1992)
      The formalism of synchronous tree-adjoining grammars, a variant of standard tree-adjoining grammars (TAG), was intended to allow the use of TAGs for language transduction in addition to language specification. In previous ...

    • Restricting the weak-generative capacity of synchronous tree-adjoining grammars. 

      Shieber, Stuart (Blackwell Publishing, 1994)
      The formalism of synchronous tree-adjoining grammars, a variant of standard tree-adjoining grammars (TAG), was intended to allow the use of TAGs for language transduction in addition to language specification. In previous ...

    • Rich Linguistic Structure from Large-Scale Web Data 

      Yamangil, Elif (2013-10-18)
      The past two decades have shown an unexpected effectiveness of Web-scale data in natural language processing. Even the simplest models, when paired with unprecedented amounts of unstructured and unlabeled Web data, have ...

    • A seed-growth heuristic for graph bisection 

      Marks, Joe; Ruml, Wheeler; Shieber, Stuart; Ngo, J. Thomas (1998)
      We present a new heuristic algorithm for graph bisection, based on an implicit notion of clustering. We describe how the heuristic can be combined with stochastic search procedures and a postprocess application of the ...

    • Seed-Growth Heuristics for Graph Bisection 

      Ruml, Wheeler; Marks, Joe; Shieber, Stuart Merrill; Ngo, J. Thomas (1999)
      We investigate a family of algorithms for graph bisection that are based on a simple local connectivity heuristic, which we call seed-growth. We show how the heuristic can be combined with stochastic search procedures and ...

    • The semantics of grammar formalisms seen as computer languages 

      Pereira, Fernando C. N.; Shieber, Stuart (Association for Computational Linguistics, 1984)
      The design, implementation, and use of grammar formalisms for natural language have constituted a major branch of computational linguistics throughout its development. By viewing grammar formalisms as just a special case ...

    • Sentence-level grammatical error identification as sequence-to-sequence correction 

      Schmaltz, Allen Richard; Kim, Yoon; Rush, Alexander Matthew; Shieber, Stuart Merrill (Association of Computational Linguistics, 2016)
      We demonstrate that an attention-based encoder-decoder model can be used for sentence-level grammatical error identification for the Automated Evaluation of Scientific Writing (AESW) Shared Task 2016. The attention-based ...

    • A Simple Language for Novel Visualizations of Information 

      Lucas, Wendy; Shieber, Stuart M. (Springer-Verlag, 2009)
      While information visualization tools support the representation of abstract data, their ability to enhance one’s understanding of complex relationships can be hindered by a limited set of predefined charts. To enable novel ...

    • Simpler TAG semantics through synchronization 

      Nesson, Rebecca; Shieber, Stuart (Center for the Study of Language and Information, 2006)
      In recent years Laura Kallmeyer, Maribel Romero, and their collaborators have led research on TAG semantics through a series of papers refining a system of TAG semantics computation. Kallmeyer and Romero bring together ...