a geometric hidden markov tree wavelet model

... F trg (v)) – backward translation probability; it can be esti- mated from a parsed and aligned parallel corpus. To summarize: the task of tectogrammatical transfer can be formulated as revealing the values of ... The mathematics of statistical machine translation: Pa- rameter estimation. Computational Linguistics. Matthew Crouse, Robert Nowak, and Richard Bara- niuk. 1998. Wavelet- based statistical signal ... tree- shaped analogy to the popular n-gram ap- proaches to Statistical Machine Translation (e.g. (Koehn et al., 2003)), in which translation and lan- guage models are trainable separately too....

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

... the ACL Student Research Workshop, pages 19–24, Ann Arbor, Michigan. Zoubin Gha hramani and Michael I. Jordan. 1997. Facto- rial hidden markov models. Machine Learning, 29:1– 31. A. Haghighi and ... Ohio schuler@ling.osu.edu Abstract This paper presents a supervised pronoun anaphora resolution system based on factorial hidden Markov models (FHMMs). The ba- sic idea is that the hidden states of FHMMs are a n explicit ... morphological features of words trained from the corpus and the strings concatenated from the tree leaves are made. This method is about as accurate as the approach described by Klein and Manning...

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

... is part of the Lancaster Treebank corpus and contains 1473 sentences. Each sentence con- tains hand-labeled syntactic roles for natural lan- guage text. A. 200 A. 400 A. 600 A. 800 A. 1000 A. 1200 A. 1400 0.86 0.88 0.90 0.92 0.94 B.200 B.400 B.600 B.800 B.1000 B.1200 B.1400 0.86 0.88 0.90 0.92 0.94 0.86 0.88 0.90 0.92 0.94 F C.200 C.400 C.600 C.800 C.1000 C.1200 C.1400 0.86 0.88 0.90 0.92 0.94 0.86 0.88 0.90 0.92 0.94 F Figure ... different model on the Lan- caster Treebank data set. The models used in this evaluation were trained with observation data from the Lancaster Treebank training set. The training set and testing set are ... a modified hidden Markov model Lin-Yi Chou University of Waikato Hamilton New Zealand lc55@cs.waikato.ac.nz Abstract This paper explores techniques to take ad- vantage of the fundamental difference...

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

... in archaea the top and bottom is rep- resented by Haloarcula marismortui (146 proteins) and Nanoarchaeum equitans (five proteins). The genomes of Oryza sativa and Xenopus tropicalis have many ... within the same range as for other eukaryotes. There are four eukaryotic parasites (Plasmodium falciparum, Plasmo- dium yoelii, Leishmania major and Entamoeba histolyti- ca) for which the ratio of ... 15%, respectively. The bacterial genome of Chlamydophila caviae also show a dual sites proportion of 15%, while the archeal genomes of Thermococcus kodakaraensis and Nanoarchaeum equitans show 17 and 20%, respect- ively....

Ngày tải lên: 23/03/2014, 10:21

Ngày tải lên: 24/04/2014, 13:21

Ngày tải lên: 24/04/2014, 14:09

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

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

Ngày tải lên: 23/06/2014, 01:20

... documents has a very heavy tail; that is, there are a few heavily-used codes and a large number of codes that are used only occasionally. An ideal approach will work well with both high- frequency and ... Ginter, S. Pyysalo, A. Airola, T. Pahikkala, S. Salanter, and T. Salakoski. 2008. Machine learning to automate the assignment of di- agnosis codes to free-text radiology reports: a method description. ... Research Council Canada {Svetlana.Kiritchenko,Colin.Cherry}@nrc-cnrc.gc.ca Abstract The automatic coding of clinical documents is an important task for today’s healthcare providers. Though it can...

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

... International Conference on Machine Learning (ICML), pages 1063–1070, San Francisco, CA, USA. Marilyn A. Walker, Diane J. Litman, Candace A. Kamm, and Alicia Abella. 1997. PARADISE: A framework for ... have an average of 650 surface realisations, including syntactic and lexical variation, and deci- sions of granularity. We refer to the set of alterna- tive realisations of a semantic form as ... approach performs better than greedy or random baselines. 1 Introduction Surface realisation decisions in a Natural Language Generation (NLG) system are often made accord- ing to a language model...

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

... DOM tree alignments, there is substantial re- search focusing on syntactic tree alignment model for machine translation. For example, (Wu 1997; Alshawi, Bangalore, and Douglas, 2000; Yamada and ... documents. Parallel hyperlinks are used to pin- point new parallel data, and make parallel data mining a recursive process. Parallel text chunks are fed into sentence aligner to extract parallel ... three features, the maximum en- tropy model is trained on 1,000 pairs of web pages manually labeled as parallel or non- parallel. The Iterative Scaling algorithm (Pietra, Pietra and Lafferty...

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

... characters in the alphabet. • Transition probabilities and initial probabilities are calculated from language model. • Observations and observation probabilities are as before. a m h e r s t b v f o • ... β k (i) What is Covered • Observable Markov Model • Hidden Markov Model • Evaluation problem • Decoding Problem • We can construct a single HMM for all words. • Hidden states = all characters ... Baum-Welch (known as forward backward) algorithm and EM (Expectation maximization) algorithm HMM Assumptions • Markov assumption: the state transition depends only on the origin and destination • Output-independent...

Ngày tải lên: 14/03/2014, 23:47

... Computational Linguistics A Tree Transducer Model for Synchronous Tree- Adjoining Grammars Andreas Maletti Universitat Rovira i Virgili Avinguda de Catalunya 25, 43002 Tarragona, Spain. andreas.maletti@urv.cat Abstract A ... we assume that all adjunctions are mandatory; i.e., if an aux- iliary tree can be adjoined, then we need to make an adjunction. Thus, a derivation starting from an initial tree to a derived tree ... auxiliary tree by a special marker. Traditionally, the root label A of an auxiliary tree is replaced by A ∅ once adjoined. Since we assume that there are no auxiliary trees with such a root label,...

Ngày tải lên: 17/03/2014, 00:20

... Forest-to-String Statistical Translation Rules. ACL-07. 704-711. Daniel Marcu, W. Wang, A. Echihabi and K. Knight. 2006. SPMT: Statistical Machine Translation with Syntactified Target Language Phrases. ... decoding algorithm. It translates each span ite- ratively from small one to large one (lines 1-2). This strategy can guarantee that when translating the current span, all spans smaller than the ... Brooke Cowan, Ivona Kucerova and Michael Collins. 2006. A discriminative model for tree- to -tree transla- tion . EMNLP-06. 232-241. Yuan Ding and Martha Palmer. 2005. Machine transla- tion using...

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

... 1989. A tree- based statistical language model for natural language speech recognition. IEEE Transactions on Acous- tics, Speech, and Signal Processing, 37:1001- 1008. L. Breiman, J. Friedman, ... by taking a cut through the tree to obtain a set of subtrees. The reason for keeping a hierarchy instead of a fixed partition of the vocabulary is to be able to dynamically adjust the partition ... strong classes by looking at parts of speech and synonyms, it is hard to produce a full hierarchy of a large vocabulary. Perhaps a combination of the expert and data-driven ap- proaches would...

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

... FOR THE MARKOV CHAIN MODEL Perhaps the most significant advantage of the Markov chain formulation is that one can calculate the number of examples needed to acquire a language. Recall it is ... pn@ai.mit.edu, berwick@ai.nfit.edu Abstract This paper shows how to formally characterize lan- guage learning in a finite parameter space as a Markov structure, hnportant new language ... NSF grant 9217041-ASC and ARPA under the HPCC pro- gram. REFERENCES Clark, Robin and Roberts, Ian (1993). " ;A Compu- tational Model of Language Learnability and Lan- guage Change."...

Ngày tải lên: 23/03/2014, 20:21

... probabilities, are encouraging. VARIABLE MEMORY MARKOV MODELS Markov models are a natural candidate for lan- guage modeling and temporal pattern recognition, mostly due to their mathematical simplicity. ... sections, any finite memory Markov model cannot capture the recursive nature of natural lan- guage. The VMM can accommodate longer sta- tistical dependencies than a traditional full-order Markov model, ... context, based on Variable Memory Markov (VMM) models. In con- trast to fixed-length Markov models, which predict based on fixed-length histories, variable memory Markov models dynamically adapt...

Ngày tải lên: 23/03/2014, 20:21

... multicellular eukaryotes and mammals. Species distribution A closer look at the distribution among the classified SDRs in the domains Eukaryota, Bacteria and Archaea (Fig. 2) reveals that more than half ... families are only found among bacteria, where the ‘classical’ SDR type is most prominent. The HMM-based classification is used as a basis for a sustainable and expandable nomenclature system. Abbreviations AKR, ... we apply hidden Markov models (HMMs) to obtain a sequence-based subdivision of the SDR superfamily that allows for automatic classification of novel sequence data and provides the basis for a nomenclature...

Ngày tải lên: 29/03/2014, 09:20