a trainable rulebased algorithm

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
A dynamic programming algorithm for RNA structure

A dynamic programming algorithm for RNA structure

Ngày tải lên : 12/01/2014, 22:07
... are energyminimizationalgorithms(Schusteretal., 1997).Whilenotasaccurateascomparative sequence analysis, these algorithms have still pro- ven to be useful research tools. Thermodynamic parameters are available ... characterized bytheTurnergroup(Freieretal.,1986).Dangling bases can also appear inside multiloop diagrams. Notice also that the coaxial diagram in equation (11) really corresponds with four new diagrams because once we allow pairing, dangling bases also ... calculate the gap matrices. For a given gap matrix, we have to con- sider all the different ways that its diagram can be assembled using one or two matrices at a time. (Again, Feynman diagrams...
  • 16
  • 688
  • 0
Báo cáo khoa học: "Paragraph-, word-, and coherence-based approaches to sentence ranking: A comparison of algorithm and human performance" ppt

Báo cáo khoa học: "Paragraph-, word-, and coherence-based approaches to sentence ranking: A comparison of algorithm and human performance" ppt

Ngày tải lên : 17/03/2014, 06:20
... different approaches to sentence ranking: A simple paragraph-based approach intended as a baseline, two word-based approaches, and two coherence-based approaches. In the paragraph-based approach, ... sentence ranking 2.1 Paragraph-based approach Sentences at the beginning of a paragraph are usually more important than sentences that are further down in a paragraph, due in part to the way people ... number importance ranking NoParagraph WithParagraph Figure 6. Human ranking results for one text (wsj_1306). that there was a coherence tree annotation available in Carlson et al. (2002)’s database....
  • 8
  • 415
  • 0
Báo cáo khoa học: "Evaluating a Trainable Sentence Planner for a Spoken Dialogue System" doc

Báo cáo khoa học: "Evaluating a Trainable Sentence Planner for a Spoken Dialogue System" doc

Ngày tải lên : 23/03/2014, 19:20
... Rambow AT&T Labs – Research Florham Park, NJ, USA rambow@research.att.com Monica Rogati Carnegie Mellon University Pittsburgh, PA, USA mrogati+@cs.cmu.edu Marilyn A. Walker AT&T Labs – Research Florham ... Research Florham Park, NJ, USA walker@research.att.com Abstract Techniques for automatically training modules of a natural language gener- ator have recently been proposed, but a fundamental concern ... for a mixed- initiative travel planning system, AMELIA, de- veloped at AT&T Labs as part of DARPA Com- municator. Consider the required generation ca- pabilities of AMELIA, as illustrated...
  • 8
  • 236
  • 0
Báo cáo khoa học: "Capturing Salience with a Trainable Cache Model for Zero-anaphora Resolution" doc

Báo cáo khoa học: "Capturing Salience with a Trainable Cache Model for Zero-anaphora Resolution" doc

Ngày tải lên : 30/03/2014, 23:20
... theories into machine learning-based approaches. A typical machine learning-based approach to zero-anaphora resolution searches for an an- tecedent in the set of candidates appearing in all the preceding ... have been recently increasing concerns with the need for anaphora resolution to make NLP applications such as IE and MT more reli- able. In particular, for languages such as Japanese, anaphora ... Evaluating automated and manual acquisition of anaphora resolution strategies. In Proceedings of 33th Annual Meeting of the Association for Computational Linguistics (ACL), pages 122–129. M. Asahara...
  • 9
  • 266
  • 0
Báo cáo khoa học: "A Polynomial-Time Algorithm for Statistical Machine Translation" pot

Báo cáo khoa học: "A Polynomial-Time Algorithm for Statistical Machine Translation" pot

Ngày tải lên : 31/03/2014, 06:20
... "stack search" similar to A* methods. One of the primary obstacles to making the statis- tical translation approach practical is slow speed of translation, as performed in A* fashion. ... search for statistical machine transla- tion. In PACLIC-IO, Pacific Asia Conference on Language, Information and Computation, pages 195-204, Hong Kong, December. Wu, Dekai and Xuanyin Xia. ... I can confirm now that the necessary funds will be made available to meet the key targets. Figure 4: Example translation outputs. translation accuracy was performed on a random sample drawn...
  • 7
  • 283
  • 0
Báo cáo khoa học: "Linear Text Segmentation using a Dynamic Programming Algorithm" potx

Báo cáo khoa học: "Linear Text Segmentation using a Dynamic Programming Algorithm" potx

Ngày tải lên : 31/03/2014, 20:20
... Linear Text Segmentation using a Dynamic Programming Algorithm Athanasios Kehagias Dept. of Math., Phys. and Comp. Sciences Aristotle Univ of Thessaloniki GREECE kehagias@egnatia.ee.auth.gr Fragkou ... (Heinonen, 1998) and Utiyama and Isahara (Utiyama and Isa- hara, 2001). Finally, other researchers use probabilistic ap- proaches to text segmentation including the use of hidden Markov models (Yamron et al., 1999), ... following Halliday and Hasan's theory (Halliday and Hasan, 1976), utilize statistical similarity measures such as word cooccurrence. For example the linear discourse segmentation algorithm proposed...
  • 8
  • 348
  • 0
Báo cáo khoa học: "Optimization in Coreference Resolution Is Not Needed: A Nearly-Optimal Algorithm with Intensional Constraints" ppt

Báo cáo khoa học: "Optimization in Coreference Resolution Is Not Needed: A Nearly-Optimal Algorithm with Intensional Constraints" ppt

Ngày tải lên : 31/03/2014, 20:20
... of a Balas solution v (cf. Section 6); no extensional modelling is necessary. Although our special-purpose Balas adaptation no longer constitutes a general framework that can be fed with each and ... complex. 6 A Variant of the Balas Algorithm Our algorithm proceeds as follows: we generate the first consistent solution according to the Balas algorithm (Balas-First, henceforth). The result is a vector ... memory-based learner TiMBL (Daelemans et al., 2004) is used as a (pairwise) classifier. TiMBL stores all training examples, learns fea- ture weights and classifies test instances accord- ing to the majority...
  • 9
  • 436
  • 0
Báo cáo hóa học: " A projective splitting algorithm for solving generalized mixed variational inequalities" doc

Báo cáo hóa học: " A projective splitting algorithm for solving generalized mixed variational inequalities" doc

Ngày tải lên : 21/06/2014, 01:20
... recently. For example, by Rockafel- lar [4], Tseng [5], Xia and Huang [6] and the special case (f = 0) was studied by Crou- zeix [7], Danniilidis and Hadjisavvas [8] and Yao [9]. A large variety of ... fuquanxia@sina. com 1 Department of Mathematics, Sichuan Normal University, Chengdu, Sichuan 610066, P. R. China Full list of author information is available at the end of the article Abstract In this paper, a projective ... 2011:27 http://www.journalofinequalitiesandapplications.com/content/2011/1/27 Page 4 of 14 RESEARC H Open Access A projective splitting algorithm for solving generalized mixed variational inequalities Fu-quan Xia 1* and Yun-zhi Zou 2 * Correspondence: fuquanxia@sina. com 1 Department...
  • 14
  • 196
  • 0
Báo cáo hóa học: " Research Article The Over-Relaxed A-Proximal Point Algorithm for General Nonlinear Mixed Set-Valued Inclusion Framework" docx

Báo cáo hóa học: " Research Article The Over-Relaxed A-Proximal Point Algorithm for General Nonlinear Mixed Set-Valued Inclusion Framework" docx

Ngày tải lên : 21/06/2014, 05:20
... “Perturbed Ishikawa iterative algorithm and stability for nonlinear mixed quasi-variational inclusions involving A, η-accretive mappings,” Advances in Nonlinear Variational Inequalities, vol. ... is a constant. Remark 2.3. The A, η-accretive mappings are more general than H, η-monotone mappings and m-accretive mappings in Banach space or Hilbert space, and the resolvent operators associated ... Theory and Applications 7 Based on Lemma 3.3, we can develop a general over-relaxed A, η-proximal point algorithm to approximating solution of problem 2.1 as follows. Algorithm 3.5. Let X be a...
  • 12
  • 326
  • 0
Báo cáo hóa học: " Research Article Hierarchical Convergence of a Double-Net Algorithm for Equilibrium Problems and Variational Inequality Problems" ppt

Báo cáo hóa học: " Research Article Hierarchical Convergence of a Double-Net Algorithm for Equilibrium Problems and Variational Inequality Problems" ppt

Ngày tải lên : 21/06/2014, 07:20
... variational inequality problem studied by Yamada and Ogura 10, mathematical program studied by Luo et al. 11, hierarchical minimization problem considered by Cabot 12 and Solodov 13, as ... Inequalities and Applications, vol. 2009, Article ID 208692, 13 pages, 2009. 7 F. Cianciaruso, V. Colao, L. Muglia, and H K. Xu, “On an implicit hierarchical fixed point approach to variational ... 1, Article ID 015015, 8 pages, 2008. 6 F. Cianciaruso, G. Marino, L. Muglia, and Y. Yao, “On a two-step algorithm for hierarchical fixed point problems and variational inequalities,” Journal...
  • 16
  • 313
  • 0
Báo cáo hóa học: " Research Article A New Hybrid Algorithm for a System of Mixed Equilibrium Problems, Fixed Point Problems for Nonexpansive Semigroup, and Variational Inclusion Problem" ppt

Báo cáo hóa học: " Research Article A New Hybrid Algorithm for a System of Mixed Equilibrium Problems, Fixed Point Problems for Nonexpansive Semigroup, and Variational Inclusion Problem" ppt

Ngày tải lên : 21/06/2014, 07:20
... Cholamjiak and S. Suantai, A new hybrid algorithm for variational inclusions, generalized equilibrium problems, and a finite family of quasi-nonexpansive mappings,” Fixed Point Theory and Applications, ... methods for families of nonexpansive mappings in Hilbert spaces,” Journal of Mathematical Analysis and Applications, vol. 341, no. 1, pp. 276–286, 2008. 23 S. Takahashi and W. Takahashi, “Strong ... Journal of Inequalities and Applications, vol. 2010, Article ID 728028, 43 pages, 2010. 13 C. Jaiboon, W. Chantarangsi, and P. Kumam, A convergence theorem based on a hybrid relaxed extragradient...
  • 27
  • 408
  • 0