| measure(ment),4-3-P01-1009,ak | I show that the <term> performance </term> of a <term> search engine </term> can be improved dramatically by incorporating an approximation of the formal analysis that is compatible with the <term> search engine 's operational semantics </term> . | #1876 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. | |
| other,1-2-P01-1009,ak | These <term> words </term> appear frequently enough in <term> dialog </term> to warrant serious attention , yet present <term> natural language search engines </term> perform poorly on <term> queries </term> containing them . | #1848 Thesewords appear frequently enough in dialog to warrant serious attention, yet present natural language search engines perform poorly on queries containing them. | |
| other,11-1-P01-1009,ak | This paper presents a formal analysis for a large class of <term> words </term> called <term> alternative markers </term> , which includes other ( than ) , such ( as ) , and besides . | #1827 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,ak | This paper presents a formal analysis for a large class of <term> words </term> called <term> alternative markers </term> , which includes other ( than ) , such ( as ) , and besides . | #1829 This paper presents a formal analysis for a large class of words calledalternative markers, which includes other (than), such (as), and besides. | |
| other,21-2-P01-1009,ak | These <term> words </term> appear frequently enough in <term> dialog </term> to warrant serious attention , yet present <term> natural language search engines </term> perform poorly on <term> queries </term> containing them . | #1868 These words appear frequently enough in dialog to warrant serious attention, yet present natural language search engines perform poorly onqueries containing them. | |
| other,6-2-P01-1009,ak | These <term> words </term> appear frequently enough in <term> dialog </term> to warrant serious attention , yet present <term> natural language search engines </term> perform poorly on <term> queries </term> containing them . | #1853 These words appear frequently enough indialog to warrant serious attention, yet present natural language search engines perform poorly on queries containing them. | |
| tech,12-4-P01-1009,ak | The value of this approach is that as the <term> operational semantics </term> of <term> natural language applications </term> improve , even larger improvements are possible . | #1916 The value of this approach is that as the operational semantics ofnatural language applications improve, even larger improvements are possible. | |
| tech,14-2-P01-1009,ak | These <term> words </term> appear frequently enough in <term> dialog </term> to warrant serious attention , yet present <term> natural language search engines </term> perform poorly on <term> queries </term> containing them . | #1861 These words appear frequently enough in dialog to warrant serious attention, yet presentnatural language search engines perform poorly on queries containing them. | |
| tech,26-3-P01-1009,ak | I show that the <term> performance </term> of a <term> search engine </term> can be improved dramatically by incorporating an approximation of the formal analysis that is compatible with the <term> search engine 's operational semantics </term> . | #1898 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. | |
| tech,7-3-P01-1009,ak | I show that the <term> performance </term> of a <term> search engine </term> can be improved dramatically by incorporating an approximation of the formal analysis that is compatible with the <term> search engine 's operational semantics </term> . | #1879 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. | |
| tech,9-4-P01-1009,ak | The value of this approach is that as the <term> operational semantics </term> of <term> natural language applications </term> improve , even larger improvements are possible . | #1913 The value of this approach is that as theoperational semantics of natural language applications improve, even larger improvements are possible. |
