Báo cáo khoa học: "Unsupervised Learning of Dependency Structure for Language Modeling" potx

... France emmanuel.dupoux@gmail.com Abstract Accurate unsupervised learning of phonemes of a language directly from speech is demon- strated via an algorithm for joint unsupervised learning of the topology and parameters of a hidden Markov ... that the original application of SSS was for learning Figure 1: Modified four-way split of a state s. 2. For each HMM state s, co...

Ngày tải lên: 08/03/2014, 01:20

... the joint probability of the prefix and suffix, with a smoothing back-off (the product of the individual probabilities). Scor- ing models of this form proved to be poor perform- ers from the beginning, ... (Yarowsky et al., 2000) to project part of speech tags, named entity tags, and morphology in- formation from one language to the other. For a par- allel corpus of comparable siz...

Ngày tải lên: 08/03/2014, 04:22

... Linguistics A Scalable Probabilistic Classifier for Language Modeling Joel Lang Institute for Language, Cognition and Computation School of Informatics, University of Edinburgh 10 Crichton Street, Edinburgh ... inter- polated form of Kneser-Ney smoothing (Kneser and Ney, 1995) was shown to consistently outperform a variety of other smoothing techniques (Chen and Goodman, 1999) a...

Ngày tải lên: 07/03/2014, 22:20

... argued for a dependency formal- ism called Discontinuous Grammar and annotated a large set of Danish sentences using this formal- ism to create the Danish Dependency Treebank (Kromann, 2003). The formalism ... The formulation works by defining the score of a dependency tree to be the sum of edge scores, s(x, y) =  (i,j)∈y s(i, j) where x = x 1 · · · x n is an input sentence and...

Ngày tải lên: 22/02/2014, 02:20

... ex- amples of the previous section. From the point of view of bag -of- word methods, the pairs (T 1 , H 1 ) and (T 1 , H 2 ) have both the same intra-pair simi- larity since the sentences of T 1 and ... previous analysis for misspelling errors or for the lack of derivationally forms not coded in WordNet. As result, given the syntactic category c w ∈ {noun, verb, adj ective, adve...

Ngày tải lên: 20/02/2014, 12:20

... Proceedings of the COLING/ACL 2006 Main Conference Poster Sessions, pages 428–435, Sydney, July 2006. c 2006 Association for Computational Linguistics 428 0.5 1 ... Computational Linguistics 428 0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 1 2 3 4 5 6 7 8 entropy offset 429 430 431 432 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 0.55 0.6 0.65 0.7 0.75

Ngày tải lên: 20/02/2014, 12:20

... pronun- ciations. Therefore, the algorithm’s performance is strongly correlated 4 with the predictability of rhyming words. For writing systems where the written form of a word approximates its ... scheme for each stanza, using Eq. 2 with uniformly initialized ρ. Figure 1 shows that the accuracy of this system is generally much lower than that of our model for the sub-corpora fr...

Ngày tải lên: 07/03/2014, 22:20

... Correlation of Dependency Relation Paths for Answer Extraction Dan Shen Department of Computational Linguistics Saarland University Saarbruecken, Germany dshen@coli.uni-sb.de Dietrich Klakow Spoken Language ... question into one of predefined patterns, such as ”When did Jack Welch retire from GE?” to the pattern ”When+did+NP+Verb+NPorPP”. For each ques- tion pattern, there is a s...

Ngày tải lên: 08/03/2014, 02:21

... a rich set of linguistic features, annotating a large corpus with event coreference information for a new language or domain of interest requires a substantial amount of manual effort. Also, ... several types of classes: the part- of- speech of the HW feature (POS), the word class of the HW feature (HWC), and the event class of the mention (EC). The HWC feature can take one...

Ngày tải lên: 07/03/2014, 22:20

... n z is the number of elements of Z −i,j with entity index z. Similarly we have for the contribu- tion of the emissions: P (H i,j = h|Z, H −i,j ) ∝ n h,z + λ H where n h,z is the number of times we ... chosen, this formulation follows the basic hierarchical Dirichlet process prior of Teh et al. (2006). Once the entities are chosen, our model for the realization of the mentions...

Ngày tải lên: 08/03/2014, 02:21