Parsing in the minimalist program: On SOV languages and relativization

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

I examine computational issues in the processing of SOV languages in the probe-goal theory of the Minimalist Program. A theory that minimizes search, such as the probe-goal theory, provides a strong linguistic basis for the investigation of efficient parsing architecture. For parsing, two main design challenges are presented: (i) how to limit search while incrementally recovering structure from input without the benefit of a pre-determined lexical array, and (ii) how to come up with a system that not only correctly resolves parsing ambiguities, but does so with mechanisms that are architecturally justified. I take as the starting point an existing probe-goal parser with features that allow it to compute syntactic representation without recourse to derivation history search. I extend this parser to handle pre-nominal relative clauses of the sort found in SOV languages. I provide a unified computational account of facts on possessor (and non-possessor) relativization and processing preferences in Turkish, Japanese, and Korean.

Original languageEnglish (US)
JournalCanadian Journal of Linguistics
Volume53
Issue number2-3
StatePublished - 2008

Fingerprint

language
recourse
linguistics
history
Minimalist Program
Relativization
SOV Languages
Parsing
Computational
Possessor
Syntax
History
Nominals
Relative Clauses

ASJC Scopus subject areas

  • Linguistics and Language
  • Language and Linguistics

Cite this

Parsing in the minimalist program : On SOV languages and relativization. / Fong, Sandiway.

In: Canadian Journal of Linguistics, Vol. 53, No. 2-3, 2008.

Research output: Contribution to journalArticle

@article{f9e972461f574b2d8283fb820373018f,
title = "Parsing in the minimalist program: On SOV languages and relativization",
abstract = "I examine computational issues in the processing of SOV languages in the probe-goal theory of the Minimalist Program. A theory that minimizes search, such as the probe-goal theory, provides a strong linguistic basis for the investigation of efficient parsing architecture. For parsing, two main design challenges are presented: (i) how to limit search while incrementally recovering structure from input without the benefit of a pre-determined lexical array, and (ii) how to come up with a system that not only correctly resolves parsing ambiguities, but does so with mechanisms that are architecturally justified. I take as the starting point an existing probe-goal parser with features that allow it to compute syntactic representation without recourse to derivation history search. I extend this parser to handle pre-nominal relative clauses of the sort found in SOV languages. I provide a unified computational account of facts on possessor (and non-possessor) relativization and processing preferences in Turkish, Japanese, and Korean.",
author = "Sandiway Fong",
year = "2008",
language = "English (US)",
volume = "53",
journal = "Canadian Journal of Linguistics",
issn = "0008-4131",
publisher = "University of Toronto Press",
number = "2-3",

}

TY - JOUR

T1 - Parsing in the minimalist program

T2 - On SOV languages and relativization

AU - Fong, Sandiway

PY - 2008

Y1 - 2008

N2 - I examine computational issues in the processing of SOV languages in the probe-goal theory of the Minimalist Program. A theory that minimizes search, such as the probe-goal theory, provides a strong linguistic basis for the investigation of efficient parsing architecture. For parsing, two main design challenges are presented: (i) how to limit search while incrementally recovering structure from input without the benefit of a pre-determined lexical array, and (ii) how to come up with a system that not only correctly resolves parsing ambiguities, but does so with mechanisms that are architecturally justified. I take as the starting point an existing probe-goal parser with features that allow it to compute syntactic representation without recourse to derivation history search. I extend this parser to handle pre-nominal relative clauses of the sort found in SOV languages. I provide a unified computational account of facts on possessor (and non-possessor) relativization and processing preferences in Turkish, Japanese, and Korean.

AB - I examine computational issues in the processing of SOV languages in the probe-goal theory of the Minimalist Program. A theory that minimizes search, such as the probe-goal theory, provides a strong linguistic basis for the investigation of efficient parsing architecture. For parsing, two main design challenges are presented: (i) how to limit search while incrementally recovering structure from input without the benefit of a pre-determined lexical array, and (ii) how to come up with a system that not only correctly resolves parsing ambiguities, but does so with mechanisms that are architecturally justified. I take as the starting point an existing probe-goal parser with features that allow it to compute syntactic representation without recourse to derivation history search. I extend this parser to handle pre-nominal relative clauses of the sort found in SOV languages. I provide a unified computational account of facts on possessor (and non-possessor) relativization and processing preferences in Turkish, Japanese, and Korean.

UR - http://www.scopus.com/inward/record.url?scp=62949098558&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=62949098558&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:62949098558

VL - 53

JO - Canadian Journal of Linguistics

JF - Canadian Journal of Linguistics

SN - 0008-4131

IS - 2-3

ER -