[00:47:22] *** Joins: Gurkenglas_ (Gurkenglas@dslb-178-000-178-156.178.000.pools.vodafone-ip.de) [01:12:51] *** Quits: koo8 (~kook@210.14.broadband15.iol.cz) (Ping timeout: 276 seconds) [02:32:37] *** Quits: Gurkenglas_ (Gurkenglas@dslb-178-000-178-156.178.000.pools.vodafone-ip.de) (Ping timeout: 260 seconds) [02:52:28] *** Quits: drbean (~drbean@124.219.83.41) (Ping timeout: 252 seconds) [03:13:23] *** Joins: drbean (~drbean@124.219.83.41) [05:34:09] Many kinds of Lists, with Conjunctions, but none for VP. [05:38:59] drbean: They're in Extra. [05:46:09] The I in [VPI] means infinite, I guess, because there's no temporality and polarity, and they're made into a VP with a VV. [05:46:11] But I wonder what the S in [VPS] means, with temporality and polarity. [05:49:17] *** Quits: annaaerinteenbot (~annaaerin@cse-principia.cse.chalmers.se) (Ping timeout: 276 seconds) [05:59:49] *** Joins: koo8 (~kook@210.14.broadband15.iol.cz) [06:29:56] *** Quits: spectre (~fran@188.123.231.41) (Ping timeout: 250 seconds) [07:18:27] *** Quits: ppnkk (~pepijn@ksit.fixme.fi) (Ping timeout: 260 seconds) [07:18:27] *** Quits: inariksit (~inari@ksit.fixme.fi) (Ping timeout: 260 seconds) [07:18:36] *** Joins: inariksit (~inari@ksit.fixme.fi) [07:18:58] *** Joins: ppnkk (~pepijn@ksit.fixme.fi) [08:49:20] *** Joins: Gurkenglas_ (Gurkenglas@dslb-178-000-178-156.178.000.pools.vodafone-ip.de) [09:39:33] *** Quits: Gurkenglas_ (Gurkenglas@dslb-178-000-178-156.178.000.pools.vodafone-ip.de) (Ping timeout: 240 seconds) [11:08:42] *** Joins: annaaerinteenbot (~annaaerin@cse-principia.cse.chalmers.se) [11:37:04] *** Joins: spectei (~fran@188.123.231.41) [11:37:04] *** Quits: spectei (~fran@188.123.231.41) (Changing host) [11:37:04] *** Joins: spectei (~fran@unaffiliated/spectie) [12:09:53] *** Quits: koo8 (~kook@210.14.broadband15.iol.cz) (Ping timeout: 268 seconds) [14:04:18] *** Joins: beneri (~beneri@dhcp-185016.eduroam.chalmers.se) [14:12:38] Hello! Is it possible to use the python-plugin to generate parse trees instead of abstract trees? The unpack() function is great for traversing abstract trees but they seem very complicated to work with. [14:14:57] *** Quits: annaaerinteenbot (~annaaerin@cse-principia.cse.chalmers.se) (Ping timeout: 246 seconds) [14:25:43] *** Joins: Gurkenglas_ (Gurkenglas@dslb-178-000-178-156.178.000.pools.vodafone-ip.de) [14:42:29] beneri: i think you can try to linearize to bracketed strings that are some kind of parse trees. or you can write your own translation, that is usually what people have been doing [14:51:22] Thank you! We'll try that. What we actually are trying to do is answer the "Who does what" question. So for example "He eats candy". Our approach is to search for known "whats" like candy and then backtrack until we find the who. The problem is that the swedish word for candy, "godis", is parsed as something like candy_n_1_NN, which makes it hard to search for. Do you know if there are any better ways of searching for subtrees? [15:00:19] *** Joins: chru (~chru@ip-129-70-147-33.WLAN.Dyn.CIT-EC.NET) [15:01:06] *** Joins: koo8 (~kook@210.14.broadband15.iol.cz) [15:17:05] *** Quits: beneri (~beneri@dhcp-185016.eduroam.chalmers.se) (Remote host closed the connection) [17:16:03] *** Quits: chru (~chru@ip-129-70-147-33.WLAN.Dyn.CIT-EC.NET) (Quit: Leaving...) [17:48:55] *** Quits: koo8 (~kook@210.14.broadband15.iol.cz) (Ping timeout: 250 seconds) [18:45:08] *** Joins: koo8 (~kook@210.14.broadband15.iol.cz) [20:13:50] *** Quits: Gurkenglas_ (Gurkenglas@dslb-178-000-178-156.178.000.pools.vodafone-ip.de) (Ping timeout: 244 seconds) [21:56:22] *** Quits: spectei (~fran@unaffiliated/spectie) (Ping timeout: 260 seconds) [22:13:44] *** Joins: annaaerinteenbot (~annaaerin@cse-principia.cse.chalmers.se)