John Henderson

String Transformation Learning

String transformation systems have been introduced in (Brill, 1995) and have several applications in natural language processing. In this work we consider the computational problem of automatically learning from a given corpus the set of transformations presenting the best evidence. We introduce an original data structure and efficient algorithms that learn some families of transformations that are relevant for part-of-speech tagging and phonological rule systems. We also show that the same learning problem becomes NP-hard in cases of an unbounded use of dont care symbols in a transformation.

Re-Awakening Languages: Theory and Practice in the Revitalisation of Australia's Indigenous Languages by Hobson John, Lowe Kevin, Poetsch Susan and Walsh Michael (Eds.) Sydney University Press, Sydney, 2010, xxiii + 457 pp., ISBN 978 1 92089 955 4

Review(s) of: Re-awakening languages: Theory and practice in the revitalisation of Australias indigenous languages, by John Hobson, Kevin Lowe, Susan Poetsch, and Michael Walsh (Eds.), Sydney University Press, Sydney, 2010, xxiii + 457 pp., ISBN 978 1 92089 955 4.