MediaWiki Code2Code Search: Neural Retrieval for the Semantic Discovery of Open-Source Software Entities

• URL: http://arxiv.org/abs/2607.26766v1
• Date: Wed, 29 Jul 2026 11:07:07 GMT
• Title: MediaWiki Code2Code Search: Neural Retrieval for the Semantic Discovery of Open-Source Software Entities
• Abstract summary: We present Code2 InformationCode Search, a neural retrieval system for semantic code-to-code discovery.<n>By 1.29 million structural (functions, types, and templates) Code across 2,500+ large repositories, our system enables retrieval based on computational intent.<n>We employ a split-build architecture, decouplingintensive offline indexing from a CPU-only serving layer.
• Score: 0.5279475826661643
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Code search in large-scale ecosystems is often hindered by the lexical gap between user queries and implementation details, alongside the trade-off between the low latency of traditional Information Retrieval (IR) and the precision of Deep Learning (DL). We present MediaWiki Code2Code Search, a neural retrieval system for semantic code-to-code discovery. By indexing 1.29 million structural entities (functions, types, and templates) across 2,500+ MediaWiki repositories, our system enables retrieval based on computational intent rather than surface tokens. We employ a split-build architecture, decoupling GPU-intensive offline indexing from a CPU-only serving layer; our FAISS IVF-PQ index occupies 168.6 MB: a 96.6\% reduction compared to a flat float32 baseline, and achieves a median query latency of 1.85 seconds on commodity hardware, satisfying the 6 GiB RAM constraint of Wikimedia Toolforge. Our evaluation across a 27-query benchmark demonstrates superior performance over the BM25 baseline, achieving a P@10 of 0.87 compared to 0.64 (0.52 versus 0.34 for strict matching). Gains are most pronounced in name-obfuscated tasks where lexical methods fail. The system is available at https://code2codesearch.toolforge.org under the Apache 2.0 licence and provides an open RESTful API.

Related papers

• Natural Language Code Retrieval for 1C:Enterprise: An Open Benchmark and Efficient Bi-Encoder [0.0]
  We present an open benchmark of 3,413 real-world, PII-scrubbed query-code pairs.<n>We fine-tune on 784,057 synthetic triplets generated by google/gemma-4-26B-A4B-it from public code repositories.
  arXiv  Detail & Related papers  (2026-08-20T12:24:53Z)
• Consensus-gated Multi-Agent Neural Architecture Search for Seismic Fault Segmentation [0.17188280334580194]
  Neural networks for seismic fault segmentation are often borrowed from computer vision and medical imaging domains.<n>Classical neural architecture search (NAS) is restricted to hand-crafted search spaces and large compute budgets.<n>We present an agentic NAS system in which a panel of three large language models (Claude, GPT-5.1, and Gemini2.5Pro) debates each candidate architecture to unanimous consensus.
  arXiv  Detail & Related papers  (2026-08-14T02:41:37Z)
• Resource-Efficient Iterative LLM-Based NAS with Feedback Memory [49.44875022114861]
  Neural Architecture Search (NAS) automates network design, but conventional methods demand substantial computational resources.<n>We propose a closed-loop pipeline leveraging large language models (LLMs) to iteratively generate, evaluate, and refine convolutional neural network architectures.
  arXiv  Detail & Related papers  (2026-03-12T16:00:22Z)
• Hierarchical Embedding Fusion for Retrieval-Augmented Code Generation [6.4453302264198165]
  We present Hierarchical Embedding Fusion (HEF), a two-stage approach to repository representation for code completion.<n>HEF achieves exact-match accuracy comparable to snippet-based retrieval baselines.<n>Compared to graph-based and iterative retrieval systems, HEF reduces median end-to-end latency by 13 to 26 times.
  arXiv  Detail & Related papers  (2026-02-04T14:56:11Z)
• Infini-gram mini: Exact n-gram Search at the Internet Scale with FM-Index [110.90283601829724]
  We present infini-gram mini, a system that can make petabyte-level text corpora searchable.<n>Based on the FM-index data structure, our system creates indexes with size only 44% of the corpus.<n>We show one important use case in a large-scale analysis of benchmark contamination.
  arXiv  Detail & Related papers  (2025-06-13T21:13:57Z)
• Revisiting Code Search in a Two-Stage Paradigm [67.02322603435628]
  TOSS is a two-stage fusion code search framework. It first uses IR-based and bi-encoder models to efficiently recall a small number of top-k code candidates. It then uses fine-grained cross-encoders for finer ranking.
  arXiv  Detail & Related papers  (2022-08-24T02:34:27Z)
• EAutoDet: Efficient Architecture Search for Object Detection [110.99532343155073]
  EAutoDet framework can discover practical backbone and FPN architectures for object detection in 1.4 GPU-days. We propose a kernel reusing technique by sharing the weights of candidate operations on one edge and consolidating them into one convolution. In particular, the discovered architectures surpass state-of-the-art object detection NAS methods and achieve 40.1 mAP with 120 FPS and 49.2 mAP with 41.3 FPS on COCO test-dev set.
  arXiv  Detail & Related papers  (2022-03-21T05:56:12Z)
• Lightweight Salient Object Detection in Optical Remote Sensing Images via Feature Correlation [93.80710126516405]
  We propose a novel lightweight ORSI-SOD solution, named CorrNet, to address these issues. By reducing the parameters and computations of each component, CorrNet ends up having only 4.09M parameters and running with 21.09G FLOPs. Experimental results on two public datasets demonstrate that our lightweight CorrNet achieves competitive or even better performance compared with 26 state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-01-20T08:28:01Z)
• Towards Improving the Consistency, Efficiency, and Flexibility of Differentiable Neural Architecture Search [84.4140192638394]
  Most differentiable neural architecture search methods construct a super-net for search and derive a target-net as its sub-graph for evaluation. In this paper, we introduce EnTranNAS that is composed of Engine-cells and Transit-cells. Our method also spares much memory and computation cost, which speeds up the search process.
  arXiv  Detail & Related papers  (2021-01-27T12:16:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.