| P02-1019 | estimated from a held-out set by a | linear search | . This model further improved |
| N06-2024 | evaluation criterion , using a | linear search | procedure . Applying this procedure |
| C69-5101 | searching . This variation of the | linear search | method is called the single chain |
| H05-1119 | lookup used at all , a complete | linear search | is performed on all lattices |
| H05-1119 | first column shows results for | linear search | only : no index lookup used at |
| P05-3017 | precedence and are executed using a | linear search | . NiteQL is the query language |
| A83-1020 | hashing algorithm rather than a | linear search | . This has been used to improve |
| C69-5101 | their search effieieneies . i. | Linear Search | This is also called sequential |
| J08-3002 | As a consequence , the simple | linear search | can find the final antecedent |
| H05-1119 | short-list . We call the second stage | linear search | because search time grows linearly |
| N06-1001 | mean . Q can be determined by | linear search | on development data .4 The use |
| J00-1006 | rather than Lextools 's original | linear search | . For Kiraz 's method , two source |
| C69-5101 | chain method . It differs from the | linear search | in storage flexibility but is |
| C69-5101 | variations and combinations of the | linear search | , " single chain , directory |
| H05-1119 | FOM loss . 6.4 Index Lookup and | Linear Search | Section 5 introduced a two-stage |
| N09-2003 | hypotheses makes a brute-force | linear search | intractable . Therefore , efficient |
| C69-5101 | variation of single chain , and the | linear search | , and it is aimed to improve |
| C88-2103 | be rejected or put off by the | linear search | of an input sentence . In this |
| J08-3002 | agreement , and employed a simple | linear search | scheme to choose the most preferred |
| D15-1292 | the complexity of the task ( a | linear search | has a running time of O ( Ni |
