| tech,9-5-P80-1026,bq | We go , on to describe <term> FlexP </term> , a <term> bottom-up pattern-matching parser </term> that we have designed and implemented to provide these flexibilities for <term> restricted natural language </term> input to a limited-domain computer system . | #12765 We go, on to describe FlexP, abottom-up pattern-matching parser that we have designed and implemented to provide these flexibilities for restricted natural language input to a limited-domain computer system. |
| tech,2-3-P80-1026,bq | If a <term> computer system </term> wishes to accept <term> natural language input </term> from its <term> users </term> on a routine basis , it must display a similar indifference . | #12715 If acomputer system wishes to accept natural language input from its users on a routine basis, it must display a similar indifference. |
| other,7-3-P80-1026,bq | If a <term> computer system </term> wishes to accept <term> natural language input </term> from its <term> users </term> on a routine basis , it must display a similar indifference . | #12720 If a computer system wishes to acceptnatural language input from its users on a routine basis, it must display a similar indifference. |
| tool,6-5-P80-1026,bq | We go , on to describe <term> FlexP </term> , a <term> bottom-up pattern-matching parser </term> that we have designed and implemented to provide these flexibilities for <term> restricted natural language </term> input to a limited-domain computer system . | #12762 We go, on to describeFlexP, a bottom-up pattern-matching parser that we have designed and implemented to provide these flexibilities for restricted natural language input to a limited-domain computer system. |
| other,23-5-P80-1026,bq | We go , on to describe <term> FlexP </term> , a <term> bottom-up pattern-matching parser </term> that we have designed and implemented to provide these flexibilities for <term> restricted natural language </term> input to a limited-domain computer system . | #12779 We go, on to describe FlexP, a bottom-up pattern-matching parser that we have designed and implemented to provide these flexibilities forrestricted natural language input to a limited-domain computer system. |
| other,12-3-P80-1026,bq | If a <term> computer system </term> wishes to accept <term> natural language input </term> from its <term> users </term> on a routine basis , it must display a similar indifference . | #12725 If a computer system wishes to accept natural language input from itsusers on a routine basis, it must display a similar indifference. |
| other,9-4-P80-1026,bq | In this paper , we outline a set of <term> parsing flexibilities </term> that such a system should provide . | #12747 In this paper, we outline a set ofparsing flexibilities that such a system should provide. |
| other,1-2-P80-1026,bq | Their <term> human listeners </term> are usually able to cope with these deviations with little difficulty . | #12699 Theirhuman listeners are usually able to cope with these deviations with little difficulty. |
| other,3-1-P80-1026,bq | When people use <term> natural language </term> in natural settings , they often use it ungrammatically , missing out or repeating words , breaking-off and restarting , speaking in fragments , etc . . | #12669 When people usenatural language in natural settings, they often use it ungrammatically, missing out or repeating words, breaking-off and restarting, speaking in fragments, etc.. |
