a sequential importance sampling algorithm for generating random graphs with prescribed degrees

Tài liệu Báo cáo khoa học: "A Best-First Search Algorithm for Generating Referring Expressions" pot

Tài liệu Báo cáo khoa học: "A Best-First Search Algorithm for Generating Referring Expressions" pot

Ngày tải lên : 22/02/2014, 02:20
... reduce this search space, but we also avoid strong commitments. 3 The Algorithm at a Glance Basically, the best-first search algorithm is a generalization of the incremental version: instead of successively ... generated so far, augmented by the minimal value of the description required for excluding the remaining potantial distractors, surpasses the evaluation of the best solution. 4 Formalization ... no successors, an empty category as Nextprop, and scores according to the evaluation function used. When expanding a node, its successor with a suitable boolean combination of descriptors is created...
  • 4
  • 672
  • 3
Báo cáo khoa học: "An Algorithm For Generating Referential Descriptions With Flexible Interfaces" pdf

Báo cáo khoa học: "An Algorithm For Generating Referential Descriptions With Flexible Interfaces" pdf

Ngày tải lên : 08/03/2014, 21:20
... Spatial Relations in General Object Localization Tasks. In Proceedings of the Eighth Australian Joint Conference on Artificial Intelligence, Canberra, Australia. Barbara Grosz, and Candace ... the natural, flat expression 'the table on which there are a glass and a cup'. In (Horacek 1996), the same result can be obtained through an adequate selection of search parameters. ... operators: conceptual predicates cannot always be mapped straightforwardly onto lexemes and grammatical features so that the anticipation of their composability is limited. Even more importantly,...
  • 8
  • 325
  • 0
Báo cáo khoa học: "A Class-Based Agreement Model for Generating Accurately Inflected Translations" pptx

Báo cáo khoa học: "A Class-Based Agreement Model for Generating Accurately Inflected Translations" pptx

Ngày tải lên : 16/03/2014, 19:20
... exponential translation model for target language morphology. In ACL-HLT. C. Tillmann. 2004. A unigram orientation model for statistical machine translation. In NAACL. K. Toutanova, H. Suzuki, and A. ... with l 1 (lasso) regularization (Andrew and Gao, 2007). 2.3 Morpho-syntactic Tagging After segmentation, we tag each segment with a fine- grained morpho-syntactic class. For this task we also train a standard ... phrase ta- ble annotations and can be easily implemented as a feature in many phrase-based decoders. 1 Introduction Languages vary in the degree to which surface forms reflect grammatical relations....
  • 10
  • 414
  • 0
Báo cáo khoa học: "A Beam-Search Extraction Algorithm for Comparable Data" pptx

Báo cáo khoa học: "A Beam-Search Extraction Algorithm for Comparable Data" pptx

Ngày tải lên : 17/03/2014, 02:20
... et al., 2008; Utiyama and Isahara, 2003; Munteanu and Marcu, 2005; Fung and Cheung, 2004). The novel algorithm is successfully eval- uated on news data for two language pairs. A related approach ... com- parable data (Munteanu and Marcu, 2005). For a given source sentence S, a max- imum entropy (ME) classifier is applied to a large set of candidate target transla- tions . A beam-search algorithm ... 2004. Pharaoh: a Beam Search De- coder for Phrase-Based Statistical Machine Transla- tion Models. In Proceedings of AMTA’04, Washing- ton DC, September-October. Dragos S. Munteanu and Daniel Marcu....
  • 4
  • 404
  • 0
Báo cáo khoa học: "A Progressive Feature Selection Algorithm for Ultra Large Feature Spaces" doc

Báo cáo khoa học: "A Progressive Feature Selection Algorithm for Ultra Large Feature Spaces" doc

Ngày tải lên : 17/03/2014, 04:20
... Natural Lan- guage Learning (CoNLL-2002), 49-55, Taibei, Taiwan. Mari Ostendorf, Izhak Shafran, Stefanie Shattuck- Hufnagel, Leslie Charmichael, and William Byrne. 2001. A Prosodically Labeled ... Elizabeth Shriberg, Andreas Stolcke, Bar- bara Peskin, Jeremy Ang, Dustin Hillard, Mari Os- tendorf, Marcus Tomalin, Phil Woodland and Mary Harper. 2005. Structural Metadata Research in the EARS ... Conditional Maximum Entropy (CME) modeling has received a great amount of attention within natural language processing community for the past decade (e.g., Berger et al., 1996; Reynar and Ratnaparkhi,...
  • 8
  • 388
  • 0
Báo cáo khoa học: "A Morphologically Sensitive Clustering Algorithm for Identifying Arabic Roots" docx

Báo cáo khoa học: "A Morphologically Sensitive Clustering Algorithm for Identifying Arabic Roots" docx

Ngày tải lên : 17/03/2014, 07:20
... semantically related pairs of words and document titles. Information Storage and Retrieval,. Vol 10, pp 253-260 Al-Fedaghi Sabah S. and Fawaz Al-Anzi (1989) A new algorithm to generate Arabic ... of Computational Arabic Morphology. DATR Documentation Report, University of Sussex. Al-Raya (1997) Newspaper. Quatar. Al-Shalabi, R. and M. Evens (1998) A Computational Morphology System for Arabic. Proceedings ... stems, and roots as Index terms in an Arabic Information Retrieval system. Journal of the American Society for Information Science, 45/8, pp. 548-560 Al-Najem, Salah R. (1998). An Explanation...
  • 8
  • 263
  • 0
Báo cáo khoa học: " A simple pattern-matching algorithm for recovering empty nodes and their antecedents∗" pot

Báo cáo khoa học: " A simple pattern-matching algorithm for recovering empty nodes and their antecedents∗" pot

Ngày tải lên : 17/03/2014, 08:20
... recall measures for evaluating parse accuracy do not mea- sure the accuracy of empty node and antecedent re- covery, but there is a fairly straightforward extension of them that can evaluate ... knowledge than the pattern-matching algorithm described here. This algorithm is both simple and general, and can serve as a benchmark against which more complex ap- proaches can be evaluated. NP NP DT the NN man SBAR S NP NNP Sam VP VBZ ... A pattern extracted from the tree displayed in Figure 1. accuracy of transitivity labelling was not systemati- cally evaluated here. 2.2 Patterns and matchings Informally, patterns are minimal...
  • 8
  • 346
  • 0
Báo cáo khoa học: "A Trainable Rule-based Algorithm for Word Segmentation" pdf

Báo cáo khoa học: "A Trainable Rule-based Algorithm for Word Segmentation" pdf

Ngày tải lên : 17/03/2014, 23:20
... before AB any Move from after trigram ABC to before ABC any Figure 1: Possible transformations. A, B, C, J, and K are specific characters; x and y can be any character. ~J and ~K can be any character ... that character and begins the search starting at the next character. In this manner, an initial segmen- tation can be obtained that is more informed than a simple character-as-word approach. ... the train- ing data, our rule-based algorithm is able to produce a series of transformations with a high segmentation accuracy. 3.2.2 Maximum matching (greedy) algorithm A common approach...
  • 8
  • 470
  • 0
Báo cáo khoa học: "A Polynomial-Time Parsing Algorithm for TT-MCTAG" pot

Báo cáo khoa học: "A Polynomial-Time Parsing Algorithm for TT-MCTAG" pot

Ngày tải lên : 23/03/2014, 16:21
... deal with all natural language phenomena. This has been argued for tree-local and even set-local MCTAG on the basis of scrambling data from lan- guages such as German (Becker et al., 1992; Ram- bow, ... On matrix languages. Information and Control, 23:86–96. Aravind K. Joshi and Yves Schabes. 1997. Tree- Adjoning Grammars. In G. Rozenberg and A. Salo- maa, editors, Handbook of Formal Languages, ... short, an extension of Tree Adjoining Grammars that has been pro- posed for natural language processing, in particular for dealing with discontinuities and word order variation in languages such as...
  • 9
  • 259
  • 0
A fast quantum mechanical algorithm for database search pptx

A fast quantum mechanical algorithm for database search pptx

Ngày tải lên : 30/03/2014, 13:20
... the Walsh-Hadamard transformation matrix as defined in section 3, it can be implemented as a product of three unitary transformations as , each of W & R is a local transition matrix. R as defined ... 4 state system is of the form: , where and are arbitrary real numbers. Note that, unlike the Walsh-Hadamard transformation and other state transition matrices, the probability in each state stays ... related operation called the Fourier Transformation) is one of the things that makes quantum mechanical algorithms more pow- erful than classical algorithms and forms the basis for most significant...
  • 8
  • 389
  • 1
Báo cáo khoa học: "A Discriminative Global Training Algorithm for Statistical MT" potx

Báo cáo khoa học: "A Discriminative Global Training Algorithm for Statistical MT" potx

Ngày tải lên : 31/03/2014, 01:20
... evaluated on a standard Arabic-English translation task. 1 Introduction This paper presents a view of phrase-based SMT as a sequential process that generates block ori- entation sequences. A ... results are achieved on a standard translation task. While being similar to (Tillmann and Zhang, 2005), the current proce- dure is more automated with comparable perfor- mance. The latter approach ... Approximate Relevant Set Method for each data point initialize truth and alternative for each decoding iteration : for each data point select relevant points (*) update update by solving Eq. 5 approximately...
  • 8
  • 278
  • 0
Báo cáo khoa học: "An Algorithm for Unsupervised Transliteration Mining with an Application to Word Alignment" ppt

Báo cáo khoa học: "An Algorithm for Unsupervised Transliteration Mining with an Application to Word Alignment" ppt

Ngày tải lên : 23/03/2014, 16:20
... Research Previous work on transliteration mining uses a man- ually labelled set of training data to extract translit- eration pairs from a parallel corpus or comparable corpora. The training data ... Unsupervised Transliteration Mining with an Application to Word Alignment Hassan Sajjad Alexander Fraser Helmut Schmid Institute for Natural Language Processing University of Stuttgart {sajjad,fraser,schmid}@ims.uni-stuttgart.de Abstract We ... over training and held- out data, then a non-transliteration word pair such as the English-Hindi pair “change – badlao” may end up in the training data and the related pair “changes – badlao” in...
  • 10
  • 320
  • 0

Xem thêm