| P04-1029 | testing . The number of paths in | path indexing | is different for each mother-daughter |
| N03-3005 | maintaining the index : simple | path indexing | is constantly slower than quick-check |
| N03-3005 | Indexing with Quick Check The | path indexing | scheme presented above makes |
| P04-1029 | retrieving edges from the chart using | path indexing | is similar to the general method |
| P04-1029 | the index . 4.2 Path Indexing | Path indexing | is an extension of positional |
| P04-1029 | the benefit of the index . 4.2 | Path Indexing | Path indexing is an extension |
| P04-1029 | combination of quick-check and | path indexing | is faster than quick-check alone |
| N03-3005 | to 18 % for the combination of | path indexing | and quick - check , the difference |
| P04-1029 | parsing times of positional and | path indexing | over the same EFD - based parser |
| P04-1029 | each mother-daughter pair . So , | path indexing | uses a two-layer indexing method |
| C02-2024 | Yoshikawa et al. , 2001 ) . In | path indexing | , all existing paths in the database |
| P04-1029 | Index The indexing schemes used in | path indexing | are built on the same principles |
| P04-1029 | the grammar source . Note that | path indexing | outperforms quick-check on MERGE |
| N03-3005 | the grammar . Compared to the | path indexing | scheme ( Section 6.1 ) where |
| P04-1029 | alone surpasses positional and | path indexing | for the ERG . How - ever , it |
| P04-1029 | variable instances are important for | path indexing | ( Section 4.2 ) , because they |
| P04-1029 | quick-check alone on both grammars . | Path indexing | at best provided no decrease |
| N03-3005 | constantly slower than quick-check . | Path indexing | combined with quick-check outperforms |
| P04-1029 | must be traversed at run-time -- | path indexing | only uses paths available at |
| N03-3005 | non-indexed chart parsing . 6.2 | Path Indexing | with Quick Check The path indexing |
