| model,8-1-P97-1050,ak | We investigate the problem of determining a compact <term> underspecified semantical representation </term> for <term> sentences </term> that may be highly ambiguous . | #29612 We investigate the problem of determining a compactunderspecified semantical representation for sentences that may be highly ambiguous. | |
| other,12-1-P97-1050,ak | We investigate the problem of determining a compact <term> underspecified semantical representation </term> for <term> sentences </term> that may be highly ambiguous . | #29616 We investigate the problem of determining a compact underspecified semantical representation forsentences that may be highly ambiguous. | |
| other,2-2-P97-1050,ak | Due to <term> combinatorial explosion </term> , the naive method of building <term> semantics </term> for the different <term> syntactic readings </term> independently is prohibitive . | #29625 Due tocombinatorial explosion, the naive method of building semantics for the different syntactic readings independently is prohibitive. | |
| model,10-2-P97-1050,ak | Due to <term> combinatorial explosion </term> , the naive method of building <term> semantics </term> for the different <term> syntactic readings </term> independently is prohibitive . | #29633 Due to combinatorial explosion, the naive method of buildingsemantics for the different syntactic readings independently is prohibitive. | |
| other,14-2-P97-1050,ak | Due to <term> combinatorial explosion </term> , the naive method of building <term> semantics </term> for the different <term> syntactic readings </term> independently is prohibitive . | #29637 Due to combinatorial explosion, the naive method of building semantics for the differentsyntactic readings independently is prohibitive. | |
| other,7-3-P97-1050,ak | We present a method that takes as <term> input </term> a <term> syntactic parse forest </term> with associated <term> constraint-based semantic construction rules </term> and directly builds a <term> packed semantic structure </term> . | #29650 We present a method that takes asinput a syntactic parse forest with associated constraint-based semantic construction rules and directly builds a packed semantic structure. | |
| model,9-3-P97-1050,ak | We present a method that takes as <term> input </term> a <term> syntactic parse forest </term> with associated <term> constraint-based semantic construction rules </term> and directly builds a <term> packed semantic structure </term> . | #29652 We present a method that takes as input asyntactic parse forest with associated constraint-based semantic construction rules and directly builds a packed semantic structure. | |
| model,14-3-P97-1050,ak | We present a method that takes as <term> input </term> a <term> syntactic parse forest </term> with associated <term> constraint-based semantic construction rules </term> and directly builds a <term> packed semantic structure </term> . | #29657 We present a method that takes as input a syntactic parse forest with associatedconstraint-based semantic construction rules and directly builds a packed semantic structure. | |
| model,22-3-P97-1050,ak | We present a method that takes as <term> input </term> a <term> syntactic parse forest </term> with associated <term> constraint-based semantic construction rules </term> and directly builds a <term> packed semantic structure </term> . | #29665 We present a method that takes as input a syntactic parse forest with associated constraint-based semantic construction rules and directly builds apacked semantic structure. | |
| tech,1-4-P97-1050,ak | The <term> algorithm </term> is fully implemented and runs in O ( n4log ( n ) ) in <term> sentence length </term> , if the <term> grammar </term> meets some reasonable <term> ' normality ' restrictions </term> . | #29670 Thealgorithm is fully implemented and runs in O(n4log(n)) in sentence length, if the grammar meets some reasonable 'normality' restrictions. | |
| other,16-4-P97-1050,ak | The <term> algorithm </term> is fully implemented and runs in O ( n4log ( n ) ) in <term> sentence length </term> , if the <term> grammar </term> meets some reasonable <term> ' normality ' restrictions </term> . | #29685 The algorithm is fully implemented and runs in O(n4log(n)) insentence length, if the grammar meets some reasonable 'normality' restrictions. | |
| lr,21-4-P97-1050,ak | The <term> algorithm </term> is fully implemented and runs in O ( n4log ( n ) ) in <term> sentence length </term> , if the <term> grammar </term> meets some reasonable <term> ' normality ' restrictions </term> . | #29690 The algorithm is fully implemented and runs in O(n4log(n)) in sentence length, if thegrammar meets some reasonable 'normality' restrictions. | |
| model,25-4-P97-1050,ak | The <term> algorithm </term> is fully implemented and runs in O ( n4log ( n ) ) in <term> sentence length </term> , if the <term> grammar </term> meets some reasonable <term> ' normality ' restrictions </term> . | #29694 The algorithm is fully implemented and runs in O(n4log(n)) in sentence length, if the grammar meets some reasonable' normality ' restrictions. |
