scholarly journals Generalized pattern matching and periodicity under substring consistent equivalence relations

2016 ◽  
Vol 656 ◽  
pp. 225-233 ◽  
Author(s):  
Yoshiaki Matsuoka ◽  
Takahiro Aoki ◽  
Shunsuke Inenaga ◽  
Hideo Bannai ◽  
Masayuki Takeda
Keyword(s):  
Pattern Matching ◽  
Equivalence Relations ◽  
Generalized Pattern Matching

Generalized Pattern Matching Statistics

2002 ◽  
pp. 249-265 ◽  
Author(s):  
Jérémie Bourdon ◽  
Brigitte Vallée
Keyword(s):  
Pattern Matching ◽  
Generalized Pattern Matching

scholarly journals A Parameterized Study of Maximum Generalized Pattern Matching Problems

Algorithmica ◽  
2015 ◽  
Vol 75 (1) ◽  
pp. 1-26 ◽  
Author(s):  
Sebastian Ordyniak ◽  
Alexandru Popa
Keyword(s):  
Pattern Matching ◽  
Matching Problems ◽  
Generalized Pattern Matching

A generalized pattern matching approach for multi-step prediction of crude oil price

2008 ◽  
Vol 30 (3) ◽  
pp. 889-904 ◽  
Author(s):  
Ying Fan ◽  
Qiang Liang ◽  
Yi-Ming Wei
Keyword(s):  
Crude Oil ◽  
Pattern Matching ◽  
Oil Price ◽  
Crude Oil Price ◽  
Generalized Pattern Matching

scholarly journals Standardization of Terms Applying Finite-State Transducers (FST)

2009 ◽  
pp. 102-112 ◽  
Author(s):  
Carmen Galvez
Keyword(s):  
Pattern Matching ◽  
Equivalence Relations ◽  
Finite State Transducers ◽  
Syntactic Pattern ◽  
Finite State ◽  
Standardization Process ◽  
Text Database ◽  
Basic Approaches ◽  
Search For Information ◽  
Standardization Methods

This chapter presents the different standardization methods of terms at the two basic approaches of nonlinguistic and linguistic techniques, and sets out to justify the application of processes based on finitestate transducers (FST). Standardization of terms is the procedure of matching and grouping together variants of the same term that are semantically equivalent. A term variant is a text occurrence that is conceptually related to an original term and can be used to search for information in a text database. The uniterm and multiterm variants can be considered equivalent units for the purposes of automatic indexing. This chapter describes the computational and linguistic base of the finite-state approach, with emphasis on the influence of the formal language theory in the standardization process of uniterms and multiterms. The lemmatization and the use of syntactic pattern-matching, through equivalence relations represented in FSTs, are emerging methods for the standardization of terms.

scholarly journals Generalized Pattern-Matching Conditions for

2013 ◽  
Vol 2013 ◽  
pp. 1-20 ◽  
Author(s):  
Sergey Kitaev ◽  
Andrew Niedermaier ◽  
Jeffrey Remmel ◽  
Manda Riehl
Keyword(s):  
Symmetric Group ◽  
Pattern Matching ◽  
Infinite Number ◽  
Generating Functions ◽  
Symmetric Function ◽  
Symmetric Functions ◽  
Matching Condition ◽  
Natural Analogues ◽  
Generalized Pattern Matching ◽  
Product Order

We derive several multivariable generating functions for a generalized pattern-matching condition on the wreath product of the cyclic group and the symmetric group . In particular, we derive the generating functions for the number of matches that occur in elements of for any pattern of length 2 by applying appropriate homomorphisms from the ring of symmetric functions over an infinite number of variables to simple symmetric function identities. This allows us to derive several natural analogues of the distribution of rises relative to the product order on elements of . Our research leads to connections to many known objects/structures yet to be explained combinatorially.

Sign in / Sign up

Export Citation Format

Share Document