Free indexation: Combinatorial analysis and a compositional algorithm

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations

Abstract

The principle known as 'free indexation' plays an important role in the determination of the referential properties of noun phrases in the principle- and-parameters language framework. First, by investigating the combinatorics of free indexation, we show that the problem of enumerating all possible indexings requires exponential time. Secondly, we exhibit a provably optimal free indexation algorithm.

Original languageEnglish (US)
Pages (from-to)105-110
Number of pages6
JournalProceedings of the Annual Meeting of the Association for Computational Linguistics
Volume1990-June
StatePublished - 1990
Externally publishedYes
Event28th Annual Meeting of the Association for Computational Linguistics, ACL 1990 - Pittsburgh, United States
Duration: Jun 6 1990Jun 9 1990

ASJC Scopus subject areas

  • Computer Science Applications
  • Linguistics and Language
  • Language and Linguistics

Fingerprint

Dive into the research topics of 'Free indexation: Combinatorial analysis and a compositional algorithm'. Together they form a unique fingerprint.

Cite this