Now showing items 6-10 of 15

  • Fast convergence with a greedy tag-phrase dictionary

    Peeters, Ross; Smith, Tony C. (1997-11)
    The best general-purpose compression schemes make their gains by estimating a probability distribution over all possible next symbols given the context established by some number of previous symbols. Such context models ...
  • Investigating the usability of social networking sites for teenagers with autism

    Bahiss, Khadija; Cunningham, Sally Jo; Smith, Tony C. (ACM, 2011)
    Teenagers with Autism Spectrum Disorder (ASD) tend to be socially isolated due to the interpersonal challenges of autism, yet they enjoy using computers. This study investigated the hypothesis that social networking sites ...
  • Language inference from function words

    Smith, Tony C.; Witten, Ian H. (Department of Computer Science, University of Waikato, 1993)
    Language surface structures demonstrate regularities that make it possible to learn a capacity for producing an infinite number of well-formed expressions. This paper outlines a system that uncovers and characterizes ...
  • Learning language using genetic algorithms

    Smith, Tony C.; Witten, Ian H. (Springer, 1996)
    Strict pattern-based methods of grammar induction are often frustrated by the apparently inexhaustible variety of novel word combinations in large corpora. Statistical methods offer a possible solution by allowing frequent ...
  • Models for computer generated parody

    Smith, Tony C.; Witten, Ian H. (Department of Computer Science, University of Waikato, 1993)
    This paper outlines two approaches to the construction of computer systems that generate prose in the style of a given author. The first involves using intuitive notions of stylistic trademarks to construct a grammar that ...