<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.3" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>
<channel>
	<title>Comments on: The State of the Koine Parser as of October 2008</title>
	<link>http://www.julian.textcrit.com/?p=17</link>
	<description>An assortment of NT textual criticism comments and, frequently, how it relates to computers...</description>
	<pubDate>Wed, 08 Sep 2010 02:08:19 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3</generator>
		<item>
		<title>By: Stephen C. Carlson</title>
		<link>http://www.julian.textcrit.com/?p=17#comment-11364</link>
		<dc:creator>Stephen C. Carlson</dc:creator>
		<pubDate>Fri, 14 Nov 2008 15:58:32 +0000</pubDate>
		<guid>http://www.julian.textcrit.com/?p=17#comment-11364</guid>
		<description>Great to hear that you'll be at SBL in Boston.  Since we tend to inhabit the same sessions, I'm sure we'll get a chance to catch up.</description>
		<content:encoded><![CDATA[<p>Great to hear that you&#8217;ll be at SBL in Boston.  Since we tend to inhabit the same sessions, I&#8217;m sure we&#8217;ll get a chance to catch up.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mike</title>
		<link>http://www.julian.textcrit.com/?p=17#comment-11248</link>
		<dc:creator>Mike</dc:creator>
		<pubDate>Wed, 29 Oct 2008 04:52:56 +0000</pubDate>
		<guid>http://www.julian.textcrit.com/?p=17#comment-11248</guid>
		<description>The fact that LFG requires a lot of morpho-syntactic &#38; semantic information might be a burden. From what I've read about computational linguistics and LFG, the majority has use a probabilistic approach, though I am not a computational linguistic, so I can't say more. You could search through the presentation titles and abstracts at their conferenc website. A large number of papers are freely available there.

http://www.essex.ac.uk/linguistics/lfg/FAQ/conferences.html</description>
		<content:encoded><![CDATA[<p>The fact that LFG requires a lot of morpho-syntactic &amp; semantic information might be a burden. From what I&#8217;ve read about computational linguistics and LFG, the majority has use a probabilistic approach, though I am not a computational linguistic, so I can&#8217;t say more. You could search through the presentation titles and abstracts at their conferenc website. A large number of papers are freely available there.</p>
<p><a href="http://www.essex.ac.uk/linguistics/lfg/FAQ/conferences.html" rel="nofollow">http://www.essex.ac.uk/linguistics/lfg/FAQ/conferences.html</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: theswain</title>
		<link>http://www.julian.textcrit.com/?p=17#comment-11237</link>
		<dc:creator>theswain</dc:creator>
		<pubDate>Tue, 28 Oct 2008 04:17:49 +0000</pubDate>
		<guid>http://www.julian.textcrit.com/?p=17#comment-11237</guid>
		<description>Just a note to say its good to have you back blogging.  Not nearly enough blogs on text crit about.</description>
		<content:encoded><![CDATA[<p>Just a note to say its good to have you back blogging.  Not nearly enough blogs on text crit about.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Julian</title>
		<link>http://www.julian.textcrit.com/?p=17#comment-11216</link>
		<dc:creator>Julian</dc:creator>
		<pubDate>Sat, 25 Oct 2008 18:57:18 +0000</pubDate>
		<guid>http://www.julian.textcrit.com/?p=17#comment-11216</guid>
		<description>I remember reading a very long paper on LFG by Bresnan (?) and thinking that its notional scheme was very useful for Greek but that it didn't offer any significant advantage over a traditional tree structure. The main problem I have encountered is determining the local phrase head as I iterate over the sentence. Maybe you could recommend some reading on that topic. I am familiar with how LFG ensures grammatical matches through its nested feature structures but how does it solve ambiguity? Is there a probabilistic approach? And if so, how is this established without a corpus?

I also agree that Greek is not all that free, there are certainly many constructs that are formulaic. I relied heavily on Wallace's Biblical Greek Beyond the Basics for comprehensive overviews of constructs. If I had a corpus, I could have compiled a better overview.

Julian</description>
		<content:encoded><![CDATA[<p>I remember reading a very long paper on LFG by Bresnan (?) and thinking that its notional scheme was very useful for Greek but that it didn&#8217;t offer any significant advantage over a traditional tree structure. The main problem I have encountered is determining the local phrase head as I iterate over the sentence. Maybe you could recommend some reading on that topic. I am familiar with how LFG ensures grammatical matches through its nested feature structures but how does it solve ambiguity? Is there a probabilistic approach? And if so, how is this established without a corpus?</p>
<p>I also agree that Greek is not all that free, there are certainly many constructs that are formulaic. I relied heavily on Wallace&#8217;s Biblical Greek Beyond the Basics for comprehensive overviews of constructs. If I had a corpus, I could have compiled a better overview.</p>
<p>Julian</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mike</title>
		<link>http://www.julian.textcrit.com/?p=17#comment-11214</link>
		<dc:creator>Mike</dc:creator>
		<pubDate>Sat, 25 Oct 2008 17:15:44 +0000</pubDate>
		<guid>http://www.julian.textcrit.com/?p=17#comment-11214</guid>
		<description>I don't think you looked closely enough at LFG. Much of the frameworks foundational work is based on non-configurational languages - such as the Austronesian Walipiri. It is actually highly suited for free word order languages (a good amount of LFG work has been done on Modern Greek), though I would argue that Greek is not as free as some would think. I'm presently writing an LFG grammar for Koine morphology &#38; phrase structure using SIL software.</description>
		<content:encoded><![CDATA[<p>I don&#8217;t think you looked closely enough at LFG. Much of the frameworks foundational work is based on non-configurational languages - such as the Austronesian Walipiri. It is actually highly suited for free word order languages (a good amount of LFG work has been done on Modern Greek), though I would argue that Greek is not as free as some would think. I&#8217;m presently writing an LFG grammar for Koine morphology &amp; phrase structure using SIL software.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
