A hybrid cross-language name matching technique using novel modified Levenshtein Distance

Research article (2015 Tenth International Conference on Computer Engineering & Systems (ICCES), 2015) · cited 20× · AI/ML

academia openalex:W2274834607

Press Enter · cited answer in seconds

A hybrid cross-language name matching technique using novel modified Levenshtein Distance

Summary

A hybrid cross-language name matching technique using novel modified Levenshtein Distance is a scholarly article^[1].

Key Facts

A hybrid cross-language name matching technique using novel modified Levenshtein Distance's instance of is recorded as scholarly article^[2].

⭐ Popularity Graph

0/100 long tail

Quick Facts

Instance of scholarly article

🔗 Connections

Authored by 3

Ahmed H. Yousef, Cherif Salama, Doaa Medhat

← Author of 3

Ahmed H. Yousef, Cherif Salama, Doaa Medhat

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

[2] ↑ A hybrid cross-language name matching technique using novel modified Levenshtein Distance — instance of (P31): scholarly article. wikidata.org.

Class ancestry

[1] ↑ A hybrid cross-language name matching technique using novel modified Levenshtein Distance is an instance of scholarly article (scholarly article) [P31, primary]. Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA

4ort.xyz Knowledge Graph. (2026). A hybrid cross-language name matching technique using novel modified Levenshtein Distance. Retrieved May 24, 2026, from https://4ort.xyz/entity/a-hybrid-cross-language-name-matching-technique-using-novel-modified-levenshtein-distance

MLA

“A hybrid cross-language name matching technique using novel modified Levenshtein Distance.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/a-hybrid-cross-language-name-matching-technique-using-novel-modified-levenshtein-distance.

BibTeX

@misc{4ortxyz_a-hybrid-cross-language-name-matching-technique-using-novel-modified-levenshtein-distance_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{A hybrid cross-language name matching technique using novel modified Levenshtein Distance}}, year = {2026}, url = {https://4ort.xyz/entity/a-hybrid-cross-language-name-matching-technique-using-novel-modified-levenshtein-distance}, note = {Accessed: 2026-05-24}}

LLM prompt

According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): A hybrid cross-language name matching technique using novel modified Levenshtein Distance — https://4ort.xyz/entity/a-hybrid-cross-language-name-matching-technique-using-novel-modified-levenshtein-distance (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/a-hybrid-cross-language-name-matching-technique-using-novel-modified-levenshtein-distance · Last refreshed: May 24, 2026