The objective of this project was to implement code in Python that can analyze two strings (of the same length or of differing lengths), and return a ruleset that explains the changes they underwent to go from string 1 → string 2, where string 1 is the input and string 2 is the output. This type of analysis is something commonly done in the field of computational phonology through the use of logical languages like first order logic and monadic second order logic.
-
Notifications
You must be signed in to change notification settings - Fork 1
Dechrissen/AMS561-Final
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Final project for AMS 561: Introduction to Computational Science at Stony Brook University (Spring 2020)
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published