Relational-Realizational Syntax: An Architecture for Describing and Parsing Rich Morphosyntactic Descriptions

Add to your list(s) Download to your calendar using vCal

• Reut Tsarfaty - Uppsala University
• Friday 11 March 2011, 12:00-13:00
• FW26, Computer Laboratory.

If you have a question about this talk, please contact Thomas Lippincott.

Precision grammars and treebank grammars present two alternatives for obtaining an accurate, consistent and maximally complete syntactic analysis of natural language sentences. For a long time these two research endeavors have been conducted in separate communities and optimized for disparate goals—the former for rich and accurate descriptions of linguistic structures, and the latter for efficient and accurate statistical parsing,. Recently, these disparate research efforts started to acknowledge their usefulness for one another by borrowing terms, theoretical constructs and techniques from one research endeavor to the other. In this talk I take a step back to consider the morpho-syntactic analysis task from first principles and develop a novel architecture which remains faithful to both kinds of goals.

In this talk I present a novel architecture for specifying rich morphosyntactic representations and learning the associated grammars from annotated data. The key idea underlying the architecture is the application of the traditional notion of a “paradigm” to the syntactic domain. N-place predicates associated with paradigm cells are viewed as relational networks that are realized recursively by combining and ordering cells from other paradigms. The function of paradigm cells is mapped to forms in a recursive fashion, be means of realization rules that make reference both to the morphological and to the syntactic domains. This architecture, called Relational-Realizational, has a simple instantiation as a generative probabilistic model of which parameters can be statistically learned from treebank data, and which can be used for efficient parsing.

An application of the model to Hebrew and Swedish allows for accurate description of word-order and argument marking patterns of the different language types. The associated treebank grammar can be used for statistical parsing and is shown to improve state-of-the-art parsing results for the Semitic language Modern Hebrew. The availability of a simple, formal, robust, implementable and statistically interpretable working model opens new horizons in computational linguistics — at least in principle, we should now be able to quantify typological trends which have so far been stated informally or only tacitly reflected in corpus statistics.

This talk is part of the NLIP Seminar Series series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge Forum of Science and Humanities
• Cambridge Language Sciences
• Cambridge talks
• Chris Davis' list
• Computer Education Research
• Computing Education Research
• Department of Computer Science and Technology talks and seminars
• FW26, Computer Laboratory
• Graduate-Seminars
• Guy Emerson's list
• Interested Talks
• Language Sciences for Graduate Students
• NLIP Seminar Series
• PMRFPS's
• Simon Baker's List
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.