. 2025 Sep 10;15:103615. doi: 10.1016/j.mex.2025.103615

Algorithm 1.

Word shape Encoding ( $a$ ).

1	Input: the $j$ -th word in sentences ( $w_{j})$
2	Output: the $j$ -th word shape in sentences ( $a_{j}$ )
3	Initialization: array of word shape in $j$ -th word ( $a_{j k}$ )
4	for $k = 1$ to $l e n g t h (w_{j})$ do { $i t e r a t i o n s$ }
5	if $w_{j k} i s n u m e r i c$ then $a_{j k}$ =“d”
6	else if $w_{j k}$ is not alphanumericsthen $a_{j k}$ = $w_{j k}$
7	else if $w_{j k}$ is uppercasethen $a_{j k}$ =“X”
8	else if $w_{j k}$ is lowercasethen $a_{j k}$ =“x”
9	end if
12	end for