The recent success of AlphaFold  in Critical Assessment of Protein Structure Prediction (CASP) competitions (http://predictioncenter.org/) showed that the enhanced definitions of context, brought about by the advances in machine/deep learning systems, might be useful for capturing the global dependencies in protein sequences to detect interactions between residues separated in sequence space but close together in 3D space . Unsupervised learning can be used on “big" textual data through using language models with attention  and using pre-trained checkpoints from language models . Encoder-decoder architectures have also had significant impact on solving text generation and machine translation problems and were successfully applied to molecule generation problem. As NLP moves forward, the most recent approaches such as Topic-Guided VAE  and knowledge graphs with graph transformers  will easily find application in bio/cheminformatics. Recent NLP models are not domain-specific, and they can help with the generalization of models . Current studies emphasize multi-task learning, which requires the use of DNNs that share parameters to learn more information from related but individual tasks , .

Biochemical Language Processing ::: Text representation	The representation of a text (e.g. molecule or protein sequence) aims to capture syntactic, semantic or relational meaning. In the widely used Vector Space Model (VSM), a text is represented by a feature vector of either weighted or un-weighted terms . The terms of this vector may correspond to words, phrases, k-grams, characters, or dimensions in a semantic space such as in the distributed word embedding representation models. The similarity between two texts represented in the vector space model is usually computed using the cosine similarity metric , which corresponds to the cosine of the angle between the two vectors. Similarly to the one-hot encoding scheme , in the traditional bag-of-words  and term frequency-inverse document frequency (TF-IDF)  text representation models, each word corresponds to a different dimension in the vector space. Therefore, the similarity between two words in the vector space is zero, even if they are synonymous or related to each other. In the distributed representation models  on the other hand, words are represented as dense vectors based on their context. Words that occur in similar contexts have similar vector representations. In this subsection, we review these commonly used text representation models with their applications in cheminformatics.

Future Perspectives ::: Challenges ::: Interpretability	The black box nature of ML/DL methodologies makes assigning meaning to the results difficult. Explainability of an ML model is especially critical in drug discovery to facilitate the use of these findings by medicinal chemists, who can contribute to the knowledge loop. explainable-AI (XAI) is a current challenge that calls for increased interpretability of AI solutions for a given context and includes several factors such as trust, safety, privacy, security, fairness and confidence . Explainability is also critical for the domain experts to assess the reliability of new methodolodogies. Interpretability is usually classified into two categories: post-hoc (i.e. after) and ante-hoc (i.e. before). Post-hoc approaches explain the predictions of the model, whereas ante-hoc approaches integrate explainability into the model. Recent studies have already aimed to map the semantic meaning behind the models onto the biochemical description. An attentive pooling network, a two-way attention system that extends the attention mechanism by allowing input nodes to be aware of one another, is one approach that has been employed in drug-target interaction prediction .

Biochemical Language Processing ::: Identification of Words/Tokens ::: Minimum Description Length	Minimum Description Length (MDL) is an unsupervised compression-based word segmentation technique in which words of an unknown language are detected by compressing the text corpus. In a protein classification task, each protein was assigned to the family in which its sequence is compressed the most, according to the MDL-based representation .  investigated whether the MDL-based words of the proteins show similarities to PROSITE patterns  and showed that less conserved residues were compressed less by the algorithm.  also emphasized that the integration of domain knowledge, such as the consideration of the hydrophilic and hydrophobic aminoacids in the words (i.e. grammar building), might prove effective.

Biochemical Language Processing ::: Identification of Words/Tokens ::: Pattern-based words	Subsequences that are conserved throughout evolution are usually associated with protein structure and function. These conserved sequences can be detected as patterns via multiple sequence alignment (MSA) techniques and Hidden Markov Models (HMM). PROSITE , a public database that provides information on domains and motifs of proteins, uses regular expressions (i.e. RE or regex) to match these subsequences. Protein domains have been investigated for their potential of being the words of the protein language. One earlier study suggested that folded domains could be considered as “phrases/clauses" rather than “words" because of the higher semantic complexity between them . Later, domains were described as the words, and domain architectures as sentences of the language , . Protein domains were treated as the words of multi-domain proteins in order to evaluate the semantic meaning behind the domains . The study supported prior work by  suggesting that domains displayed syntactic and semantic features, but there are only a few multi-domain proteins with more than six domains limiting the use of domains as words to build sentences.

in contrast, performed the opposite task, the single-step retrosynthesis prediction, using a similar encoder-decoder model. When given a product and a reaction class, their model predicted the reactants that would react together to form that product. One major challenge in the retrosynthesis prediction task is the possibility of multiple correct targets, because more than one reactant combination could lead to the same product. Similarly to ,  also adopted a seq2seq model to translate precursors into products, utilizing the SMILES representation for the reaction prediction problem. Their model used a different attention mechanism by  and LSTMs in the encoder and decoder. By visualizing the attention weights, an atom-wise mapping between the product and the reactants could be obtained and used to understand the predictions better.  showed that seq2seq models could compete with graph neural network-based models in the reaction prediction task . A translation model was also employed to learn a data-driven representation of molecules .  translated between two textual representations of a chemical, InChi and SMILES, to extract latent representations that can integrate the semantic “meaning" of the molecule.

Biochemical Language Processing ::: Text generation ::: Machine Translation	Machine translation finds use in cheminformatics in “translation" from one language (e.g. reactants) to another (e.g. products). Machine translation is a challenging task because the syntactic and semantic dependencies of each language differ from one another and this may give rise to ambiguities. Neural Machine Translation (NMT) models benefit from the potential of deep learning architectures to build a statistical model that aims to find the most probable target sequence for an input sequence by learning from a corpus of examples , . The main advantage of NMT models is that they provide an end-to-end system that utilizes a single neural network to convert the source sequence into the target sequence.  refer to their model as a sequence-to-sequence (seq2seq) system that addresses a major limitation of DNNs that can only work with fixed-dimensionality information as input and output. However, in the machine translation task, the length of the input sequences is not fixed, and the length of the output sequences is not known in advance. The NMT models are based on an encoder-decoder architecture that aims to maximize the probability of generating the target sequence (i.e.

Machine translation models have also been recently adapted to text-based molecule generation, which start with one “language" such as that of reactants and generate a novel text in another “language" such as that of products . Below, we present recent studies on text based molecule generation. RNN models, which learn a probability distribution from a training set of molecules, are commonly used in molecule generation to propose novel molecules similar to the ones in the training data set. For instance, given the SMILES sequence “C(=O", the model would predict the next character to be “)" with a higher probability than “(". The production of valid SMILES strings, however, is a challenge because of the complicated SMILES syntax that utilizes parentheses to indicate branches and ring numbers. The sequential nature of RNNs, which may miss long range dependencies, is a disadvantage of these models . RNN descendants LSTM and GRU, which model long-term dependencies, are better suited for remembering matching rings and branch closures. Motivated by such a hypothesis,  and  successfully pioneered de novo molecule generation using LSTM architecture to generate valid novel SMILES.

further modified their model to generate target-specific molecules by integrating a target bioactivity prediction step to filter out inactive molecules and then retraining the LSTM network. In another study, transfer learning was adopted to fine-tune an LSTM-based SMILES generation model so that structurally similar leads were generated for targets with few known ligands .  and  used reinforcement learning (RL) to bias their model toward compounds with desired properties. Merk et al. ,  fine-tuned their LSTM model on a target-focused library of active molecules and synthesized some novel compounds.  explored how much of the GDB-13 database  they could rediscover by using an RNN-based generative model. The variational Auto-encoder (VAE) is another widely adopted text generation architecture .  adopted this architecture for molecule generation. A traditional auto-encoder encodes the input into the latent space, which is then decoded to reconstruct the input. VAE differs from AE by explicitly defining a probability distribution on the latent space to generate new samples.  hypothesized that the variational part of the system integrates noise to the encoder, so that the decoder can be more robust to the large diversity of molecules.

Biochemical Language Processing ::: Text generation	Text generation is a primary NLP task, where the aim is to generate grammatically and semantically correct text, with many applications ranging from question answering to machine translation . It is generally formulated as a language modeling task, where a statistical model is trained using a large corpus to predict the distribution of the next word in a given context. In machine translation, the generated text is the translation of an input text in another language. Medicinal chemistry campaigns use methods such as scaffold hopping  or fragment-based drug design  to build and test novel molecules but the chemotype diversity and novelty may be limited. It is possible to explore uncharted chemical space with text generation models, which learn a distribution from the available data (i.e. SMILES language) and generate novel molecules that share similar physicochemical properties with the existing molecules . Molecule generation can then be followed by assessing physicochemical properties of the generated compound or its binding potential to a target protein . For a comprehensive review of molecule generation methodologies, including graph-based models, we refer the reader to the review of .

Biochemical Language Processing ::: Text representation ::: Distributed representations	The one-hot encoding builds discrete representations, and thus does not consider the relationships between words. For instance, the cosine similarity of two different words is 0 even if they are semantically similar. However, if the word (i.e. 8-mer) “(C(N2C(S" frequently appears together with the word “C(C2=O)N" in SMILES strings, this might suggest that they have related “meanings". Furthermore, two words might have similar semantic meanings even though they are syntactically apart. This is where distributed vector representations come into play. The distributed word embeddings models gained popularity with the introduction of Word2Vec  and GloVe . The main motivation behind the Word2Vec model is to build real-valued high-dimensional vectors for each word in the vocabulary based on the context in which they appear. There are two main approaches in Word2Vec: (i) Skip-Gram and (ii) Continuous Bag of Words (CBOW). The aim of the Skip-Gram model is to predict context words given the center word, whereas in CBOW the objective is to predict the target word given the context words.

most likely correct translation) for the given source sequence. The first encoder-decoder architectures in NMT performed poorly as the sequence length increased mainly because the encoder mapped the source sequence into a single fixed-length vector. However, fixed-size representation may be too small to encode all the information required to translate long sequences . To overcome the issue of the fixed context vector (Figure FIGREF35a), a new method was developed, in which every source token was encoded into a memory bank independently (Figure FIGREF35b). The decoder could then selectively focus on parts of this memory bank during translation , . This technique is known as “attention mechanism" . Inspired by the successes in NMT, the first application of seq2seq models in cheminformatics was for reaction prediction by , who proposed to translate the SMILES strings of reactants and separated reagents to the corresponding product SMILES. The authors hypothesized that the reaction prediction problem can be re-modelled as a translation system in which both inputs and output are sequences. Their model used GRUs for the encoder-decoder and a Bahdanau  attention layer in between.

The challenges that SMILES syntax presents inspired the introduction of new syntax such as DeepSMILES  and SELFIES  (details in Section SECREF3). Generative Adversarial Network (GAN) models generate novel molecules by using two components: the generator network generates novel molecules, and the discriminator network aims to distinguish between the generated molecules and real molecules . In text generation models, the novel molecules are drawn from a distribution, which are then fine-tuned to obtain specific features, whereas adversarial learning utilizes generator and discriminator networks to produce novel molecules , . ORGAN , a molecular generation methodology, was built upon a sequence generative adversarial network (SeqGAN) from NLP . ORGAN integrated RL in order to generate molecules with desirable properties such as solubility, druglikeness, and synthetizability through using domain-specific rewards .

Future Perspectives ::: Opportunities	The NLP field has seen tremendous advances in the past five years, starting with the introduction of distributed word embedding algorithms such as Word2Vec  and Glove . The concept of contextualized word embeddings (i.e. ELMo) was introduced soon after . Here, the embedding of the word is not fixed, but changes according to the context (i.e. sentence) in which it appears. These advances continued with more complicated architectures such as Transformer (i.e. Generative Pre-Training or GPT)  and BERT , RoBERTa , GPT2 , Transformer-XL , and XLNet  models. Such models with a focus on context might have significant impact not only on drug discovery, but also on the protein folding problem, which is critical for predicting structural properties of the protein partner. Secondary structure , , , domain boundary  and fold  prediction studies often use sequence information in combination with similarity to available structures.

Biochemical Language Processing ::: Textual Chemical Data ::: InChI	InChI is the IUPAC International Chemical Identifier, which is a non-proprietary and open-source structural representation (inchi-trust.org) . The InChIKey is a character-based representation that is generated by hashing the InChI strings in order to shorten them. InChi representation has several layers (each) separated by the “/" symbol. The software that generates InChi is publicly available and InChi does not suffer from ambiguity problems. However, its less complex structure makes the SMILES representation easier to use as shown in a molecular generation study  and in building meaningful chemical representations with a translation-based system . Interestingly, the translation model was able to translate from InChi to canonical SMILES, whereas it failed to translate from canonical SMILES to InChi.  suggested that the complex syntax of InChi made it difficult for the model to generate a correct sequence.

showed that mapping activations of hidden neurons in feed-forward neural networks to pharmacophores, or linking atom representations computed by convolutional filters to substructures in a graph-convolution model, are possible ways of integrating explainability into AI-based drug discovery systems.  also demonstrated a novel approach that combines molecule generation and retrosynthesis prediction to generate synthesizable molecules. Integration of such solutions to drug discovery problems will not only be useful for computational researchers but also for the medicinal chemistry community.

Biochemical Language Processing ::: Text representation ::: Bag-of-words representation	In this representation model, a text is represented as a vector of bag-of-words, where the multiplicity of the words is taken into account, but the order of the words in the text is lost . For instance, the SMILES of ampicillin “CC1(C(N2C(S1)C(C2=O)NC(=O)C( C3=CC=CC=C3)N)C(=O)O)C" can be represented as a bag-of 8-mers as follows: {“CC1(C(N2", “C1(C(N2C", “1(C(N2C(", “(C(N2C(S",...,“N)C(=O)O" ,“)C(=O)O)" ,“C(=O)O)C" }. We can vectorize it as $S = [1, 1, 1, 1, ...,1, 1, 1]$ in which each number refers to the frequency of the corresponding 8-mer.

Biochemical Language Processing ::: Identification of Words/Tokens ::: Byte-Pair Encoding	Byte-Pair Encoding (BPE) generates words based on high frequency subsequences starting from frequent characters . A recent study adopted a linguistic-inspired approach to predict protein-protein interactions (PPIs) . Their model was built upon “words" (i.e. bio-words) of the protein language, in which BPE was utilized to build the bio-word vocabulary.  suggested that BPE-segmented words indicate a language-like behavior for the protein sequences and reported improved accuracy results compared to using 3-mers as words.

Exploring Chemical Space using Natural Language Processing Methodologies for Drug Discovery	Text-based representations of chemicals and proteins can be thought of as unstructured languages codified by humans to describe domain-specific knowledge. Advances in natural language processing (NLP) methodologies in the processing of spoken languages accelerated the application of NLP to elucidate hidden knowledge in textual representations of these biochemical entities and then use it to construct models to predict molecular properties or to design novel molecules. This review outlines the impact made by these advances on drug discovery and aims to further the dialogue between medicinal chemists and computer scientists.

Future Perspectives ::: Challenges ::: Benchmarking	There are several steps in the drug discovery pipeline, from affinity prediction to the prediction of other chemical properties such as toxicity, and solubility. The use of different datasets and different evaluation metrics makes the assessment of model performance challenging. Comprehensive benchmarking platforms that can assess the success of different tools are still lacking. A benchmarking environment rigorously brings together the suitable data sets and evaluation methodologies in order to provide a fair comparison between the available tools. Such environments are available for molecule generation task from MOSES  and GuacaMol . MoleculeNet is also a similar attempt to build a benchmarking platform for tasks such as prediction of binding affinity and toxicity .

Biochemical Language Processing ::: Identification of Words/Tokens	Similar to words in natural languages, we can assume that the “words" of biochemical sequences convey significant information (e.g. folding, function etc) about the entities. In this regard, each compound/protein is analogous to a sentence, and each compound/protein unit is analogous to a word. Therefore, if we can decipher the grammar of biochemical languages, it would be easier to model bio/cheminformatics problems. However, protein and chemical words are not explicitly known and different approaches are needed to extract syntactically and semantically meaningful biochemical word units from these textual information sources (i.e. sequences). Here, we review some of the most common tokenization approaches used to determine the words of biochemical languages.

Future Perspectives ::: Challenges ::: Reproducibility	Despite the focus on sharing datasets and source codes on popular software development platforms such as GitHub (github.com) or Zenodo (zenodo.org), it is still a challenge to use data or code from other groups. The use of FAIR (Findable, Accessible, Interoperable and Reusable) (meta)data principles can guide the management of scientific data . Automated workflows that are easy to use and do not require programming knowledge encourage the flow of information from one discipline to the other. Platform-free solutions such as Docker (docker.com) in which an image of the source code is saved and can be opened without requiring further installation could accelerate the reproduction process. A recent initiative to provide a unified-framework for predictive models in genomics can quickly be adopted by the medicinal chemistry community .

Biochemical Language Processing ::: Textual Chemical Data ::: DeepSMILES	DeepSMILES is a novel SMILES-like notation that was proposed to address two challenges of the SMILES syntax: (i) unbalanced parentheses and (ii) ring closure pairs . It was initially designed to enhance machine/deep-learning based approaches that utilize SMILES data as input (github.com/nextmovesoftware/deepsmiles). DeepSMILES was adopted in a drug-target binding affinity prediction task in which the findings highlighted the efficacy of DeepSMILES over SMILES in terms of identifying undetectable patterns . DeepSMILES was also utilized in a molecule generation task in which it was compared to canonical and randomized SMILES text . Here, the results suggested that DeepSMILES might limit the learning ability of the SMILES-based molecule generation models because its syntax is more grammar sensitive with the ring closure alteration and the use of a single symbol for branching (i.e. “)") introducing longer sequences.

Mol2Vec , on the other hand, was based on the identifiers of the substructures (i.e. words of the chemical) that were extracted via Extended Connectivity Fingerprint (ECFP) . The results showed a better performance with Mol2Vec than with the simple Morgan Fingerprint in a solubility prediction task, and a comparable performance to graph-based chemical representation .  also employed the Word2vec model that was trained on the fragments that are extracted from SMILES strings using a graph traversing algorithm. The results favored the distributed fragment-based ligand representation over fragment-based binary vector representation in a ring system clustering task and showed a comparable performance in the prediction of toxicity against Tetrahymena . Figure FIGREF33 illustrates the pipeline of a text-based molecule representation based on $k$-mers. FP2Vec is another method that utilizes embedding representation for molecules, however instead of the Word2Vec algorithm, it depends on a Convolutional Neural Network (CNN) to build molecule representations to be used in toxicity prediction tasks .

Figure FIGREF32 depicts the Skip-gram architecture in Word2Vec . For the vocabulary of size $V$, given the target word “2C(S", the model learns to predict two context words. Both target word and context words are represented as one-hot encoded binary vectors of size $V$. The number of neurons in the hidden layer determines the size of the embedding vectors. The weight matrix between the input layer and the hidden layer stores the embeddings of the vocabulary words. The $i^{th}$ row of the embedding matrix corresponds to the embedding of the $i^{th}$ word. The Word2Vec architecture has inspired a great deal of research in the bio/cheminformatics domains. The Word2Vec algorithm has been successfully applied for determining protein classes  and protein-protein interactions (PPI) .  treated 3-mers as the words of the protein sequence and observed that 3-mers with similar biophysical and biochemical properties clustered together when their embeddings were mapped onto the 2D space. , on the other hand, utilized BPE-based word segmentation (i.e. bio-words) to determine the words.

The authors argued that the improved performance for bio-words in the PPI prediction task might be due to the segmentation-based model providing more distinct words than $k$-mers, which include repetitive segments. Another recent study treated multi-domain proteins as sentences in which each domain was recognized as a word . The Word2Vec algorithm was trained on the domains (i.e. PFAM domain identifiers) of eukaryotic protein sequences to learn semantically interpretable representations of them. The domain representations were then investigated in terms of the Gene Ontology (GO) annotations that they inherit. The results indicated that semantically similar domains share similar GO terms. The Word2Vec algorithm was also utilized for representation of chemicals. SMILESVec, a text-based ligand representation technique, utilized Word2Vec to learn embeddings for 8-mers (i.e. chemical words) that are extracted from SMILES strings . SMILESVec was utilized in protein representation such that proteins were represented as the average of the SMILESVec vectors of their interacting ligands. The results indicated comparable performances for ligand-based and sequence based protein representations in protein family/superfamily clustering.

Biochemical Language Processing ::: Text representation ::: TF-IDF	The bag-of-words model, which is based on counting the terms of the sentence/document, might prioritize insignificant but frequent words. To overcome this issue, a weighting scheme can be integrated into the vector representation in order to give more importance to the rare terms that might play a key role in detecting similarity between two documents. One popular weighting approach is to use term frequency-inverse document frequency (TF-IDF) . TF refers to the frequency of a term in the document, and IDF denotes the logarithm of the total number of documents over the number of documents in which the term appears. IDF is therefore an indicator of uniqueness. For instance, the IDF of “C3=CC=CC" is lower than that of “(C(N2C(S", which appears in fewer compounds. Therefore, the existence of “(C(N2C(S" in a compound may be more informative. TF-IDF weigthing was utilized to assign weights to LINGOs that were extracted from SMILES in order to compute molecule similarity using cosine similarity . Molecular similarities were then used as input for drug-target interaction prediction.

In proteins, the composition of 20 different natural amino acids in varying lengths builds the protein sequences. Post-translational modifications expand this 20 letter alphabet and confer different properties to proteins . For chemicals there are several text based alternatives such as chemical formula, IUPAC International Chemical Identifier (InChI)  and Simplified Molecular Input Line Entry Specification (SMILES) . Today, the era of “big data" boosts the “learning" aspect of computational approaches substantially, with the ever-growing amounts of information provided by publicly available databases such as PubChem , ChEMBL , UniProt . These databases are rich in biochemical domain knowledge that is in textual form, thus building an efficient environment in which NLP-based techniques can thrive. Furthermore, advances in computational power allow the design of more complex methodologies, which in turn drive the fields of machine learning (ML) and NLP. However, biological and chemical interpretability and explainability remain among the major challenges of AI-based approaches. Data management in terms of access, interoperability and reusability are also critical for the development of NLP models that can be shared across disciplines.

The results indicated a statistically significant improvement with the latent representations in a ligand-based virtual screening task against fingerprint methods such as ECFP (i.e. Morgan algorithm). NMT architectures were also adopted in a protein function prediction task for the first time, in which “words" that were extracted from protein sequences are translated into GO identifiers using RNNs as encoder and decoder . Although exhibiting a comparable performance to the state-of-the-art protein function prediction methods, the authors argued that the performance of the model could be improved by determining more meaningful “words" such as biologically interpretable fragments. Transformer is an attention-based encoder-decoder architecture that was introduced in NMT by . Although similar to previous studies , ,  in terms of adopting an encoder-decoder architecture, Transformer differs from the others because it only consists of attention and feed-forward layers in the encoder and decoder. As transformers do not contain an RNN, positional embeddings are needed to capture order relationships in the sequences.  were the first to adopt the Transformer architecture in cheminformatics and designed a Molecular Transformer for the chemical reaction prediction task. The Molecular Transformer, which was atom-mapping independent, outperformed the other algorithms (e.g.

However, the authors also reported that the non-context free property of SMILES caused by matching ring numbers and parentheses might often lead the decoder to generate invalid SMILES strings. A grammar variational auto-encoder (GVAE), where the grammar for SMILES is explicitly defined instead of the auto-encoder learning the grammar itself, was proposed to address this issue . This way, the generation is based on the pre-defined grammar rules and the decoding process generates grammar production rules that should also be grammatically valid. Although syntactic validity would be ensured, the molecules may not have semantic validity (chemical validity).  built upon the VAE  and GVAE  architectures and introduced a syntax-directed variational autoencoder (SD-VAE) model for the molecular generation task. The syntax-direct generative mechanism in the decoder contributed to creating both syntactically and semantically valid SMILES sequences.  compared the latent representations of molecules generated by VAE, GVAE, and SD-VAE, and showed that SD-VAE provided better discriminative features for druglikeness.  proposed an adversarial AE for the same task. Conditional VAEs ,  were trained to generate molecules conditioned on a desired property.

Combined with the transferability of contextual word representation models, multi-task learning can also provide solutions to drug discovery which has many interwoven tasks, such as chemical property prediction and molecule generation. Language has an important power, not only for daily communication but also for the communication of codified domain knowledge. Deciphering the meaning behind text is the primary purpose of NLP, which inevitably has found its way to bio/cheminformatics. The complicated nature of biochemical text makes understanding the semantic construction of the hidden words all the more challenging and interesting. The applications we discussed in this review provide a broad perspective of how NLP is already integrated with the processing of biochemical text. A common theme in all of these applications is the use of AI-based methodologies that drive and benefit from the NLP field. Novel advances in NLP and ML are providing auspicious results to solving long-standing bio/cheminformatics problems. With this review, we have summarized the impact of NLP on bio/cheminformatics to encourage this already interdisciplinary field to take advantage of recent advances. The communication between researchers from different backgrounds and domains can be enhanced through establishing a common vocabulary toward common goals. This review has been an attempt to facilitate this conversation.

Biochemical Language Processing ::: Textual Chemical Data ::: SMARTS	SMiles ARbitrary Target Specification (SMARTS) is a language that contains specialized symbols and logic operators that enable substructure (pattern) search on SMILES strings . SMARTS can be used in any task that requires pattern matching on a SMILES string such as, querying databases or creating rule dictionaries such as RECAP  and BRICS  to extract fragments from SMILES (daylight.com/dayhtml/doc/theory/theory.smarts.html).

On the other hand, text based representations of biochemical entities are more readily available as evidenced by the 19,588 biomolecular complexes (3D structures) in PDB-Bind  (accessed on Nov 13, 2019) compared with 561,356 (manually annotated and reviewed) protein sequences in Uniprot  (accessed on Nov 13, 2019) or 97 million compounds in Pubchem  (accessed on Nov 13, 2019). The advances in natural language processing (NLP) methodologies make processing of text based representations of biomolecules an area of intense research interest. The discipline of natural language processing (NLP) comprises a variety of methods that explore a large amount of textual data in order to bring unstructured, latent (or hidden) knowledge to the fore . Advances in this field are beneficial for tasks that use language (textual data) to build insight.

Biochemical Language Processing ::: Textual Chemical Data ::: SELFIES	SELF-referencIng Embedding Strings (SELFIES) is an alternative sequence-based representation that is built upon “semantically constrained graphs" . Each symbol in a SELFIES sequence indicates a recursive Chomsky-2 type grammar, and can thus be used to convert the sequence representation to a unique graph. SELFIES utilize SMILES syntax to extract words that will correspond to semantically valid graphs (github.com/aspuru-guzik-group/selfies).  compared SELFIES, DeepSMILES and SMILES representations in terms of validity in cases where random character mutations are introduced. The evaluations on the QM9 dataset yielded results in the favor of SELFIES.

OpenSMILES (opensmiles.org/opensmiles.html) is a new platform that aims to universalize the SMILES notation. In isomeric SMILES, isotopism and stereochemistry information of a molecule is encoded using a variety of symbols (“/", “\", “@", “@@").

Biochemical Language Processing ::: Textual Chemical Data ::: SMILES	The Simplified Molecular Input Entry Specification (SMILES) is a text-based form of describing molecular structures and reactions . SMILES strings can be obtained by traversing the 2D graph representation of the compound and therefore SMILES provides more complex information than the chemical formula. Moreover, due to its textual form, SMILES takes 50% to 70% less space than other representation methods such as an identical connection table (daylight.com/dayhtml/doc/theory/theory.smiles.html). SMILES notation is similar to a language with its own set of rules. Just like it is possible to express the same concept with different words in natural languages, the SMILES notation allows molecules to be represented with more than one unique SMILES. Although this may sound like a significant ambiguity, the possibility of using different SMILES to represent the same molecule was successfully adopted as a data augmentation strategy by various groups (, , ). Canonical SMILES can provide a unique SMILES representation. However, different databases such as PubChem and ChEMBL might use different canonicalization algorithms to generate different unique SMILES.

Biochemical Language Processing ::: Textual Chemical Data ::: IUPAC name	The International Union of Pure and Applied Chemistry (IUPAC) scheme (i.e. nomenclature) is used to name compounds following pre-defined rules such that the names of the compounds are unique and consistent with each other (iupac.org/).

The languages in the domains of bioinformatics and cheminformatics can be investigated under three categories: (i) natural language (mostly English) that is used in documents such as scientific publications, patents, and web pages, (ii) domain specific language, codified by a systematic set of rules extracted from empirical data and describing the human understanding of that domain (e.g. proteins, chemicals, etc), and (iii) structured forms such as tables, ontologies, knowledge graphs or databases . Processing and extracting information from textual data written in natural languages is one of the major application areas of NLP methodologies in the biomedical domain (also known as BioNLP). Information extracted with BioNLP methods is most often shared in structured databases or knowledge graphs . We refer the reader to the comprehensive review on BioNLP by . Here, we will be focusing on the application of NLP to domain specific, unstructured biochemical textual representations toward exploration of chemical space in drug discovery efforts. We can view the textual representation of biomedical/biochemical entities as a domain-specific language. For instance, a genome sequence is an extensive script of four characters (A, T, G, C) constituting a genomic language.

Biochemical Language Processing ::: Textual Chemical Data ::: Chemical Formula	The chemical formula is one of the simplest and most widely-known ways of describing chemicals using letters (i.e. element symbols), numbers, parentheses, and (-/+) signs. This representation gives information about which elements and how many of them are present in the compound.

Biochemical Language Processing ::: Textual Chemical Data	Information about chemicals can be found in repositories such as PubChem , which includes information on around 100 million compounds, or Drugbank , which includes information on around 10,000 drugs. The main textual sources used in drug discovery are textual representations of chemicals and proteins. Table TABREF39 lists some sources that store different types of biochemical information. Chemical structures can be represented in different forms that can be one-dimensional (1D), 2D, and 3D. Table TABREF40 depicts different identifiers/representations of the drug ampicillin. While the 2D and 3D representations are also used in ML based approaches , here we focus on the 1D form, which is the representation commonly used in NLP.

Biochemical Language Processing	The language-like properties of text-based representations of chemicals were recognized more than 50 years ago by Garfield . He proposed a “chemico-linguistic" approach to representing chemical nomenclature with the aim of instructing the computer to draw chemical diagrams. Protein sequence has been an important source of information about protein structure and function since Anfinsen's experiment . Alignment algorithms, such as Needleman-Wunsh  and Smith-Waterman , rely on sequence information to identify functionally or structurally critical elements of proteins (or genes). To make predictions about the structure and function of compounds or proteins, the understanding of these sequences is critical for bioinformatics tasks with the final goal of accelerating drug discovery. Much like a linguist who uses the tools of language to bring out hidden knowledge, biochemical sequences can be processed to propose novel solutions, such as predicting interactions between chemicals and proteins or generating new compounds based on the level of understanding. In this section, we will review the applications of some of the NLP-concepts to biochemical data in order to solve bio/cheminformatics problems.

Introduction ::: NLP Basics	 describes NLP on three levels: (i) the word level in which the smallest meaningful unit is extracted to define the morphological structure, (ii) the sentence level where grammar and syntactic validity are determined, and (iii) the domain or context level in which the sentences have global meaning. Similarly, our review is organized in three parts in which bio-chemical data is investigated at: (i) word level, (ii) sentence (text) level, and (iii) understanding text and generating meaningful sequences. Table TABREF37 summarizes important NLP concepts related to the processing of biochemical data. We refer to these concepts and explain their applications in the following sections. All NLP technology relates to specific AI architectures. In Table TABREF38 W-we summarize the main ML and deep learning (DL) architectures that will be mentioned throughout the review.

With this review, we aim to provide an outline of how the field of NLP has influenced the studies in bioinformatics and cheminformatics and the impact it has had over the last decade. Not only are NLP methodologies facilitating processing and exploitation of biochemical text, they also promise an “understanding" of biochemical language to elucidate the underlying principles of bimolecular recognition. NLP technologies are enhancing the biological and chemical knowledge with the final goal of accelerating drug discovery for improving human health. We highlight the significance of an interdisciplinary approach that integrates computer science and natural sciences.

Acknowledgement	This work is partially supported by TUBITAK (The Scientific and Technological Research Council of Turkey) under grant number 119E133. HO acknowledges TUBITAK-BIDEB 2211 scholarship program and thanks Gökçe Uludoğan for her comments on figures. EO thanks Prof. Amedeo Caflisch for hosting her at the University of Zurich during her sabbatical.

Biochemical Language Processing ::: Textual Chemical Data ::: SMIRKS	SMIRKS notation can be used to describe generic reactions (also known as transforms) that comprise one or more changes in atoms and bonds (https://daylight.com/daycgi_tutorials/smirks_examples.html). These transforms are based on “reactant to product" notation, and thus make use of SMILES and SMARTS languages. SMIRKS is utilized in tasks such as constructing an online transform database  and predicting metabolic transformations . A recent study achieves a similar performance to rule-based systems in classifying chemical reactions by learning directly from SMILES text with transforms via neural networks .

A similar performance between TF-IDF weighted LINGO and a graph-based chemical similarity measurement was obtained.  used TF-IDF weighting on chemical bonds to show that bonds with higher TF-IDF scores have a higher probability of breaking.

Future Perspectives ::: Challenges ::: Bias in data	The available data has two significant sources of bias, one related to the limited sampling of chemical space and the other related to the quality and reproducibility of the data. The lack of information about some regions of the protein/chemical landscape limits the current methodologies to the exploitation of data rather than full exploration. The data on protein-compound interactions is biased toward some privileged molecules or proteins because the protein targets are related to common diseases or the molecules are similar to known actives. Hence, not all of chemical space is sampled, and chemical space is expanded based on the similarity of an active compound to others, which is also referred to as inductive bias . Data about proteins or molecules related to rare diseases is limited and inactive molecules are frequently not reported. Moreover, some experimental measurements that are not reproducible across different labs or conditions limit their reliability .  and  have recently discussed the bias factors in dataset composition. Zhang and Lee have also addressed the sources of bias in the data and proposed to use Bayesian deep learning to quantify uncertainty.

Future Perspectives ::: Challenges	The major challenges that can be observed from investigating these studies can be summarized as follows: (i) the need for universalized benchmarks and metrics, (ii) reproducibility of the published methodologies, (iii) bias in available data, and (iv) biological and chemical interpretability/explainability of the solutions.

Future Perspectives	The increase in the biochemical data available in public databases combined with the advances in computational power and NLP methodologies have given rise to a rapid growth in the publication rate in bio/cheminformatics, especially through pre-print servers. As this interdisciplinary field grows, novel opportunities come hand in hand with novel challenges.

based on a two-step convolutional graph neural network ) on commonly used benchmark data sets. Transformer architecture was also adopted to learn representations for chemicals in prediction of drug-target interactions  and molecular properties  in which the proposed systems either outperformed the state-of-the-art systems or obtained comparable results.

CNN architectures have also been utilized for drug-target binding affinity prediction  and drug-drug interaction prediction  to build representations for chemicals from raw SMILES strings, as well as for protein fold prediction  to learn representations for proteins from amino-acid sequences. SMILES2Vec adopted different DL architectures (GRU, LSTM, CNN+GRU, and CNN+LSTM) to learn molecule embeddings, which were then used to predict toxicity, affinity and solubility . A CNN+GRU combination was better at the prediction of chemical properties. A recent study compared several DL approaches to investigate the effect of different chemical representations, which were learned through these architectures, on a chemical property prediction problem . The authors also combined DL architectures that were trained on SMILES strings with the MACCS fingerprint, proposing a combined representation for molecules (i.e. CheMixNet). The CheMixNet representation outperformed the other representations that were trained on a single data type such as SMILES2Vec (i.e. SMILES) and Chemception (i.e. 2D graph) .

Biochemical Language Processing ::: Text representation ::: One-hot representation	In one-hot representation, for a given vocabulary of a text, each unique word/character is represented with a binary vector that has a 1 in the corresponding position, while the vector positions for the remaining words/characters are filled with 0s . One-hot encoding is fast to build, but might lead to sparse vectors with large dimensions based on the size of the vocabulary (e.g. one million unique words in the vocabulary means one million dimensional binary vectors filled with zeros except one). It is a popular choice, especially in machine learning-based bio/cheminformatic studies to encode different types of information such as SMILES characters , , atom/bond types ,  and molecular properties .

Bag-of-words representation was used in molecular similarity computation, in which the SMILES string and the LINGOs extracted from it were treated as the sentence and words, respectively . The unique LINGOs were considered for each pair and a Tanimoto coefficient was used to measure the similarity . Another approach called SMILES Fingerprint (SMIfp) also adopted bag-of-words to create representations of molecules for a ligand-based virtual screening task . SMIfp considered 34 unique symbols in SMILES strings to create a frequency-based vector representation, which was utilized to compute molecular similarity. SMIfp provided comparable results to a chemical representation technique that also incorporated polar group and topological information, as well as atom and bond information, in recovering active compounds amongst decoys .

Biochemical Language Processing ::: Identification of Words/Tokens ::: @!START@$k$@!END@-mers (@!START@$n$@!END@-grams)	One of the simplest approaches in NLP to extract a small language unit is to use $k$-mers, also known as $n$-grams. $k$-mers indicate $k$ consecutive overlapping characters that are extracted from the sequence with a sliding window approach. “LINGO", which is one of the earliest applications of $k$-mers in cheminformatics, is the name of the overlapping 4-mers that are extracted from SMILES strings . 4-mers of the SMILES of ampicillin, “CC1(C(N2C(S1)C(C2=O)NC(=O)C(C3=CC=CC=C3)N)C(=O)O)C", can be listed as { `CC1(', `C1(C', `1(C(', ..., `O)O)', `)O)C' }. From a sequence of length $l$, a total of $(l-n)+1$ $k$-mers can be extracted.

The results indicate that three of the ligand representation approaches provide similar performances for protein family clustering. To the best of our knowledge, there is no comprehensive evaluation of the different word extraction techniques except a comparison by  of the performance of BPE-based words against $k$-mers in a PPI prediction task. Such comparison would provide important insights to the bio/cheminformatics community.

Protein domains and motifs have also been utilized as words in different drug discovery tasks such as the prediction of drug-target interaction affinity , . These studies showed that motifs and domains together contribute to the prediction as much as the use of the full protein sequence. SMARTS is a well-known regex-based querying language that is used to identify patterns in a SMILES string. SMARTS has been utilized to build specific rules for small-molecule protonation , to design novel ligands based on the fragments connected to the active site of a target , and to help generate products in reaction prediction . MolBlocks, a molecular fragmentation tool, also adopted SMARTS dictionaries to partition a SMILES string into overlapping fragments . Furthermore, MACCS  and PubChem  Fingerprints (FP) are molecular descriptors that are described as binary vectors based on the absence/presence of substructures that are predefined with SMARTS language. A recent study on protein family clustering uses a ligand-centric representation to describe proteins in which ligands were represented with SMILES-based (i.e. 8-mers) representation, MACCS and Extended Connectivity Fingerprint (ECFP6) .

Biochemical Language Processing ::: Identification of Words/Tokens ::: Maximum Common Substructure	 investigated organic chemistry as a language in an interesting study that extracts maximum common substructures (MCS) from the 2D structures of pairs of compounds to build a vocabulary of the molecule corpus. Contrary to the common idea of functional groups (e.g. methyl, ethyl etc.) being “words" of the chemical language, the authors argued that MCSs (i.e. fragments) can be described as the words of the chemical language . A recent work investigated the distribution of these words in different molecule subsets . The “words" followed Zipf's Law, which indicates the relationship between the frequency of a word and its rank (based on the frequency) , similar to most natural languages. Their results also showed that drug “words" are shorter compared to natural product “words".

Biochemical Language Processing ::: Identification of Words/Tokens ::: Longest Common Subsequences	The identification of the longest common subsequence (LCS) of two sequences is critical for detecting their similarity. When there are multiple sequences, LCSs can point to informative patterns. LCSs extracted from SMILES sequences performed similarly well to 4-mers in chemical similarity calculation .

100-mer, 120-mer) with 30 amino-acid gaps. The use of segmented protein sequences yielded better results than using the whole protein sequence, and important and conserved subsequences were highlighted. $k$-mers were also used as features, along with position specific score matrix features, in the protein fold prediction problem .

Extracting LINGOs from SMILES is a simple yet powerful idea that has been successfully used to compute molecular similarities, to differentiate between bioisosteric and random molecular pairs  and in a drug-target interaction prediction task , without requiring 2D or 3D information. The results suggested that a SMILES-based approach to compute the similarity of chemicals is not only as good as a 2D-based similarity measurement, but also faster . $k$-mers were successfully utilized as protein  and chemical words  in protein family classification tasks. 3-mers to 5-mers were often considered as the words of the protein sequence.  reported that some 5-mers could be matched to motifs and protein words are most likely a mixture of different $k$-mers. For the protein function prediction task,  decided to choose among the 1000 most frequent words to build the protein vocabulary, whereas  utilized each $k$-mer type separately and showed that 4-mers provided the best performance. In the latter work, instead of using the whole protein sequence, the words were extracted from different length protein segments, which are also long $k$-mers (i.e.

Introduction	The design and discovery of novel drugs for protein targets is powered by an understanding of the underlying principles of protein-compound interaction. Biochemical methods that measure affinity and biophysical methods that describe the interaction in atomistic level detail have provided valuable information toward a mechanistic explanation for bimolecular recognition . However, more often than not, compounds with drug potential are discovered serendipitously or by phenotypic drug discovery  since this highly specific interaction is still difficult to predict . Protein structure based computational strategies such as docking , ultra-large library docking for discovering new chemotypes , and molecular dynamics simulations  or ligand based strategies such as quantitative structure-activity relationship (QSAR) , , and molecular similarity  have been powerful at narrowing down the list of compounds to be tested experimentally. With the increase in available data, machine learning and deep learning architectures are also starting to play a significant role in cheminformatics and drug discovery . These approaches often require extensive computational resources or they are limited by the availability of 3D information.

Question: Are this models usually semi/supervised or unsupervised?
Answer: Both supervised and unsupervised, depending on the task that needs to be solved.