| other,4-1-P90-1014,bq | The principle known as <term> free indexation </term> plays an important role in the determination of the <term> referential properties of noun phrases </term> in the <term> principle-and-parameters language framework </term> . | #17339 The principle known asfree indexation plays an important role in the determination of the referential properties of noun phrases in the principle-and-parameters language framework. |
| other,15-1-P90-1014,bq | The principle known as <term> free indexation </term> plays an important role in the determination of the <term> referential properties of noun phrases </term> in the <term> principle-and-parameters language framework </term> . | #17350 The principle known as free indexation plays an important role in the determination of thereferential properties of noun phrases in the principle-and-parameters language framework. |
| other,22-1-P90-1014,bq | The principle known as <term> free indexation </term> plays an important role in the determination of the <term> referential properties of noun phrases </term> in the <term> principle-and-parameters language framework </term> . | #17357 The principle known as free indexation plays an important role in the determination of the referential properties of noun phrases in theprinciple-and-parameters language framework. |
| other,7-2-P90-1014,bq | First , by investigating the combinatorics of <term> free indexation </term> , we show that the problem of enumerating all possible <term> indexings </term> requires <term> exponential time </term> . | #17368 First, by investigating the combinatorics offree indexation, we show that the problem of enumerating all possible indexings requires exponential time. |
| other,19-2-P90-1014,bq | First , by investigating the combinatorics of <term> free indexation </term> , we show that the problem of enumerating all possible <term> indexings </term> requires <term> exponential time </term> . | #17380 First, by investigating the combinatorics of free indexation, we show that the problem of enumerating all possibleindexings requires exponential time. |
| other,21-2-P90-1014,bq | First , by investigating the combinatorics of <term> free indexation </term> , we show that the problem of enumerating all possible <term> indexings </term> requires <term> exponential time </term> . | #17382 First, by investigating the combinatorics of free indexation, we show that the problem of enumerating all possible indexings requiresexponential time. |
| tech,7-3-P90-1014,bq | Secondly , we exhibit a provably optimal <term> free indexation algorithm </term> . | #17392 Secondly, we exhibit a provably optimalfree indexation algorithm. |
