GitHub - Karanxa/textanalysisinc: Various text (string) analysis methods like minimum edit distance, matching, entity extraction implemented in pure C

Karanxa / textanalysisinc Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

Various text (string) analysis methods like minimum edit distance, matching, entity extraction implemented in pure C

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
files		files
include		include
README.txt		README.txt
main.c		main.c

Repository files navigation

**This is an open-source program created by students of Computer Science and Engineering of Chandigarh University consisting of four members. Each module of this program has been built by different members of this group. Edit Distance and Steps-of-Conversion by Danish Shakeel, Matching by Karan Arora, and Entity Extraction by Bhargav Sharma and Priyanshu Jain. Supervision, compilation, adaptation and debugging by Danish Shakeel.**

Email:[email protected]
GitHub:www.github.com/Karanxa

Uses:
->Finding Levenshtein Distance
->Find steps to convert one step into another
->Text prediction algorithm and demo code
->Find words in a text file

Made with GCC on Linux and Windows machine.

Suggested Reading:
1. Levenshtein Distance
2. BK-Tree
3. SymSpell

#You can find algorithm for steps, word extraction from the main.c file.
#Algorithm for BK-Tree and Levenshtein is in matchedit.c file in "include".
#Dictionary of english words can be found in "files".