GENERAL ENQUIRIES: Tel: + 27 12 841 2911 | Email: callcentre@csir.co.za

Show simple item record

dc.contributor.author Davel, MH
dc.date.accessioned 2012-02-23T13:34:17Z
dc.date.available 2012-02-23T13:34:17Z
dc.date.issued 2005-08
dc.identifier.citation Davel, MH. Pronunciation modelling and bootstrapping. 2005. Submitted in partial fulfilment of the requirements for the degree Philosophiae Doctor (Electronic Engineering), Faculty of Engineering, the Built Environment and Information Technology, University of Pretoria en_US
dc.identifier.uri http://www.meraka.org.za/pubs/davel05pronunciation.pdf
dc.identifier.uri http://hdl.handle.net/10204/5595
dc.description Submitted in partial fulfilment of the requirements for the degree Philosophiae Doctor (Electronic Engineering), Faculty of Engineering, the Built Environment and Information Technology, University of Pretoria en_US
dc.description.abstract Bootstrapping techniques have the potential to accelerate the development of language technology resources. This is of specific importance in the developing world where language technology resources are scarce and linguistic diversity is high. In this thesis we analyse the pronunciation modelling task within a bootstrapping framework, as a case study in the bootstrapping of language technology resources. We analyse the grapheme-to-phoneme conversion task in the search for a grapheme-to-phoneme conversion algorithm that can be utilised during bootstrapping. We experiment with enhancements to the Dynamically Expanding Context algorithm and develop a new algorithm for grapheme-tophoneme rule extraction (Default&Refine) that utilises the concept of a ‘default phoneme’ to create a cascade of increasingly specialised rules. This algorithm displays a number of attractive properties including rapid learning, language independence, good asymptotic accuracy, robustness to noise, and the production of a compact rule set. In order to have greater flexibility with regard to the various heuristic choices made during rewrite rule extraction, we define a new theoretical framework for analysing instance-based learning of rewrite rule sets. We define the concept of minimal representation graphs, and discuss the utility of these graphs in obtaining the smallest possible rule set describing a given set of discrete training data. We develop an approach for the interactive creation of pronunciation models via bootstrapping, and implement this approach in a system that integrates various of the analysed grapheme-to-phoneme alignment and conversion algorithms. The focus of this work is on combining machine learning and human intervention in such a way as to minimise the amount of human effort required during bootstrapping, and a generic framework for the analysis of this process is defined. Practical tools that support the bootstrapping process are developed and the efficiency of the process is analysed from both a machine learning and a human factors perspective. We find that even linguistically untrained users can use the system to create electronic pronunciation dictionaries accurately, in a fraction of the time the traditional approach requires. We create new dictionaries in a number of languages (isiZulu, Afrikaans and Sepedi) and demonstrate the utility of these dictionaries by incorporating them in speech technology systems. en_US
dc.language.iso en en_US
dc.subject Bootstrapping en_US
dc.subject Grapheme-to-phoneme conversion en_US
dc.subject Grapheme-to-phoneme alignment en_US
dc.subject Letter-to-sound en_US
dc.subject Pronunciation modelling en_US
dc.subject Pronunciation prediction en_US
dc.subject Pronunciation rules en_US
dc.subject Pronunciation dictionary en_US
dc.subject Language technology resource development en_US
dc.title Pronunciation modelling and bootstrapping en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search ResearchSpace


Advanced Search

Browse

My Account