Date(s) - 05/09/2012
2:00 pm - 3:00 pm
In the field of natural language parsing, the syntax of natural languages is modelled by means of formal grammars and automata. Sometimes these formalisms are borrowed from the field of formal language theory and are adapted to the task at hand, as in the case of context-free grammars and their lexicalized versions, where each individual rule is specialized for one or more lexical items. Sometimes these formalisms are newly developed, as in the case of dependency grammars and tree adjoining grammars. In this talk, I will briefly overview several of these models, discussing their mathematical properties and their use in parsing of natural language.
Giorgio Satta, Department of Information Engineering, University of Padua, Italy