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