Unification and efficient computation in the minimalist program

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

This talk explores issues in the construction of computationally simple grammars. In particular, we investigate the trade-off between simplicity of implementation and expressive power. We begin by developing what appears to be the simplest possible definite clause grammar implementation for a sub-theory in the minimalist program: that of probe-goal case agreement (Chomsky, Lectures in Government and Binding. Dordrecht: Foris; 2001). In computational modeling, there is a simple trade-off between simplicity of mechanism and expressive power, e.g., the Chomsky hierarchy. However, simplicity of implementation need not correlate with limited expressive power. Unification is a simple but powerful mechanism that can be used to implement uninterpretable/interpretable feature matching. We show, using examples from Chomsky (Lectures in Government and Binding. Dordrecht: Foris; 2001), as in (1)-(3), that unification-based derivations result in agree relations with fewer probe-goal steps than predicted. This economy of derivation results because once unified, unvalued features from different heads can be instantiated or valued simultaneously at a parse global level. Therefore, unification trades off fewer probe-goal steps for possibly unbounded agree relations.

Original languageEnglish (US)
Title of host publicationLanguage and Recursion
PublisherSpringer New York
Pages129-138
Number of pages10
ISBN (Print)9781461494140, 1461494133, 9781461494133
DOIs
StatePublished - Oct 1 2013

Fingerprint

Head

Keywords

  • Computational modeling
  • Declarative approach
  • Grammar
  • Keyword: Keywords: Unification
  • Minimalist program
  • Operational approach

ASJC Scopus subject areas

  • Psychology(all)

Cite this

Unification and efficient computation in the minimalist program. / Fong, Sandiway.

Language and Recursion. Springer New York, 2013. p. 129-138.

Research output: Chapter in Book/Report/Conference proceedingChapter

Fong, Sandiway. / Unification and efficient computation in the minimalist program. Language and Recursion. Springer New York, 2013. pp. 129-138
@inbook{ee2823075c794afcabd9ccbca102ef30,
title = "Unification and efficient computation in the minimalist program",
abstract = "This talk explores issues in the construction of computationally simple grammars. In particular, we investigate the trade-off between simplicity of implementation and expressive power. We begin by developing what appears to be the simplest possible definite clause grammar implementation for a sub-theory in the minimalist program: that of probe-goal case agreement (Chomsky, Lectures in Government and Binding. Dordrecht: Foris; 2001). In computational modeling, there is a simple trade-off between simplicity of mechanism and expressive power, e.g., the Chomsky hierarchy. However, simplicity of implementation need not correlate with limited expressive power. Unification is a simple but powerful mechanism that can be used to implement uninterpretable/interpretable feature matching. We show, using examples from Chomsky (Lectures in Government and Binding. Dordrecht: Foris; 2001), as in (1)-(3), that unification-based derivations result in agree relations with fewer probe-goal steps than predicted. This economy of derivation results because once unified, unvalued features from different heads can be instantiated or valued simultaneously at a parse global level. Therefore, unification trades off fewer probe-goal steps for possibly unbounded agree relations.",
keywords = "Computational modeling, Declarative approach, Grammar, Keyword: Keywords: Unification, Minimalist program, Operational approach",
author = "Sandiway Fong",
year = "2013",
month = "10",
day = "1",
doi = "10.1007/978-1-4614-9414-0_10",
language = "English (US)",
isbn = "9781461494140",
pages = "129--138",
booktitle = "Language and Recursion",
publisher = "Springer New York",

}

TY - CHAP

T1 - Unification and efficient computation in the minimalist program

AU - Fong, Sandiway

PY - 2013/10/1

Y1 - 2013/10/1

N2 - This talk explores issues in the construction of computationally simple grammars. In particular, we investigate the trade-off between simplicity of implementation and expressive power. We begin by developing what appears to be the simplest possible definite clause grammar implementation for a sub-theory in the minimalist program: that of probe-goal case agreement (Chomsky, Lectures in Government and Binding. Dordrecht: Foris; 2001). In computational modeling, there is a simple trade-off between simplicity of mechanism and expressive power, e.g., the Chomsky hierarchy. However, simplicity of implementation need not correlate with limited expressive power. Unification is a simple but powerful mechanism that can be used to implement uninterpretable/interpretable feature matching. We show, using examples from Chomsky (Lectures in Government and Binding. Dordrecht: Foris; 2001), as in (1)-(3), that unification-based derivations result in agree relations with fewer probe-goal steps than predicted. This economy of derivation results because once unified, unvalued features from different heads can be instantiated or valued simultaneously at a parse global level. Therefore, unification trades off fewer probe-goal steps for possibly unbounded agree relations.

AB - This talk explores issues in the construction of computationally simple grammars. In particular, we investigate the trade-off between simplicity of implementation and expressive power. We begin by developing what appears to be the simplest possible definite clause grammar implementation for a sub-theory in the minimalist program: that of probe-goal case agreement (Chomsky, Lectures in Government and Binding. Dordrecht: Foris; 2001). In computational modeling, there is a simple trade-off between simplicity of mechanism and expressive power, e.g., the Chomsky hierarchy. However, simplicity of implementation need not correlate with limited expressive power. Unification is a simple but powerful mechanism that can be used to implement uninterpretable/interpretable feature matching. We show, using examples from Chomsky (Lectures in Government and Binding. Dordrecht: Foris; 2001), as in (1)-(3), that unification-based derivations result in agree relations with fewer probe-goal steps than predicted. This economy of derivation results because once unified, unvalued features from different heads can be instantiated or valued simultaneously at a parse global level. Therefore, unification trades off fewer probe-goal steps for possibly unbounded agree relations.

KW - Computational modeling

KW - Declarative approach

KW - Grammar

KW - Keyword: Keywords: Unification

KW - Minimalist program

KW - Operational approach

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

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

U2 - 10.1007/978-1-4614-9414-0_10

DO - 10.1007/978-1-4614-9414-0_10

M3 - Chapter

AN - SCOPUS:84929876680

SN - 9781461494140

SN - 1461494133

SN - 9781461494133

SP - 129

EP - 138

BT - Language and Recursion

PB - Springer New York

ER -