Syntactic pattern recognition techniques are applied to the analysis o
f 1-D seismic traces to classify picker wavelets. Seismic picker wavel
ets have structural information, and each wavelet can be represented b
y a string of symbols. To recognize the strings, we use a finite-state
automaton to identify each string. The automaton can accept strings h
aving substitution, insertion, and deletion errors of the symbols. The
re are two attributes, terminal symbol and weight, in each transition
of the automaton. A minimum-cost, error-correcting, finite-state autom
aton is proposed to parse the input string.