Defining string functions via patterns

f(s)=

{

TRUE if s ? L(?)

FALSE otherwise

f(s)=

{

TRUE if Dist(?,s) ? const

FALSE otherwise

Given a string s and a pattern ? which defines a language L(?) , define a classification (conservation) function f by

Where Dist(?,s) = mins’?L(?) dist(s’,s)

e.g. string comparison distance

Previous slide

Next slide

Back to first slide

View graphic version