Literal embedding and Graph-BERT support?

[dany-nonstop]

Hi, guys, this looks like a great start of a powerful knowledge graph embedding libraray! Thanks for sharing it!
My question is: many practical applications involve knowledge graphs with mixture of structured (knowledge graph itself) and unstructured literal data (attributes like description, name, date, and etc). Do you have any plan to support literal-enhanced embedding like LiteralE as well? thanks.
The other interesting development is Graph-BERT, where attention on local subgraph is used instead of GCN. It seems to be more scalable. Will you coonsider supporting it?
ps. both algorithms already have their source code available right now.

[zheng-da]

Thanks for your suggestions. We'll take a look at these models. We have plans to add GNN-based KGE models for knowledge graphs with node features.

[dany-nonstop]

thank you @zheng-da, you and your team's great work is highly appreciated!

[AlexMRuch]

This would be an awesome and very welcomed addition!