{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":31,"n_cols":5,"rows_kept":31,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[11,2,11,3],[12,2,12,3],[13,2,13,3],[18,2,18,3],[19,2,19,3],[23,2,23,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9911019863803321"]
[null,null,"Autore",null,"Levinson Stephen E"]
[null,null,"Titolo",null,"Mathematical models for speech technology / / Stephen E. Levinson"]
[null,null,"Pubbl/distr/stampa",null,"Chichester, West Sussex, England ; ; Hoboken, NJ, USA, : John Wiley, c2005"]
[null,null,"ISBN",null,"9786610275120"]
[{"$nulls":4},"9781280275128"]
[{"$nulls":4},"128027512X"]
[{"$nulls":4},"9780470020913"]
[{"$nulls":4},"0470020911"]
[{"$nulls":4},"9780470020906"]
[{"$nulls":4},"0470020903"]
[null,null,"Descrizione fisica",null,"1 online resource (283 p.)"]
[null,null,"Disciplina",null,"006.4/54/015118"]
[null,null,"Soggetti",null,"Speech processing systems"]
[{"$nulls":4},"Computational linguistics"]
[{"$nulls":4},"Applied linguistics - Mathematics"]
[{"$nulls":4},"Stochastic processes"]
[{"$nulls":4},"Knowledge, Theory of"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references (p. [243]-255) and index."]
[null,null,"Nota di contenuto",null,"Mathematical Models for Speech Technology; Contents; Preface; 1 Introduction; 1.1 Milestones in the history of speech technology; 1.2 Prospects for the future; 1.3 Technical synopsis; 2 Preliminaries; 2.1 The physics of speech production; 2.1.1 The human vocal apparatus; 2.1.2 Boundary conditions; 2.1.3 Non-stationarity; 2.1.4 Fluid dynamical effects; 2.2 The source-filter model; 2.3 Information-bearing features of the speech signal; 2.3.1 Fourier methods; 2.3.2 Linear prediction and the Webster equation; 2.4 Time-frequency representations; 2.5 Classification of acoustic patterns in speech"]
[{"$nulls":4},"2.5.1 Statistical decision theory2.5.2 Estimation of class-conditional probability density functions; 2.5.3 Information-preserving transformations; 2.5.4 Unsupervised density estimation - quantization; 2.5.5 A note on connectionism; 2.6 Temporal invariance and stationarity; 2.6.1 A variational problem; 2.6.2 A solution by dynamic programming; 2.7 Taxonomy of linguistic structure; 2.7.1 Acoustic "]
[{"$nulls":4},"phonetics, phonology, and phonotactics; 2.7.2 Morphology and lexical structure; 2.7.3 Prosody, syntax, and semantics; 2.7.4 Pragmatics and dialog; 3 Mathematical models of linguistic structure"]
[{"$nulls":4},"3.1 Probabilistic functions of a discrete Markov process3.1.1 The discrete observation hidden Markov model; 3.1.2 The continuous observation case; 3.1.3 The autoregressive observation case; 3.1.4 The semi-Markov process and correlated observations; 3.1.5 The non-stationary observation case; 3.1.6 Parameter estimation via the EM algorithm; 3.1.7 The Cave-Neuwirth and Poritz results; 3.2 Formal grammars and abstract automata; 3.2.1 The Chomsky hierarchy; 3.2.2 Stochastic grammars; 3.2.3 Equivalence of regular stochastic grammars and discrete HMMs; 3.2.4 Recognition of well-formed strings"]
[{"$nulls":4},"3.2.5 Representation of phonology and syntax4 Syntactic analysis; 4.1 Deterministic parsing algorithms; 4.1.1 The Dijkstra algorithm for regular languages; 4.1.2 The Cocke-Kasami-Younger algorithm for context-free languages; 4.2 Probabilistic parsing algorithms; 4.2.1 Using the Baum algorithm to parse regular languages; 4.2.2 Dynamic programming methods; 4.2.3 Probabilistic Cocke-Kasami-Younger methods; 4.2.4 Asynchronous methods; 4.3 Parsing natural language; 4.3.1 The right-linear case; 4.3.2 The Markovian case; 4.3.3 The context-free case; 5 Grammatical Inference"]
[{"$nulls":4},"5.1 Exact inference and Gold's theorem5.2 Baum's algorithm for regular grammars; 5.3 Event counting in parse trees; 5.4 Baker's algorithm for context-free grammars; 6 Information-theoretic analysis of speech communication; 6.1 The Miller et al. experiments; 6.2 Entropy of an information source; 6.2.1 Entropy of deterministic formal languages; 6.2.2 Entropy of languages generated by stochastic grammars; 6.2.3 Epsilon representations of deterministic languages; 6.3 Recognition error rates and entropy; 6.3.1 Analytic results derived from the Fano bound; 6.3.2 Experimental results"]
[{"$nulls":4},"7 Automatic speech recognition and constructive theories of language"]
[null,null,null,"Sommario/riassunto","Mathematical Models of Spoken Language presents the motivations for, intuitions behind, and basic mathematical models of natural spoken language communication. A comprehensive overview is given of all aspects of the problem from the physics of speech production through the hierarchy of linguistic structure and ending with some observations on language and mind. The author comprehensively explores the argument that these modern technologies are actually the most extensive compilations of linguistic knowledge available.Throughout the book, the emphasis is on placing all the material in"]