{"action":"created","issue":{"url":"https://api.github.com/repos/syntax-prosody-ot/main/issues/15","repository_url":"https://api.github.com/repos/syntax-prosody-ot/main","labels_url":"https://api.github.com/repos/syntax-prosody-ot/main/issues/15/labels{/name}","comments_url":"https://api.github.com/repos/syntax-prosody-ot/main/issues/15/comments","events_url":"https://api.github.com/repos/syntax-prosody-ot/main/issues/15/events","html_url":"https://github.com/syntax-prosody-ot/main/issues/15","id":268502762,"number":15,"title":"Detect maximality in the prosodic hierarchy","user":{"login":"jbellik","id":12523306,"avatar_url":"https://avatars2.githubusercontent.com/u/12523306?v=4","gravatar_id":"","url":"https://api.github.com/users/jbellik","html_url":"https://github.com/jbellik","followers_url":"https://api.github.com/users/jbellik/followers","following_url":"https://api.github.com/users/jbellik/following{/other_user}","gists_url":"https://api.github.com/users/jbellik/gists{/gist_id}","starred_url":"https://api.github.com/users/jbellik/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/jbellik/subscriptions","organizations_url":"https://api.github.com/users/jbellik/orgs","repos_url":"https://api.github.com/users/jbellik/repos","events_url":"https://api.github.com/users/jbellik/events{/privacy}","received_events_url":"https://api.github.com/users/jbellik/received_events","type":"User","site_admin":false},"labels":[{"id":213726455,"url":"https://api.github.com/repos/syntax-prosody-ot/main/labels/enhancement","name":"enhancement","color":"84b6eb","default":true}],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2017-10-25T18:33:15Z","updated_at":"2017-10-25T20:41:55Z","closed_at":null,"author_association":"CONTRIBUTOR","body":"Implement isMaximal: function to take a tree and a node, and return whether that node is dominated by any other node(s) of the same category."},"comment":{"url":"https://api.github.com/repos/syntax-prosody-ot/main/issues/comments/339464751","html_url":"https://github.com/syntax-prosody-ot/main/issues/15#issuecomment-339464751","issue_url":"https://api.github.com/repos/syntax-prosody-ot/main/issues/15","id":339464751,"user":{"login":"jbellik","id":12523306,"avatar_url":"https://avatars2.githubusercontent.com/u/12523306?v=4","gravatar_id":"","url":"https://api.github.com/users/jbellik","html_url":"https://github.com/jbellik","followers_url":"https://api.github.com/users/jbellik/followers","following_url":"https://api.github.com/users/jbellik/following{/other_user}","gists_url":"https://api.github.com/users/jbellik/gists{/gist_id}","starred_url":"https://api.github.com/users/jbellik/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/jbellik/subscriptions","organizations_url":"https://api.github.com/users/jbellik/orgs","repos_url":"https://api.github.com/users/jbellik/repos","events_url":"https://api.github.com/users/jbellik/events{/privacy}","received_events_url":"https://api.github.com/users/jbellik/received_events","type":"User","site_admin":false},"created_at":"2017-10-25T20:41:55Z","updated_at":"2017-10-25T20:41:55Z","author_association":"CONTRIBUTOR","body":"Implemented a function markMinMax that takes a tree and marks all nodes as minimal vs maximal (n.b. this is only properly defined for prosodic trees as currently implemented bc there is no way to skip over, e.g., bar nodes; recursion is only recognized when a parent and child have the same category). \r\n\r\nNext step is probably to run this function on all the Gen outputs (prosodic trees).\r\nAdditional step is to enhance it to handle recursion in syntax more gracefully."}}
{"actor":{"display_login":"jbellik"}}