Search algorithms

We introduce a novel search algorithm for statistical machine translation based on dynamic programming (DP). During the search process two statistical knowledge sources are combined: a translation model and a bigram language model. This search algorithm expands hypotheses along the positions of the target string while guaranteeing progressive coverage of the words in the source string. We present experimental results on the Verbmobil task.
8p bunrieu_1 18042013 25 4 Download

Search algorithms aim to find solutions or objects with specified properties and constraints in a large solution search space or among a collection of objects. A solution can be a set of value assignments to variables that will satisfy the constraints or a substructure of a given discrete structure. In addition, there are search algorithms, mostly probabilistic, that are designed for the prospective quantum computer.
0p cucdai_1 19102012 31 3 Download

This paper proposes a new probabilistic algorithm for solving multiobjective optimization problems  ProbabilityDriven Search Algorithm. The algorithm uses probabilities to control the process in search of Pareto optimal solutions. Especially, we use the absorbing Markov Chain to argue the convergence of the algorithm. Authors test this approach by implementing the algorithm on some benchmark multiobjective optimization problems, and find very good and stable results.
11p nganga_02 09092015 9 2 Download

Existing algorithms for generating referential descriptions to sets of objects have serious deficits: while incremental approaches may produce ambiguous and redundant expressions, exhaustive searches are computationally expensive. Mediating between these extreme control regimes, we propose a bestfirst searching algorithm for uniquely identifying sets of objects. We incorporate linguistically motivated preferences and several techniques to cut down the search space. Preliminary results show the effectiveness of the new algorithm. ...
4p bunthai_1 06052013 19 1 Download

Outline: Problemsolving agents, Problem types, Problem formulation, Example problems, Basic search algorithms. Replace letters by numbers from 0 to 9 such as no different letter is replaced by the same number and satisfying the following constraint.
17p lalala06 02122015 11 1 Download

Solving Problem by Searching includes problemsolving agents, Problem types, Problem formulation, Basic search algorithms, Uninformed search, Deterministic, fully observable, Conformant (Sensorless) problems.
69p maiyeumaiyeu25 16122016 5 1 Download

Local search is a family of generalpurpose techniques for search and optimization problems. Chapter 5: Local Search provides about Local search basics; General local search algorithm; Hillclimbing; Tabu search; Simulated Annealing; WSAT; Conclusions
42p cocacola_10 08122015 14 0 Download

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: A Fast LSF Search Algorithm Based on Interframe
6p sting12 11032012 14 4 Download

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article QuasiCyclic LDPC Codes of ColumnWeight Two Using a Search Algorithm
8p dauphong19 07032012 28 2 Download

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article Flexible Triangle Search Algorithm for BlockBased Motion Estimation
14p dauphong20 10032012 15 2 Download

Abstractlike text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, we model a global (sentence) level syntactic structure. We couch statistical sentence generation as a spanning tree problem in order to search for the best dependency tree spanning a set of chosen words. We also introduce a new search algorithm for this task that models argument satisfaction to improve the linguistic validity of the generated tree. ...
9p bunthai_1 06052013 24 2 Download

In this paper, we describe a Dynamic Programming (DP) based search algorithm for statistical translation and present experimental results. The statistical translation uses two sources of information: a translation model and a language model. The language model used is a standard bigram model. For the translation lnodel, the alignment probabilities are made dependent on the differences in the alignment positions rather than on the absolute positions.
8p bunthai_1 06052013 8 2 Download

We present a simple yet powerful hierarchical search algorithm for automatic word alignment. Our algorithm induces a forest of alignments from which we can eﬃciently extract a ranked kbest list. We score a given alignment within the forest with a ﬂexible, linear discriminative model incorporating hundreds of features, and trained on a relatively small amount of annotated data. We report results on ArabicEnglish word alignment and translation tasks. Our model outperforms a GIZA++ Model4 baseline by 6.3 points in Fmeasure, yielding a 1.
10p hongdo_1 12042013 18 1 Download

This paper extends previous work on extracting parallel sentence pairs from comparable data (Munteanu and Marcu, 2005). For a given source sentence S, a maximum entropy (ME) classiﬁer is applied to a large set of candidate target translations . A beamsearch algorithm is used to abandon target sentences as nonparallel early on during classiﬁcation if they fall outside the beam. This way, our novel algorithm avoids any documentlevel preﬁltering step.
4p hongphan_1 15042013 18 1 Download

Various kinds of scored dependency graphs are proposed as packed shared data structures in combination with optimum dependency tree search algorithms. This paper classiﬁes the scored dependency graphs and discusses the speciﬁc features of the “Dependency Forest” (DF) which is the packed shared data structure adopted in the “Preference Dependency Grammar” (PDG), and proposes the “Graph Branch Algorithm” for computing the optimum dependency tree from a DF. This paper also reports the experiment showing the computational amount and behavior of the graph branch algorithm. ...
8p hongvang_1 16042013 22 1 Download

This paper describes an incremental parsing approach where parameters are estimated using a variant of the perceptron algorithm. A beamsearch algorithm is used during both training and decoding phases of the method. The perceptron approach was implemented with the same feature set as that of an existing generative model (Roark, 2001a), and experimental results show that it gives competitive performance to the generative model on parsing the Penn treebank. We demonstrate that training a perceptron model to combine with the generative model during search provides a 2.
8p bunbo_1 17042013 21 1 Download

In chapter 11, we cover searching and sorting. After you have read and studied this chapter, you should be able to: Perform linear and binary search algorithms on small arrays, determine whether a linear or binary search is more effective for a given situation, perform selection and bubble sort algorithms, describe the heapsort algorithm and show how its performance is superior to the other two algorithms, apply basic sorting algorithms to sort an array of objects.
58p tangtuy04 12032016 25 1 Download

This book is to examine the most important algorithms in use on today's computers and to teach the basic techniques with the increasing number who was interested in computer users becoming increasingly serious. It is appropriate for use as a textbook for a course Monday, Tuesday or Wednesday in the computer Science: After students have had some programming skills and familiarity computer system, but before they have advanced specialized courses field of computer science or computer applications.
560p vuduytu 29062011 230 87 Download

Algorithms play the central role both in the science and practice of computing. Recognition of this fact has led to the appearance of a considerable number of textbooks on the subject. By and large, they follow one of two alternatives in presenting algorithms. One classifies algorithms according to a problem type. Such a book would have separate chapters on algorithms for sorting, searching, graphs, and so on. The advantage of this approach is that it allows an immediate comparison of, say, the efficiency of different algorithms for the same problem.
593p fangfangfang 11052012 85 24 Download

Tham khảo sách 'thuật toán algorithms', tài liệu phổ thông, toán học phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả
561p transang1 20092012 49 19 Download