... 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...
... areenergyminimizationalgorithms(Schusteretal.,1997).Whilenotasaccurateascomparativesequence analysis, these algorithms have still pro-ven to be useful research tools. Thermodynamicparameters are available ... characterizedbytheTurnergroup(Freieretal.,1986).Danglingbases can also appear inside multiloop diagrams.Notice also that the coaxial diagram in equation (11)really corresponds with four new diagrams becauseonce we allow pairing, dangling bases also ... calculate the gapmatrices. For a given gap matrix, we have to con-sider all the different ways that its diagram can beassembled using one or two matrices at a time.(Again, Feynman diagrams...
... 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 ... numberimportance rankingNoParagraphWithParagraph 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....
... RambowAT&T Labs – ResearchFlorham Park, NJ, USArambow@research.att.comMonica RogatiCarnegie Mellon UniversityPittsburgh, PA, USAmrogati+@cs.cmu.eduMarilyn A. WalkerAT&T Labs – ResearchFlorham ... ResearchFlorham Park, NJ, USAwalker@research.att.comAbstractTechniques for automatically trainingmodules 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...
... theories into machinelearning-based approaches. A typical machine learning-based approachto zero-anaphora resolution searches for an an-tecedent in the set of candidates appearing in allthe preceding ... have been recently increasing concernswith the need for anaphora resolution to makeNLP applications such as IE and MT more reli-able. In particular, for languages such as Japanese,anaphora ... Evaluating automatedand manual acquisition of anaphora resolution strategies.In Proceedings of 33th Annual Meeting of the Associationfor Computational Linguistics (ACL), pages 122–129.M. Asahara...
... "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...
... Linear Text Segmentation using a Dynamic Programming Algorithm Athanasios KehagiasDept. of Math., Phys.and Comp. SciencesAristotle Univ of ThessalonikiGREECEkehagias@egnatia.ee.auth.grFragkou ... (Heinonen,1998) and Utiyama and Isahara (Utiyama and Isa-hara, 2001).Finally, other researchers use probabilistic ap-proaches to text segmentation including the useof hidden Markov models (Yamron et al.,1999), ... following Hallidayand Hasan's theory (Halliday and Hasan, 1976),utilize statistical similarity measures such as wordcooccurrence. For example the linear discoursesegmentation algorithm proposed...
... of a Balas solution v (cf. Section 6); noextensional modelling is necessary.Although our special-purpose Balas adaptationno longer constitutes a general framework that canbe fed with each and ... complex.6 A Variant of the Balas Algorithm Our algorithm proceeds as follows: we generatethe first consistent solution according to the Balas algorithm (Balas-First, henceforth). The result is a vector ... memory-based learner TiMBL (Daelemanset 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...
... 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.com1Department of Mathematics,Sichuan Normal University,Chengdu, Sichuan 610066, P. R.ChinaFull list of author information isavailable at the end of the articleAbstractIn this paper, a projective ... 2011:27http://www.journalofinequalitiesandapplications.com/content/2011/1/27Page 4 of 14RESEARC H Open Access A projective splitting algorithm for solvinggeneralized mixed variational inequalitiesFu-quan Xia1*and Yun-zhi Zou2* Correspondence: fuquanxia@sina.com1Department...
... “Perturbed Ishikawa iterative algorithm and stability for nonlinear mixed quasi-variationalinclusions 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 mappingsand m-accretive mappings in Banach space or Hilbert space, and the resolvent operatorsassociated ... Theory and Applications 7Based 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...
... variational inequality problem studied by Yamada and Ogura10, mathematical program studied by Luo et al. 11, hierarchical minimization problemconsidered by Cabot 12 and Solodov 13, as ... Inequalities and Applications, vol. 2009, ArticleID 208692, 13 pages, 2009.7 F. Cianciaruso, V. Colao, L. Muglia, and H K. Xu, “On an implicit hierarchical fixed point approachto 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 fixedpoint problems and variational inequalities,” Journal...
... Cholamjiak and S. Suantai, A new hybrid algorithm for variational inclusions, generalizedequilibrium problems, and a finite family of quasi-nonexpansive mappings,” Fixed Point Theory andApplications, ... methodsfor families of nonexpansive mappings in Hilbert spaces,” Journal of Mathematical Analysis andApplications, 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 relaxedextragradient...