Third-generation search engine lexxe

I recently saw lexxe introduction on the Internet.
Australian Chinese, computational linguistics doctor Qiao hongliang recently invented the Third Generation search engine lexxe, which features "language computing ".
The advantage of linguisticcom-puting is the ability to use artificial intelligence to identify different types of statements, perform syntax analysis, and determine user intentions, so as to provide direct and effective answers.
Enter www.lexxe.com in the address bar and leave only one paragraph. As the number of visitors increases, the server is only available on a regular basis every day. Search in Google, find the link in lexxe, and access it. The address is http://www.lexxe.com/main.cfm? Sstring = where + is + Nanjing + road % 3f & clickcluster = fmclk
& Sstringtemp = fmstr
I want to explore how lexxe works. I found a sentence on it, which is translated as follows:
For short sentences which countries does Thailand share border?
1 lexxe converts sentence patterns to Thailand shares border with which countries
2. Determine which words are removed from the statement. Which countries is the question part, including a question word and a noun. Therefore, remove the two words.
3. lexxe needs to determine where and how far the possible answer will appear. sometimes the answer appears on one side of the sentence pattern, and sometimes on both sides. the answer distance from the sentence type can be configured. when these records are ready, lexxe executes the query to obtain the first 100 records.
4. If a sentence contains the structure of "Thailand shares the border with" in the 100 results, N words on the right of the sentence are obtained.
5. Perform language and statistical processing on the results to obtain meaningful phrases (a group of words, such as "Laos and Myanmar ")
6. Calculate and sort meaningful words and phrases.
7. Finally, the best answer and close to the best answer will be selected as the answer to the question.
The original article is as follows:
Q: Can you briefly into strate how lexxe's short Question Answering works?

A: Let's look at "which countries does Thailand share border? "As an example. first of all, lexxe carries out a sentential conversion of the query from question to statement type. that is to get a new sentence like "Thailand shares border with which countries. "Secondly, it needs to decide what to remove from the new statement. in this case, "which countries" are the question part involving a question word and head noun, so the two words are removed. thirdly lexxe needs to know on which side and how far away the possible answers may occur. sometimes the answer may occur on one side of the statement pattern and sometimes it occurs on both sides. the distance of the answer from the pattern will also be configured. when these are ready, lexxe conducting CTS search engine retrieval and obtains the first 100 results.

Fourthly, if a sentence in the top 100 results has the pattern "Thailand shares the border with" and say up to N words on the right hand side of the pattern will be retrieved. when thly, a linguistic and statistical processing will be carried out on the result to retrieve meaningful phrases (a group of words, such as "Laos and Myanmar"), if there are any. sixly, statistically significant words and phrases will be calculated and ranked in a descending order of importance. finally, the best answer and those that are very close in score to the best one will be selected as answer to the question.

I feel that it is not clear enough. Another third-generation search engine brainboost.com is also mentioned in lexxe. You can also take a look!