approximate string matching

Martin Okrslar <okrslar@informatik.uni-muenchen.de>
15 Jan 2000 14:16:55 -0500

          From comp.compilers
Related articles
approximate string matching okrslar@informatik.uni-muenchen.de (Martin Okrslar) (2000-01-15)
Re: approximate string matching jrs@JustMakesSense.com (2000-01-15)
Re: approximate string matching rweaver@ix.netcom.com (2000-01-19)
Re: approximate string matching lionel_delafosse@mail.dotcom.fr (Lionel Delafosse) (2000-01-19)
Re: approximate string matching maratb@CS.Berkeley.EDU (Marat Boshernitsan) (2000-01-19)
Re: approximate string matching torbenm@diku.dk (2000-01-19)
| List of all articles for this month |
From: Martin Okrslar <okrslar@informatik.uni-muenchen.de>
Newsgroups: comp.compilers
Date: 15 Jan 2000 14:16:55 -0500
Organization: Department of Computer Sciences, University of Munich
Keywords: theory

Hi,


Does anybody know of an implementation of approximate string matching?


I would like to 'cluster' some files regarding their syntactic
similarity. (I am correcting the homework of some students, and since
I showed them with 'diff', that they did a simple cp they started to
change their files minimally, so that one does not see on the first
diff-glance, that the file is a copy. Note: We are not allowed to
decrease the score of anybody, just because we 'suspect' copying. I
just want to show the students, that we are not completely dumb.)


Thanks
        Martin

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.