Re: approximate string matching

Marat Boshernitsan <maratb@CS.Berkeley.EDU>
19 Jan 2000 01:12:57 -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: Marat Boshernitsan <maratb@CS.Berkeley.EDU>
Newsgroups: comp.compilers
Date: 19 Jan 2000 01:12:57 -0500
Organization: University of California at Berkeley
References: 00-01-044
Keywords: lex

You will probably find the MOSS system (Measure Of Software
Similarity: http://www.cs.berkeley.edu/~aiken/moss.html) quite useful
for your purposes.


Marat.


Martin Okrslar <okrslar@informatik.uni-muenchen.de> writes:
> 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.

Post a followup to this message

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