| other,4-1-P01-1009,bq | paraphrases </term> . This paper presents a <term> | formal analysis | </term> for a large class of <term> words </term> | #1819 This paper presents aformal analysis for a large class of words called alternative markers, which includes other (than), such (as), and besides. |
| other,11-1-P01-1009,bq | analysis </term> for a large class of <term> | words | </term> called <term> alternative markers </term> | #1826 This paper presents a formal analysis for a large class ofwords called alternative markers, which includes other (than), such (as), and besides. |
| other,13-1-P01-1009,bq | large class of <term> words </term> called <term> | alternative markers | </term> , which includes <term> other ( than | #1828 This paper presents a formal analysis for a large class of words calledalternative markers, which includes other (than), such (as), and besides. |
| other,18-1-P01-1009,bq | alternative markers </term> , which includes <term> | other ( than ) | </term> , <term> such ( as ) </term> , and <term> | #1833 This paper presents a formal analysis for a large class of words called alternative markers, which includesother ( than ), such (as), and besides. |
| other,23-1-P01-1009,bq | includes <term> other ( than ) </term> , <term> | such ( as ) | </term> , and <term> besides </term> . These <term> | #1838 This paper presents a formal analysis for a large class of words called alternative markers, which includes other (than),such ( as ), and besides. |
| other,29-1-P01-1009,bq | </term> , <term> such ( as ) </term> , and <term> | besides | </term> . These <term> words </term> appear frequently | #1844 This paper presents a formal analysis for a large class of words called alternative markers, which includes other (than), such (as), andbesides. |
| other,1-2-P01-1009,bq | </term> , and <term> besides </term> . These <term> | words | </term> appear frequently enough in <term> | #1847 Thesewords appear frequently enough in dialog to warrant serious attention, yet present natural language search engines perform poorly on queries containing them. |
| other,6-2-P01-1009,bq | </term> appear frequently enough in <term> | dialog | </term> to warrant serious <term> attention | #1852 These words appear frequently enough indialog to warrant serious attention, yet present natural language search engines perform poorly on queries containing them. |
| other,10-2-P01-1009,bq | <term> dialog </term> to warrant serious <term> | attention | </term> , yet present <term> natural language | #1856 These words appear frequently enough in dialog to warrant seriousattention, yet present natural language search engines perform poorly on queries containing them. |
| tech,14-2-P01-1009,bq | <term> attention </term> , yet present <term> | natural language search engines | </term> perform poorly on <term> queries </term> | #1860 These words appear frequently enough in dialog to warrant serious attention, yet presentnatural language search engines perform poorly on queries containing them. |
| other,21-2-P01-1009,bq | search engines </term> perform poorly on <term> | queries | </term> containing them . I show that the | #1867 These words appear frequently enough in dialog to warrant serious attention, yet present natural language search engines perform poorly onqueries containing them. |
| measure(ment),4-3-P01-1009,bq | </term> containing them . I show that the <term> | performance | </term> of a <term> search engine </term> can | #1875 I show that theperformance of a search engine can be improved dramatically by incorporating an approximation of the formal analysis that is compatible with the search engine's operational semantics. |
| tech,7-3-P01-1009,bq | that the <term> performance </term> of a <term> | search engine | </term> can be improved dramatically by incorporating | #1878 I show that the performance of asearch engine can be improved dramatically by incorporating an approximation of the formal analysis that is compatible with the search engine's operational semantics. |
| other,19-3-P01-1009,bq | incorporating an approximation of the <term> | formal analysis | </term> that is compatible with the <term> | #1890 I show that the performance of a search engine can be improved dramatically by incorporating an approximation of theformal analysis that is compatible with the search engine's operational semantics. |
| tech,26-3-P01-1009,bq | </term> that is compatible with the <term> | search engine | </term> 's <term> operational semantics </term> | #1897 I show that the performance of a search engine can be improved dramatically by incorporating an approximation of the formal analysis that is compatible with thesearch engine's operational semantics. |
| other,29-3-P01-1009,bq | with the <term> search engine </term> 's <term> | operational semantics | </term> . The value of this approach is that | #1900 I show that the performance of a search engine can be improved dramatically by incorporating an approximation of the formal analysis that is compatible with the search engine'soperational semantics. |
| other,9-4-P01-1009,bq | value of this approach is that as the <term> | operational semantics | </term> of <term> natural language applications | #1912 The value of this approach is that as theoperational semantics of natural language applications improve, even larger improvements are possible. |
| tech,12-4-P01-1009,bq | <term> operational semantics </term> of <term> | natural language applications | </term> improve , even larger improvements | #1915 The value of this approach is that as the operational semantics ofnatural language applications improve, even larger improvements are possible. |
