100 likes | 221 Vues
This document outlines the top-down and bottom-up processing methodologies applied in harmonic grammar parsers developed at the University of Amsterdam. It discusses simple and comprehensible network structures, weight matrices associated with specific grammatical transitions, and their implications for language processing. The paper investigates constraints applied in generative grammar, and highlights the technical challenges necessary for scaling these approaches, ultimately contributing to the understanding of language processing.
E N D
Top-down X Y X Y X Y Bottom-up A B B A A B B A A B B A Harmonic Grammar Parser • Simple, comprehensible network • Simple grammar G • X → A B Y → B A • Language Processing: Completion University of Amsterdam
W Simple Network Parser • Fully self-connected, symmetric network • Like previously shown network … … Except with 12 units; representations and connections shown below University of Amsterdam
Harmonic Grammar Parser • Representations: University of Amsterdam
Harmonic Grammar Parser H(Y, B—) > 0H(Y, —A) > 0 • Weight matrix for Y → B A University of Amsterdam
Harmonic Grammar Parser • Weight matrix for X → A B University of Amsterdam
Harmonic Grammar Parser • Weight matrix for entire grammar G University of Amsterdam
X Y A B B A Bottom-up Processing University of Amsterdam
A B B A Top-down Processing X Y University of Amsterdam
Generality Method applies to constraints of the form *λ/Cλ and C each one constituent • J. J. McCarthy (last night) University of Amsterdam
Scaling up • Not yet … • Still technical obstacles to surmount University of Amsterdam