Home

The Three fundamental rules of texting:

1. Wait at least 5 minutes before responding to a text message.
2. Never text two days in a row unless conversation has been initialized by target.
3. Initialize text every other day at randomized time unless doing so break either of the previous rules.

Future Plans

• Build a larger message database
• Use sudo Bayes Theorem by giving values (weights) to each beginning message and ending message and decreasing their values (weights) for a certain person that has been sent that particular message.
• For example, Let's say all messages start off with a base rating of 10. If I send Amy Beginning: "Hey Amy just wanted to tell you" Ending: " I miss you" both that beginning and ending are decremented by one for Amy's rating.

Now, beginning Amy: B_a -= 1 = 9 and ending Amy E_a -= 1 = 9. If we always choose beginning and ending combinations that are the closest to the maximum message rating, 100 <-- 10*10 (signifying a beginning and ending that has never been used) and higher than the lower message combinations (signifying that message beginning or ending has been used before) then all permutation will have been executed before they are all equal again and need to be set back to 10.

• This way, not only will the message seem more authentic and believable but the limitations will always be known based on the size of the beginning and ending message sets for that particular person.

Example:

• All message ratings = 10
• beginnings: {Hey, Whats up $name, Hello $name}
• endings: { how are you doing?, I miss you., I have been thinking about you.}
• beginnings[0-2].rating = 10
• jointRating = beginnings[0]*endings[0] = 100
• message = Hey how are you doing?
• beginning[0].rating -= 1
• ending[0].rating -= 1
• jointRating = beginnings[0]*endings[0] = 81
• the next message to that person could be jointRating = beginnings[0]*endings[1] = 90
• message = Hey I miss you.

As long as the rating is <= rating_max = 100 and >= rating_lowest When all beginnings and endings have hit 0, then we have gone through all permutations many times.

In truth, the base rating only need be beginnings.length * endings.length as that is the maximum number of combinations that can be made with X number of beginnings and Y number of endings for that person. But why not dream a larger database into existence?

• Provide stand alone desktop applications for Mac, PC, Linux.
• Mobile application.
• Who knows what else?