Mostra el registre d'ítem simple
Incremental processing and acceptability
| dc.contributor.author | Morrill, Glyn |
| dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
| dc.date.accessioned | 2016-11-22T11:07:40Z |
| dc.date.available | 2016-11-22T11:07:40Z |
| dc.date.issued | 1998-09 |
| dc.identifier.citation | Morrill, G. "Incremental processing and acceptability". 1998. |
| dc.identifier.uri | http://hdl.handle.net/2117/96982 |
| dc.description.abstract | We present a left to right incremental algorithm for the processing of Lambek categorial grammar by proof net construction. A simple metric of complexity, the profile in time of the number of unresolved valencies, correctly predicts a wide variety of performance phenomena: garden pathing, left to right quantifier scope preference, centre embedding unacceptability, preference for lower attachment, and heavy noun phrase shift. |
| dc.format.extent | 25 p. |
| dc.language.iso | eng |
| dc.relation.ispartofseries | LSI-98-46-R |
| dc.subject.other | Left to right incremental algorithm |
| dc.subject.other | Lambek categorial grammar |
| dc.subject.other | Garden pathing |
| dc.subject.other | left to right quantifier scope preference |
| dc.subject.other | Centre embedding unacceptability |
| dc.subject.other | Preference for lower attachment |
| dc.subject.other | Heavy noun phrase shift |
| dc.title | Incremental processing and acceptability |
| dc.type | External research report |
| dc.contributor.group | Universitat Politècnica de Catalunya. LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge |
| dc.rights.access | Open Access |
| local.identifier.drac | 664099 |
| dc.description.version | Postprint (published version) |
| local.citation.author | Morrill, G. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [68]
-
Reports de recerca [1.107]