The decision consists of 2 parts – preprocessing and replies to the requests. When preprocessing it is necessary to compare to each text some vector of numbers. The method of doing it is counting the frequencies of words (or N-gram), entering the text, and SVD application to the received set of numbers. The project also includes the realization of Kd-Tree (it is used while working with the requests).
-
Notifications
You must be signed in to change notification settings - Fork 0
The decision consists of 2 parts – preprocessing and replies to the requests. When preprocessing it is necessary to compare to each text some vector of numbers. The method of doing it is counting the frequencies of words (or N-gram), entering the text, and SVD application to the received set of numbers. The project also includes the realization …
yanina-anastasia/Parallel-text-finder
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
The decision consists of 2 parts – preprocessing and replies to the requests. When preprocessing it is necessary to compare to each text some vector of numbers. The method of doing it is counting the frequencies of words (or N-gram), entering the text, and SVD application to the received set of numbers. The project also includes the realization …
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published