Skip to content

This code work is spotting rhyming characters from rhyming words using the concept of DAFSA.

Notifications You must be signed in to change notification settings

prakharsdev/DAFSA

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 

Repository files navigation

Deterministic Acyclic Finite State Automaton(DAFSA) Rhymer

In my implementation, I have used the concept of DAFSA to find out the characters that are responsible for rhyming from the list of rhyming words. For this, I have used "pronouncing" inbuilt python library that generates the list of rhyming words from the user input word. After the list of rhyming words are generated, I passed it through my self made DAFSA function.

The DAFSA function checks the list by taking a pair of all possible combinations. The pairs are checked in left to right sequence.

The pair of rhyming words are then stored in the list which is of dictionary format. Were key represents the sequence of characters not responsible for rhyming and value represents the sequence of characters responsible for rhyming.

About

This code work is spotting rhyming characters from rhyming words using the concept of DAFSA.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages