Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Yet another stupid poem #1: Neznayka's method #3

Open
schas002 opened this issue Apr 7, 2017 · 9 comments
Open

Yet another stupid poem #1: Neznayka's method #3

schas002 opened this issue Apr 7, 2017 · 9 comments

Comments

@schas002
Copy link

schas002 commented Apr 7, 2017

This is my first entry into a *GenMo; so don't judge strictly please. (ovo)

Source in Frink.

Basically: It picks an item in the dictionary file and selects others in the same file until the last ENDING_THRESHOLD characters match in both items. Spit them to output. Repeat.

item:     Initial commit
                     |||
ENDING_THRESHOLD: 3  ≠==
                      vv
item2:              init
For a threshold of 3, `Initial com*mit*` and `i*nit*` won't match...

item:     Initial commit
                     |||
ENDING_THRESHOLD: 3  ===
                     vvv
item2:              emit
...but `Initial com*mit*` and `e*mit*` will.

item:    Initial commit
                     ||
ENDING_THRESHOLD: 2  ==
                     vv
item2:             init
If the threshold is lowered, items which didn't match might.
@enkiv2
Copy link

enkiv2 commented Apr 18, 2017

Does this produce even-length lines with flat rhyme schemes consisting otherwise of random dictionary words? I'm not familiar with Frink & finding the logic a little hard to follow.

@schas002
Copy link
Author

Does this produce even-length lines...

Correct.

...with flat rhyme schemes...

Unsure what a flat rhyme scheme is...

...consisting otherwise of random dictionary words?

Yup.

@enkiv2
Copy link

enkiv2 commented Apr 18, 2017 via email

@schas002
Copy link
Author

Ah k :) Then yes, it does.

@schas002
Copy link
Author

:D :D :D \o/ \o/ \o/

I finally got around to making a sample (see the next comment). It was made from a corpus of the 10 000 most used words from https://github.com/first20hours/google-10000-english (the no swear file, also excluding the first 30 items and every one-two letter items).

@schas002
Copy link
Author

Yet another stupid poem #1

For NaPoGenMo 2017

Authored by Andrew Zyabin

Last update: 2017-04-20


finding
passing
drama
panama

friendly
badly
cpu
cpu
workshops
develops

scenes
medicines
iowa
iowa
sphere
nowhere
poverty
party

hydrocodone
tone
education
identification
jail
jail
separation
dimension
wed
followed
russia
russia
horror
horror

december
chamber
pensions
calculations
leg
leg

handheld
springfield
corner
container
competitive
legislative
joining
mounting
cardiac
pontiac

scanning
examining
conservative
five
identify
identify
mem
mem

hon
python
checking
king
usr
usr
cake
snake
units
habits
serial
dial

resident
replacement
cialis
minneapolis
authorities
dictionaries
wages
mortgages
juice
notice

belt
felt
reflect
aspect
indians
hans

gains
wins

@schas002
Copy link
Author

Wait, I accidentally pinged the "Resources" issue. To whoever sees the ping from any of the two sides, I'm sorry. 😞

@MichaelPaulukonis
Copy link
Contributor

Instead of going off of word-endings from the spelling, you might want to try translation to Metaphone first, and then go off of the resultant word-endings.

@schas002
Copy link
Author

Hmm, I'd kind of like to see a YASP1 with a metaphoned dictionary. Just let me write up a translator...

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

4 participants