Artem Golubin

It looks like this problem is specific to WIndows. The script works on my LInux and MacOS machines. I don't have a Windows machine to debug this. This problem can...

> @rushter try https://github.com/lexbor/lexbor I maintain a Python binding for Modest, lexbor is not ready to be replaced yet.

I have a pretty similar use case. I want to find all topk vectors for each vector that is already in the database. I think this can be optimized on...

I think some kind of smart ID could fix part of this problem. We need to have a numerical ID for each node, but such an ID must have one...

> I would avoid anything that requires tree traversal (up or down) This is why I called this smart ID, it should be possible to check if a child node...

There is no javascript support.

> Also can we make the `__eq__` method of LexborNode performant? As we are internally comparing html of the nodes for the equality operator, it takes huge computation time for...

That happens because you get two text nodes close to each other when removing the `strong` tag. ``` for node in tree.root.traverse(include_text=True): print(node.text(deep=False), node.tag) html head body div John p...

I get the same behavior in Chrome:  

I think adding a separate ``merge_text_nodes`` method will be sufficient.