Path: utzoo!attcan!uunet!timbuk!cs.umn.edu!ub.d.umn.edu!rutgers!att!linac!pacific.mps.ohio-state.edu!zaphod.mps.ohio-state.edu!wuarchive!mit-eddie!bloom-beacon!eru!hagbard!sunic!mcsun!unido!fauern!forwiss.uni-passau.de!unipas.fmi.uni-passau.de!roeder
From: roeder@unipas.fmi.uni-passau.de (Hans-Joachim Roeder)
Newsgroups: comp.theory
Subject: Levenshtein distance
Message-ID: <1990Nov6.133546.15549@forwiss.uni-passau.de>
Date: 6 Nov 90 13:35:46 GMT
Sender: usenet@forwiss.uni-passau.de (USENET News System)
Organization: University of Passau, W-Germany
Lines: 8
Nntp-Posting-Host: trillian-gw.fmi.uni-passau.de

I'm looking for a formal definition of the Levenshtein distance of
two codes. As far as I know, it's got something to do with the number
of insertions and deletions you have to apply to one code word to 
transform it to another. Can anybody give me some hints where to find
the exact definition? Thanks in advance.
--
Hans-Joachim Roeder, University of Passau, Dep. of Math. & Comp. Sci., Germany
roeder@unipas.fmi.uni-passau.de