There are 2 collections.

Word collection and text collection (1 item = 1 pages).

I take the page, then break it into words and search through the distance of Levinstein in an attempt to find similar words on the page.

For a very long time ... How would it be parallelized? If I am not mistaken, then iterators are not thread-safe => as I understand it, in order to achieve parallelism, I will have to copy a collection of words on each stream?

  • iterators are thread-safe (relative to each other), unless you change the original collection - PashaPash ♦
  • one
    Repeatedly already on this site advised the book Patterns for Parallel Programming - there is a way to parallelize the Levenshtein algorithm. Suddenly useful. - Alexander Petrov
  • @PashaPash, hmm ... It seemed to me that there is no and MSDN is silent about this. In this case, I can parallelize the collection of words. - iluxa1810
  • @ iluxa1810 iterating a collection through enumerable usually does not change this collection. if there are no changes, there are no problems with multithreading. - PashaPash ♦

0