If I look through the stack of resolved tags, in the order collected, the pointers back to the source retain the graph structure, the parts f it where from the text came. So, the join will step and skip through a web page. This is a great advance for the search strings, they can specify general to specific ordering.
Any application that wants to step and skip through the plain text web sites can do so. Only a few lines of code, after the stack of tags is resolved, step and skipm are managed by the residual pointers.
For a lot of web sites this is great, they know the customers is reading by blocks, left to right, top to bottom. They learn how to block their text, learn hos to share word lists, under the cover, with user search applications.
No comments:
Post a Comment