https://github.com/petroniuss/text-algorithms
Implementation of various text algorithms
https://github.com/petroniuss/text-algorithms
Last synced: 2 months ago
JSON representation
Implementation of various text algorithms
- Host: GitHub
- URL: https://github.com/petroniuss/text-algorithms
- Owner: Petroniuss
- Created: 2020-03-18T18:18:27.000Z (about 5 years ago)
- Default Branch: master
- Last Pushed: 2020-08-29T11:08:14.000Z (almost 5 years ago)
- Last Synced: 2025-01-29T14:50:25.013Z (4 months ago)
- Language: Jupyter Notebook
- Homepage:
- Size: 25.7 MB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Text-Algorithms
Class completed during 4th semester of studying computer science at AGH.
Overview of laboratories:
1. finding patterns in strings:
- naive
- finite automata
- kmp
2. complex data structures:
- building trie and suffix tree based on McCreight algorithm
3. compression:
- static Huffman
- dynamic Huffman
4. edit distance:
- animation of the algorithm
- implementation of diff (popular linux command)
5. finiding two diemnsional patterns:
- implementation of Aho-Corasick and Bird&Baker to find all occurences of a letter within image
6. once again finding patterns in strings:
- DBF and Karp-Miller-Rosenberg Algorithm
7. implementation of regex engine
- obviously this is rather simple one and I implemented only a subset of regex operators
though result is still satisfactory :)
Every folder should contain report.ipynb file which shows some example of working algorithm.