| W10-1834 | , has_ancestor / 2 , performs | database lookup | . We therefore call it last in |
| D08-1100 | reserve a round trip ticket , two | database lookup | actions , one for each leg , |
| H01-1015 | the goal of avoiding a costly | database lookup | , where the retrieval is conditioned |
| W06-2702 | serves as an identifier for further | database lookups | . Similarly , if the expansion |
| N04-1007 | is shown in Table 3 . Overall , | database lookup | retrieved approximately eight |
| D08-1028 | comprehend the email , the time for | database lookup | and the time for response composition |
| N04-1007 | success of a system . Similarly , | database lookup | works only if the relevant target |
| N10-1008 | component for re - view-summary | database lookup | . A response is then generated |
| N07-1034 | computes the cost of doing the | database lookup | . 7 Evaluation To show the usefulness |
| P99-1025 | action ( e.g. play a prompt or do a | database lookup | ) . The algorithm repeats itself |
| N04-1007 | results from all three sources : | database lookup | , dictionary lookup , and document |
| D08-1100 | reservation form is a result of a | database lookup | action that corresponds to each |
| M98-1014 | out text zoning , tokenisation , | database lookup | and named entity rule application |
| D12-1008 | restaurant . The system then performs a | database lookup | and chooses among three main |
| E87-1011 | words was derived by performing a | database lookup | using those grammar codes and |
| H01-1015 | know what is happening with the | database lookup | , whether there are problems |
| P99-1025 | the information needed to do a | database lookup | is found in the user 's utterance |
| J90-3001 | definite quantifier by simple | database lookup | or inference from a knowledge |
| J97-4001 | text-to-speech system since a | database lookup | ( dictionary search ) is not |
| M95-1008 | the form or from the context ; | database lookup | happens here as well . Thus , |
