| model,1-3-H89-1036,ak | constraints </term> can be stated . These <term> | constraints | </term> either hold within the <term> elementary | #19565 Theseconstraints either hold within the elementary structure itself or specify what other structures can be composed with a given elementary structure. | |
| other,11-10-H89-1036,ak | <term> parser </term> selects a set of <term> | elementary structures | </term> associated with the <term> lexical | #19693 In the first stage, the parser selects a set ofelementary structures associated with the lexical items in the input sentence, and in the second stage the sentence is parsed with respect to this set. | |
| other,20-3-H89-1036,ak | structures can be composed with a given <term> | elementary structure | </term> . The <term> ' grammar ' </term> consists | #19584 These constraints either hold within the elementary structure itself or specify what other structures can be composed with a givenelementary structure. | |
| model,4-5-H89-1036,ak | head </term> . There are no separate <term> | grammar rules | </term> . There are , of course , <term> ' | #19619 There are no separategrammar rules. | |
| lr,1-7-H89-1036,ak | these structures are composed . A <term> | grammar | </term> of this form will be said to be ' | #19641 Agrammar of this form will be said to be 'lexicalized'. | |
| other,4-18-H89-1036,ak | TAGs </term> . We assign them regular <term> | syntactic structures | </term> while representing them semantically | #19816 We assign them regularsyntactic structures while representing them semantically as one entry. | |
| tech,9-12-H89-1036,ak | be adapted to take advantage of the <term> | two steps parsing strategy | </term> . The <term> system </term> parses <term> | #19740 It can be adapted to take advantage of thetwo steps parsing strategy. | |
| other,6-3-H89-1036,ak | constraints </term> either hold within the <term> | elementary structure | </term> itself or specify what other structures | #19570 These constraints either hold within theelementary structure itself or specify what other structures can be composed with a given elementary structure. | |
| other,10-4-H89-1036,ak | of a <term> lexicon </term> where each <term> | lexical item | </term> is associated with a finite number | #19597 The 'grammar' consists of a lexicon where eachlexical item is associated with a finite number of structures for which that item is the head. | |
| tech,10-19-H89-1036,ak | finally show how they can be parsed by a <term> | parsing strategy | </term> as mentioned above . This paper proposes | #19836 We finally show how they can be parsed by aparsing strategy as mentioned above. | |
| other,8-13-H89-1036,ak | unification formalisms </term> that have a <term> | CFG skeleton | </term> and that have a <term> TAG skeleton | #19753 The system parses unification formalisms that have aCFG skeleton and that have a TAG skeleton. | |
| lr,3-16-H89-1036,ak | being developed . Subsets of these <term> | lexicons | </term> are being incrementally interfaced | #19792 Subsets of theselexicons are being incrementally interfaced to the parser. | |
| model,6-6-H89-1036,ak | rules </term> . There are , of course , <term> | ' rules ' | </term> which tell us how these structures | #19628 There are, of course,' rules ' which tell us how these structures are composed. | |
| other,3-15-H89-1036,ak | development . A <term> lexicons </term> for <term> | French | </term> is also being developed . Subsets | #19783 A lexicons forFrench is also being developed. | |
| other,12-2-H89-1036,ak | locality </term> ( as compared to a <term> | context-free grammar | </term> ) over which <term> constraints </term> | #19554 These structures specify extended domains of locality (as compared to acontext-free grammar) over which constraints can be stated. | |
| other,9-8-H89-1036,ak | grammar </term> naturally follows from the <term> | extended domain of locality | </term> of <term> TAGs </term> . A general <term> | #19663 A 'lexicalized' grammar naturally follows from theextended domain of locality of TAGs. | |
| other,3-13-H89-1036,ak | </term> . The <term> system </term> parses <term> | unification formalisms | </term> that have a <term> CFG skeleton </term> | #19748 The system parsesunification formalisms that have a CFG skeleton and that have a TAG skeleton. | |
| other,12-18-H89-1036,ak | representing them semantically as one <term> | entry | </term> . We finally show how they can be | #19824 We assign them regular syntactic structures while representing them semantically as oneentry. | |
| lr,7-4-H89-1036,ak | <term> ' grammar ' </term> consists of a <term> | lexicon | </term> where each <term> lexical item </term> | #19594 The 'grammar' consists of alexicon where each lexical item is associated with a finite number of structures for which that item is the head. | |
| other,16-10-H89-1036,ak | structures </term> associated with the <term> | lexical items | </term> in the <term> input sentence </term> | #19698 In the first stage, the parser selects a set of elementary structures associated with thelexical items in the input sentence, and in the second stage the sentence is parsed with respect to this set. |
