Suffix arrays

2020 ◽  
pp. 139-234
Author(s):  
Thomas Mailund
Keyword(s):  
Suffix Arrays

Periodicity data mining in time series using Suffix Arrays

2012 ◽  
Author(s):  
Konstantinos F. Xylogiannopoulos ◽  
Panagiotis Karampelas ◽  
Reda Alhajj
Keyword(s):  
Data Mining ◽  
Time Series ◽  
Suffix Arrays

scholarly journals An elegant algorithm for the construction of suffix arrays

2014 ◽  
Vol 27 ◽  
pp. 21-28 ◽  
Author(s):  
Sanguthevar Rajasekaran ◽  
Marius Nicolae
Keyword(s):  
Suffix Arrays

Efficient Operational Profiling of Systems Using Suffix Arrays on Execution Logs

2008 ◽  
Author(s):  
Meiyappan Nagappan ◽  
Mladen A. Vouk ◽  
Kesheng Wu ◽  
Alex Sim ◽  
Arie Shoshani
Keyword(s):  
Suffix Arrays

scholarly journals A Fast and Simple Online Synchronous Context Free Grammar Extractor

2014 ◽  
Vol 102 (1) ◽  
pp. 17-26 ◽  
Author(s):  
Baltescu Paul ◽  
Blunsom Phil
Keyword(s):  
Traditional Approach ◽  
Training Data ◽  
Context Free Grammar ◽  
Parallel Corpora ◽  
Suffix Arrays ◽  
Parallel Data ◽  
Efficient Data ◽  
A New Technique ◽  
Translation Systems ◽  
Context Free

Abstract Hierarchical phrase-based machine translation systems rely on the synchronous context free grammar formalism to learn and use translation rules containing gaps. The grammars learned by such systems become unmanageably large even for medium sized parallel corpora. The traditional approach of preprocessing the training data and loading all possible translation rules into memory does not scale well for hierarchical phrase-based systems. Online grammar extractors address this problem by constructing memory efficient data structures on top of the source sideof the parallel data (often based on suffix arrays), which are usedto efficiently match phrases in the corpus and to extract translation rules on the fly during decoding. This paper describes an open source implementation of an online synchronous context free grammar extractor. Our approach builds on the work of Lopez (2008a) and introduces a new technique for extending the lists of phrase matches for phrases containing gaps that reduces the extraction time by a factor of 4. Our extractor is available as part of the cdec toolkit1 (Dyer et al., 2010).

scholarly journals Linear-Time Construction of Suffix Arrays

2003 ◽  
pp. 186-199 ◽  
Author(s):  
Dong Kyue Kim ◽  
Jeong Seop Sim ◽  
Heejin Park ◽  
Kunsoo Park
Keyword(s):  
Linear Time ◽  
Suffix Arrays

ON THE ACCELERATION OF OPTIMIZATION METHODS FOR THE PROBLEM OF SYNTHESIS OF MULTILAYER OPTICAL COATINGS

2021 ◽  
Vol 6 ◽  
pp. 13-26
Author(s):  
Alexander Mitsa ◽  
◽  
Petr Stetsyuk ◽  
Alexander Levchuk ◽  
Vasily Petsko ◽  
...  
Keyword(s):  
Objective Function ◽  
Golden Section ◽  
Optical Coatings ◽  
Generalized Gradient ◽  
Arithmetic Operations ◽  
Section Method ◽  
Suffix Arrays ◽  
Multidimensional Search ◽  
Golden Section Method ◽  
Speed Up

Five ways to speed up the multidimensional search in order to solve the problem of synthesis of multilayer optical coatings by using the methods of zero and first orders have been considered. The first way is to use an analytical derivative for the target quality function of the multilayer coating. It allows us to calculate accurately (within the computer arithmetic) the value of the gradient of a smooth objective function and generalized gradient of a non-smooth objective one. The first way requires the same number of arithmetic operations as well as finite-difference methods of calculating the gradient and the generalized gradient. The second way is to use a speedy finding of the objective function gradient using the prefix- and suffix-arrays in the analytical method of calculating the gradient. This technique allows us to reduce the number of arithmetic operations thrice for large-scale problems. The third way is the use of tabulating the values of trigonometric functions to calculate the characteristic matrices. This technique reduces the execution time of multiplication operations of characteristic matrices ten times depending on the computer’s specifications. For some computer architectures, this advantage is more than 140 times. The fourth method is the use of the golden section method for the one-dimensional optimization in the problems of synthesis of optical coatings. In particular, when solving one partial problem it is shown that the ternary search method requires approximately 40% more time than the golden section method. The fifth way is to use the effective implementation of multiplication of two matrices. It lies in changing the order of the second and third cycles for the well-known method of multiplying two matrices and fixing in a common variable value of the element of the first matrix. This allows us to speed up significantly the multiplication operation of two matrices. For matrices having 1000 x 1000 dimension the acceleration is from 2 to 15 times, depending on the computer's specifications.

Gram-Free Synonym Extraction Via Suffix Arrays

2008 ◽  
pp. 276-285 ◽  
Author(s):  
Minoru Yoshida ◽  
Hiroshi Nakagawa ◽  
Akira Terada
Keyword(s):  
Suffix Arrays
Sign in / Sign up

Export Citation Format

Share Document