Domain Knowledge Graph Construction Via A Simple Checker
Not on the map. Why?
Abstract (arXiv)
With the availability of large language models, there is a growing interest for semiconductor chip design companies to leverage the technologies. For those companies, deployment of a new methodology must include two important considerations: confidentiality and scalability. In this context, this work tackles the problem of knowledge graph construction from hardware-design domain texts. We propose an oracle-checker scheme to leverage the power of GPT3.5 and demonstrate that the essence of the problem is in distillation of domain expert's background knowledge. Using RISC-V unprivileged ISA specification as an example, we explain key ideas and discuss practicality of our proposed oracle-checker approach.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 8 of its 33 references that are in the map. First posted on arXiv 8 Oct 2023.
Builds on
8 of 33 references.
References · 8
- 2021On the Opportunities and Risks of Foundation Modelscited by 3,961
- 2018Multi-Task Identification of Entities, Relations, and Coreference for Scientific Knowledge Graph Constructioncited by 321
- 2021Constrained Language Models Yield Few-Shot Semantic Parserscited by 162
- 2020Break It Down: A Question Understanding Benchmarkcited by 131
- 2021Text2Event: Controllable Sequence-to-Structure Generation for End-to-end Event Extractioncited by 129
- 2022Generative Knowledge Graph Construction: A Reviewcited by 49
- 2021End-to-End NLP Knowledge Graph Constructioncited by 21
- 2023BERT Based Clinical Knowledge Extraction for Biomedical Knowledge Graph Construction and Analysiscited by 18
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.