Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Carleton University

$19,000.00

Constraint-based syntax and semantics

EF 2009-10

Résumé
Computational natural language processing has typically been caught between two complementary forces: 1. the desire for broad coverage, which is useful for natural language technologies like internet search, and 2. the desire for deep understanding, which is useful for natural language technologies like text summarization, translation and dialogue systems. Automated natural language understanding ultimately relies on the development of computational semantics. The work supported by this grant focuses on computational semantics for Lexical-Functional Grammar (LFG), a constraint-based theory of natural language syntax. Constraint-based syntactic theories have formed the heart of the deep grammar engineering approach for nearly thirty years. The LFG grammatical architecture provides a number of unique opportunities for pursuing both theoretical and computational issues about natural language syntax and semantics and the relationship between them. First, the architecture supports hybrid approaches that have the potential to combine advantages of two distinct traditions in how semantic representations are built. Second, LFG's syntactic representations use a rich vocabulary that encodes syntactic cues that are directly relevant to certain important semantic-pragmatic categories, such as presupposition and implicature. The computational treatment of these sorts of pragmatic effects is of growing importance, since they are pervasive in natural language and any system that aims for deep textual understanding must be able to handle them. Third, the long-standing Parallel Grammar and newer Parallel Semantics projects (http://www2.parc.com/isl/groups/nltt/pargram/) not only provide a broader natural community for the research, they also bring to the fore questions of cross-linguistic semantics, which relate the proposed work to machine translation.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
371969-2009
Name nom
Asudeh, Arshia
Department département
Cognitive Science, Institute of
Organization id
23
Institution établissement
Carleton University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2009
Competition year année de concours
2009
Award amount
19000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2801
Research subject group en
Artificial intelligence
Research subject group fr
Intelligence artificielle
Research subject en
Natural language and speech understanding
Research subject fr
Langage naturel et reconnaissance de la parole
Partie
1
Nb partie
5
Application title
Constraint-based syntax and semantics
Keyword
NA
Application summary
Computational natural language processing has typically been caught between two complementary forces: 1. the desire for broad coverage, which is useful for natural language technologies like internet search, and 2. the desire for deep understanding, which is useful for natural language technologies like text summarization, translation and dialogue systems. Automated natural language understanding ultimately relies on the development of computational semantics. The work supported by this grant focuses on computational semantics for Lexical-Functional Grammar (LFG), a constraint-based theory of natural language syntax. Constraint-based syntactic theories have formed the heart of the deep grammar engineering approach for nearly thirty years. The LFG grammatical architecture provides a number of unique opportunities for pursuing both theoretical and computational issues about natural language syntax and semantics and the relationship between them. First, the architecture supports hybrid approaches that have the potential to combine advantages of two distinct traditions in how semantic representations are built. Second, LFG's syntactic representations use a rich vocabulary that encodes syntactic cues that are directly relevant to certain important semantic-pragmatic categories, such as presupposition and implicature. The computational treatment of these sorts of pragmatic effects is of growing importance, since they are pervasive in natural language and any system that aims for deep textual understanding must be able to handle them. Third, the long-standing Parallel Grammar and newer Parallel Semantics projects (http://www2.parc.com/isl/groups/nltt/pargram/) not only provide a broader natural community for the research, they also bring to the fore questions of cross-linguistic semantics, which relate the proposed work to machine translation.