Title :
An efficient phoneme distance measure using a lexical tree
Author :
Har-Lev, Baruchi ; Aharonson, Vered ; Moyal, Ami
Author_Institution :
Afeka Center for Language Process., Afeka Acad. Coll. of Eng., Tel Aviv, Israel
Abstract :
The high complexity associated with phonetic search processes when using very large lexica, long utterances and huge speech databases has become a vital issue over the last decade. In this paper, we present a novel phonetic search method based on a lexical tree that addresses this problem. The new suggested method was compared to a basic phonetic search using over 2000 utterances from the IBM Voicemail Databases and a 100k word lexicon. Preliminary results show that using a phonetic search based on the suggested tree method, does not degrade the overall recognition performance and reduces computational complexity by 35%.
Keywords :
computational complexity; speech processing; computational complexity; lexical tree; phoneme distance measure; phonetic search method; phonetic search process; speech database; Computational complexity; Databases; Search engines; Search methods; Speech recognition; Vocabulary;
Conference_Titel :
Electrical and Electronics Engineers in Israel (IEEEI), 2010 IEEE 26th Convention of
Conference_Location :
Eliat
Print_ISBN :
978-1-4244-8681-6
DOI :
10.1109/EEEI.2010.5662179