See Bitap algorithm on Wiktionary
Download JSON data for Bitap algorithm meaning in All languages combined (1.6kB)
{
"forms": [
{
"form": "the Bitap algorithm",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1",
"head": "Bitap algorithm"
},
"expansion": "the Bitap algorithm",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"An algorithm that determines whether a given text contains a substring that is \"approximately equal\" to a given pattern, defined in terms of Levenshtein distance, and working by means of bitmasks."
],
"id": "en-Bitap_algorithm-en-name-HCKOnBZG",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"algorithm",
"algorithm"
],
[
"substring",
"substring"
],
[
"approximately",
"approximately"
],
[
"equal",
"equal"
],
[
"pattern",
"pattern"
],
[
"Levenshtein distance",
"Levenshtein distance"
],
[
"bitmask",
"bitmask"
]
],
"raw_glosses": [
"(computing theory) An algorithm that determines whether a given text contains a substring that is \"approximately equal\" to a given pattern, defined in terms of Levenshtein distance, and working by means of bitmasks."
],
"synonyms": [
{
"word": "Baeza-Yates-Gonnet algorithm"
}
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "Bitap algorithm"
}
{
"forms": [
{
"form": "the Bitap algorithm",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1",
"head": "Bitap algorithm"
},
"expansion": "the Bitap algorithm",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English uncountable nouns",
"en:Theory of computing"
],
"glosses": [
"An algorithm that determines whether a given text contains a substring that is \"approximately equal\" to a given pattern, defined in terms of Levenshtein distance, and working by means of bitmasks."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"algorithm",
"algorithm"
],
[
"substring",
"substring"
],
[
"approximately",
"approximately"
],
[
"equal",
"equal"
],
[
"pattern",
"pattern"
],
[
"Levenshtein distance",
"Levenshtein distance"
],
[
"bitmask",
"bitmask"
]
],
"raw_glosses": [
"(computing theory) An algorithm that determines whether a given text contains a substring that is \"approximately equal\" to a given pattern, defined in terms of Levenshtein distance, and working by means of bitmasks."
],
"synonyms": [
{
"word": "Baeza-Yates-Gonnet algorithm"
}
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "Bitap algorithm"
}
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-06-23 from the enwiktionary dump dated 2024-06-20 using wiktextract (1b9bfc5 and 0136956). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.