Nanosyntax

Nanosyntax

Nanosyntax is an approach to syntax in which syntactic parse trees are built up out of a large number of syntactic constituents. Each morpheme may correspond to several such elements, which do not have to form a "subtree".

Some recent work in theoretical linguistics suggests that the "atoms" of syntax are much smaller than words or morphemes. From that it immediately follows that the responsibility of syntax is not limited to ordering "preconstructed" words. Instead, within the framework of nanosyntax,[1] the words are derived entities built in syntax, rather than primitive elements supplied by a lexicon.

The beginnings of nanosyntax can be traced to a 1993 article by Kenneth Hale and S. Jay Keyser titled 'On Argument Structure and the Lexical Representation of Syntactic Relations'[2], which first introduced the concept of l-syntax.

References

  1. ^ Starke, Michal. 2011. Towards an elegant solution to language variation: Variation reduces to the size of lexically stored trees. MS. Barcelona, Spain
  2. ^ Hale, Kenneth and S. Jay Keyser. 1993. On Argument Structure and the Lexical Representation of Syntactic Relations. In The View from Building 20, edited by Kenneth Hale and S. Jay Keyser, pp. 53-109. Cambridge, MA: The MIT Press. ISBN 978-0262581240

External links


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Morpheme — Examples Unbreakable comprises three morphemes: un (a bound morpheme signifying not ), break (the root, a free morpheme), and able (a bound morpheme signifying doable ). Allomorphs of the plural morpheme for regular nouns: /s/ (e.g. in cats… …   Wikipedia

  • Syntax — Syntactic redirects here. For another meaning of the adjective, see Syntaxis. For other uses, see Syntax (disambiguation). Linguistics …   Wikipedia

  • Parse tree — For the trees used in computer science, see Abstract syntax tree. A concrete syntax tree or parse tree or parsing tree[1] is an ordered, rooted tree that represents the syntactic structure of a string according to some formal grammar. In a parse… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”