| tech,4-1-P90-1014,ak | implemented . The principle known as <term> | free indexation | </term> plays an important role in the determination | #21398 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,ak | important role in the determination of the <term> | referential properties | </term> of <term> noun phrases </term> in the | #21409 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,18-1-P90-1014,ak | <term> referential properties </term> of <term> | noun phrases | </term> in the <term> principle-and-parameters | #21412 The principle known as free indexation plays an important role in the determination of the referential properties ofnoun phrases in the principle-and-parameters language framework. | |
| other,22-1-P90-1014,ak | </term> of <term> noun phrases </term> in the <term> | principle-and-parameters language framework | </term> . First , by investigating the <term> | #21416 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,5-2-P90-1014,ak | </term> . First , by investigating the <term> | combinatorics | </term> of <term> free indexation </term> , we | #21425 First, by investigating thecombinatorics of free indexation, we show that the problem of enumerating all possible indexings requires exponential time. | |
| tech,7-2-P90-1014,ak | investigating the <term> combinatorics </term> of <term> | free indexation | </term> , we show that the problem of enumerating | #21427 First, by investigating the combinatorics offree indexation, we show that the problem of enumerating all possible indexings requires exponential time. | |
| model,19-2-P90-1014,ak | problem of enumerating all possible <term> | indexings | </term> requires <term> exponential time </term> | #21439 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,ak | possible <term> indexings </term> requires <term> | exponential time | </term> . Secondly , we exhibit a provably | #21441 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,ak | Secondly , we exhibit a provably optimal <term> | free indexation algorithm | </term> . A purely functional implementation | #21451 Secondly, we exhibit a provably optimalfree indexation algorithm. |
