About: Byte pair encoding

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Byte pair encoding Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

Byte pair encoding or digram coding is a simple form of data compression in which the most common pair of consecutive bytes of data is replaced with a byte that does not occur within that data. A table of the replacements is required to rebuild the original data. The algorithm was first described publicly by Philip Gage in a February 1994 article "A New Algorithm for Data Compression" in the C Users Journal. A variant of the technique has shown to be useful in several natural language processing (NLP) applications, such as Google's SentencePiece, and OpenAI's GPT-3.

Attributes	Values
rdfs:label	Byte pair encoding (en)
rdfs:comment	Byte pair encoding or digram coding is a simple form of data compression in which the most common pair of consecutive bytes of data is replaced with a byte that does not occur within that data. A table of the replacements is required to rebuild the original data. The algorithm was first described publicly by Philip Gage in a February 1994 article "A New Algorithm for Data Compression" in the C Users Journal. A variant of the technique has shown to be useful in several natural language processing (NLP) applications, such as Google's SentencePiece, and OpenAI's GPT-3. (en)
sameAs	Byte pair encoding Byte pair encoding
dbp:wikiPageUsesTemplate	dbt:Reflist dbt:Short_description dbt:Compression_Methods
Subject	Lossless compression algorithms
gold:hypernym	Form
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Byte_pair_encoding?oldid=1068599774&ns=0
Wikipage page ID	5825526 (xsd:integer)
page length (characters) of wiki page	3125 (xsd:nonNegativeInteger)
Wikipage revision ID	1068599774 (xsd:integer)
Link from a Wikipage to another Wikipage	Sequitur algorithm Byte Lossless compression algorithms OpenAI Data compression GPT-3 Google Natural language processing Re-Pair Recursion
has abstract	Byte pair encoding or digram coding is a simple form of data compression in which the most common pair of consecutive bytes of data is replaced with a byte that does not occur within that data. A table of the replacements is required to rebuild the original data. The algorithm was first described publicly by Philip Gage in a February 1994 article "A New Algorithm for Data Compression" in the C Users Journal. A variant of the technique has shown to be useful in several natural language processing (NLP) applications, such as Google's SentencePiece, and OpenAI's GPT-3. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Byte_pair_encoding
is Wikipage redirect of	Byte pair compression Digram coding Dual tile encoding
is Link from a Wikipage to another Wikipage of	BPE DTE List of algorithms List of archive formats GPT-3 Grammar induction Byte pair compression Digram coding Dual tile encoding
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Byte_pair_encoding

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software