regex coding challenge suggestion

Algorithm for Coding challenge
Step 1:
• Create the first branch by using the length of the seeding word and drawing that word with that length
Step 2:
• Pick the next word using deontic machine .
• If word matches at less then or equal to 3 chars that are in seed word make a new left branch.(note you can play with this)
• If word matches more then or equal to 3 that are in seed word chars create new right branch.
• If no word is found reset top of file and do not create any more breaches off the least breach .
Step 3:
• Repeat step 2 until all breaches have no match.