Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Detecting sequential structure

      Nevill-Manning, Craig G.; Witten, Ian H.
      Thumbnail
      Files
      Detecting Sequential Structure.pdf
      101.7Kb
      Link
       www.machinelearning.org
      Citation
      Export citation
      Nevill-Manning, C.G. & Witten, I.H. (1995). Detecting sequential structure. In Proceedings of Workshop on Programming by Demonstration, Twelfth International Conference on Machine Learning, Lake Tahoe, USA, July 9th 1995 (pp. 49-56).
      Permanent Research Commons link: https://hdl.handle.net/10289/4691
      Abstract
      Programming by demonstration requires detection and analysis of sequential patterns in a user’s input, and the synthesis of an appropriate structural model that can be used for prediction. This paper describes SEQUITUR, a scheme for inducing a structural description of a sequence from a single example. SEQUITUR integrates several different inference techniques: identification of lexical subsequences or vocabulary elements, hierarchical structuring of such subsequences, identification of elements that have equivalent usage patterns, inference of programming constructs such as looping and branching, generalisation by unifying grammar rules, and the detection of procedural substructure., Although SEQUITUR operates with abstract sequences, a number of concrete illustrations are provided.
      Date
      1995
      Type
      Conference Contribution
      Rights
      This article has been published in Proceedings of Workshop on Programming by Demonstration, Twelfth International Conference on Machine Learning, Lake Tahoe, USA, July 9th 1995. © 1995 the authors.
      Collections
      • Computing and Mathematical Sciences Papers [1454]
      Show full item record  

      Usage

      Downloads, last 12 months
      30
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement