EditDistance structureANSITerm structureArrayQSort structureArrayQSortFn functorAtom structureBase64 structureBinaryMapFn functorBinarySetFn functorBitArray structureBSearchFn functorCharMap structureDynamicArray structureDynamicArrayFn functorEditDistance structureFifo structureFNVHash structureFormat structureFormatComb structureGetOpt structureGraphSCCFn functorHash2TableFn functorHASH_KEY signatureHashSetFn functorHashString structureHashTable structureHashTableFn functorINTERVAL_DOMAIN signatureIntervalSetFn functorIOUtil structureKeywordFn functorMONO_PRIORITYQ signatureLibBase structureListFormat structureListMapFn functorListMergeSort structureListSetFn functorListXProd structureMonoArrayFn functorMONO_HASH_TABLE signatureORD_KEY signatureORD_MAP signatureORD_SET signatureParserComb structurePathUtil structurePropList structureQueue structureRand structureRandom structureRealOrderStats structureRedBlackMapFn functorRedBlackSetFn functorScan structureSplayMapFn functorSplaySetFn functorTimeLimit structureUnivariateStats structureURef structureUTF8 structureThe EditDistance structure computes the "optimal string alignment"
(or Levenshtein) distance between two strings.
structure EditDistanceval distance : string * string -> intval distance : string * string -> intdistance (s1, s2) returns the number of edit operations required to make the
two strings equal. Edit operations include deleting a character, inserting a
character, replacing a character with another, and swapping two adjacent
characters.