Jason White wrote: ...........snip
Do you think that the search engine problem might be broken into two parts: 1/ A precise symbolic way of expressing a complex search pattern; say analogous to a 'regular expression' formula 2/ A 'short, simple sentence; natural language processing' algorithm; which then constructs sequences of such symbolic search formulas; equivalent to the disambiguated natural language sentence ?
How would you then associate this with search results? It wouldn't be feasible to parse and analyze all of the text of a large collection of Web pages, so far as I am aware.
I quite agree it is certainly not currently feasible to "parse and analyze all of the text of a large collection of Web pages" The aim would simply be to decrease the number and increase the relevance of search results; whilst ensuring the search was as exhaustive as possible. Jason many thanks for sharing your interests in language; regards Rohan McLeod