DSpace
 

Researchspace >
General science, engineering & technology >
General science, engineering & technology >
General science, engineering & technology >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10204/5588

Title: Obtaining a minimal set of rewrite rules
Authors: Davel, M
Barnard, E
Keywords: Minimal representation graphs
Pattern recognition
Issue Date: Nov-2005
Publisher: PRASA
Citation: Davel, M and Barnard, E. Obtaining a minimal set of rewrite rules. Sixteenth Annual Symposium of the Pattern Recognition Association of South Africa, Langebaan, South Africa, 23-25 November 2005
Abstract: In this paper the authors describe a new approach to rewrite rule extraction and analysis, using Minimal Representation Graphs. This approach provides a mechanism for obtaining the smallest possible rule set – within a context-dependent rewrite rule formalism – that describes a set of discrete training data completely, as an indirect approach to obtaining optimal accuracy on an unseen test set. They demonstrate the application of this technique for a pronunciation prediction task.
Description: Sixteenth Annual Symposium of the Pattern Recognition Association of South Africa, Langebaan, South Africa, 23-25 November 2005
URI: http://www.prasa.org/proceedings/2005/prasa05-22.pdf
http://hdl.handle.net/10204/5588
ISBN: 0-7992-2264-X
Appears in Collections:Human language technologies
General science, engineering & technology

Files in This Item:

File Description SizeFormat
Davel1_2005.pdf529.8 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback