20.125, Diss: Comp Ling: Gobbo: 'Adpositional Grammars'

[LINGUIST Network]

LINGUIST List: Vol-20-125. Wed Jan 14 2009. ISSN: 1068 - 4875.

Subject: 20.125, Diss: Comp Ling: Gobbo: 'Adpositional Grammars'

Moderators: Anthony Aristar, Eastern Michigan U <aristar at linguistlist.org>
            Helen Aristar-Dry, Eastern Michigan U <hdry at linguistlist.org>
 
Reviews: Randall Eggert, U of Utah  
       <reviews at linguistlist.org> 

Homepage: http://linguistlist.org/

The LINGUIST List is funded by Eastern Michigan University, 
and donations from subscribers and publishers.

Editor for this issue: Evelyn Richter <evelyn at linguistlist.org>
================================================================  

To post to LINGUIST, use our convenient web form at
http://linguistlist.org/LL/posttolinguist.html.

===========================Directory==============================  

1)
Date: 14-Jan-2009
From: Federico Gobbo < federico.gobbo at uninsubria.it >
Subject: Adpositional Grammars

 

	
-------------------------Message 1 ---------------------------------- 
Date: Wed, 14 Jan 2009 11:23:41
From: Federico Gobbo [federico.gobbo at uninsubria.it]
Subject: Adpositional Grammars

E-mail this message to a friend:
http://linguistlist.org/issues/emailmessage/verification.cfm?iss=20-125.html&submissionid=202007&topicid=14&msgnumber=1
  

Institution: Università degli Studi dell'Insubria 
Program: Computer Science 
Dissertation Status: Completed 
Degree Date: 2009 

Author: Federico Gobbo

Dissertation Title: Adpositional Grammars 

Dissertation URL:  http://federicogobbo.wordpress.com/phd/

Linguistic Field(s): Cognitive Science
                     Computational Linguistics
                     Linguistic Theories


Dissertation Director(s):
Marco Benini
Fabrizio Angelo Pennacchietti
Gaetano Aurelio Lanzarone

Dissertation Abstract:

In the field of computational linguistics, the representation of natural 
languages (NL) in formal grammar terms is a well-known issue and a wicked 
problem indeed. In fact, some formal grammars lack lexical and semantic
information representation, reducing the linguistic structure to syntax. 
On the other side, approaches like dependency grammars lose expressive 
power, under a computational point of view. Adpositional grammars (adgrams)
are a novel grammar formalism that overcomes these limitations.







-----------------------------------------------------------
LINGUIST List: Vol-20-125