✦ LIBER ✦

Lattice Extension and Vocabulary Adaptation for Turkish LVCSR

✍ Scribed by Arisoy, E.; Saraclar, M.

Book ID: 114599039
Publisher: Institute of Electrical and Electronics Engineers
Year: 2009
Tongue: English
Weight: 252 KB
Volume: 17
Category: Article
ISSN: 1558-7916
DOI: 10.1109/tasl.2008.2006655

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An adaptive procedure for fracture simul

An adaptive procedure for fracture simulation in extensive lattice networks

✍ J.E. Bolander Jr.; T. Shiraishi; Y. Isogawa 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 610 KB

Portage: its extension and adaptation fo

Portage: its extension and adaptation for use with adults

✍ Tyerman, Claire ;Sewpaul, Chundrika 📂 Article 📅 2009 🏛 Wiley (Blackwell Publishing) 🌐 English ⚖ 129 KB

Orthogonal lattice algorithms for adapti

Orthogonal lattice algorithms for adaptive filtering and beamforming

✍ J.G. McWhirter; I.K. Proudler 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 836 KB

Adaptive and Efficient Algorithms for La

Adaptive and Efficient Algorithms for Lattice Agreement and Renaming

✍ Attiya, Hagit; Fouren, Arie 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 249 KB

Lattice segmentation and minimum Bayes r

Lattice segmentation and minimum Bayes risk discriminative training for large vocabulary continuous speech recognition

✍ Vlasios Doumpiotis; William Byrne 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 263 KB

Completeness, decidability and complexit

Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary

✍ Herman J. ter Horst 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 496 KB

We prove that entailment for RDF Schema (RDFS) is decidable, NP-complete, and in P if the target graph does not contain blank nodes. We show that the standard set of entailment rules for RDFS is incomplete and that this can be corrected by allowing blank nodes in predicate position. We define seman