Forum: Python May 8th, 2008 |
| Replies: 16 Views: 774 Re: Slow Comparing Now it's ok, instead of union i used intersection, and it's working FAST :)
Thanks guys for all your help |
Forum: Python May 8th, 2008 |
| Replies: 16 Views: 774 Re: Slow Comparing I tried the sets, just now, it's going very fast :D
it passed all texts in 30 secs. just it gives wrong results. is it ok if I define the sets this way:
s1 = Set(text1.split(' '))
s2 =... |
Forum: Python May 8th, 2008 |
| Replies: 16 Views: 774 Re: Slow Comparing The project is just to find 10 most similar texts to the new text which will be given. The database of texts is created from a news site, the texts are on my native language (Macedonian). Texts are... |
Forum: Python May 8th, 2008 |
| Replies: 16 Views: 774 Re: Slow Comparing my text's are parsed of such words, they do not contain "and", "the", "a", "of", "to", etc. Thanks for the suggestion I will give it a try |
Forum: Python May 8th, 2008 |
| Replies: 16 Views: 774 Re: Slow Comparing Thanks for the code modification. I tried something similar, but the problem is that the program does not give any matches for "Lines common to text1 and text2", and this is the thing I need. I have... |
Forum: Python May 8th, 2008 |
| Replies: 16 Views: 774 Re: Slow Comparing Thanks guys I just tried sequenceMacther and it's going pretty fast, 4min with ratio(), and 2mins with quick_ratio() |
Forum: Python May 8th, 2008 |
| Replies: 16 Views: 774 Re: Slow Comparing ok I used:
diffInstance = difflib.Differ()
diffList = list(diffInstance.compare(list1, list2))
and this returns a list of words with + - before them. As I read and understand probably - means just... |
Forum: Python May 7th, 2008 |
| Replies: 16 Views: 774 |
Forum: Python May 7th, 2008 |
| Replies: 16 Views: 774 Slow Comparing Hello,
I have a project to make a text comparer. I've downloaded almost 90000 texts from a site, parsed them and stored the texts in a file(150MB). So now, a new text is in another file and should be... |