NLP Lean Programming Framework: Developing NLP Applications More Effectively
This paper presents NLP Lean Programming framework (NLPf), a new framework for creating custom Natural Language Processing (NLP) models and pipelines by utilizing common software development build systems. This approach allows developers to train and integrate domain-specific NLP pipelines into their applications seamlessly. Additionally, NLPf provides an annotation tool which improves the annotation process significantly by providing a well-designed GUI and sophisticated way of using input devices. Due to NLPf{'}s properties developers and domain experts are able to build domain-specific NLP application more effectively. Project page: \url{https://gitlab.com/schrieveslaach/NLPf} Video Tutorial: \url{https://www.youtube.com/watch?v=44UJspVebTA} (Demonstration starts at 11:40 min) This paper is related to: - Interfaces and resources to support linguistic annotation - Software architectures and reusable components - Software tools for evaluation or error analysis
Code (0)
등록된 구현이 없습니다.
Tasks
Named Entity Recognition (NER)Similar Papers 제목 키워드 기반
EvoGPT-f: An Evolutionary GPT Framework for Benchmarking Formal Math Languages
Formal mathematics is the discipline of translating mathematics into a programming language in which any statement can be unequivocally checked by a computer. Mathematicians and computer scientists have spent decades of …
Automated Theorem ProvingBenchmarkingMathMarker and source-marker reprogramming of Most Permissive Boolean networks and ensembles with BoNesis
Boolean networks (BNs) are discrete dynamical systems with applications to the modeling of cellular behaviors. In this paper, we demonstrate how the software BoNesis can be employed to exhaustively identify combinations …
Competition-Level Code Generation with AlphaCode
Programming is a powerful and ubiquitous problem-solving tool. Developing systems that can assist programmers or even generate programs independently could make programming more productive and accessible, yet so far inco…
Code GenerationLTL$_f$ Learning Meets Boolean Set Cover
Learning formulas in Linear Temporal Logic (LTLf) from finite traces is a fundamental research problem which has found applications in artificial intelligence, software engineering, programming languages, formal methods,…
Static Analysis of Logic Programs via Boolean Networks
Answer Set Programming (ASP) is a declarative problem solving paradigm that can be used to encode a combinatorial problem as a logic program whose stable models correspond to the solutions of the considered problem. ASP …