Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | Compute the similarity of two strings as the number of matching characters divided by the total number of characters in the two strings. Matching characters are those in the longest common subsequence plus, recursively, matching characters in the unmatched region on either side of the longest common subsequence. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)52 41 54 43 4C 49 46 46 2F 4F 42 45 52 53 48 45 4C 50 50 41 54 54 45 52 4E 52 45 43 4F 47 4E 49 54 49 4F 4E |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01010010 01000001 01010100 01000011 01001100 01001001 01000110 01000110 00101111 01001111 01000010 01000101 01010010 01010011 01001000 01000101 01001100 01010000 00100000 01010000 01000001 01010100 01010100 01000101 01010010 01001110 00100000 01010010 01000101 01000011 01001111 01000111 01001110 01001001 01010100 01001001 01001111 01001110 |
HTML Code (1990) (references)R A T C L I F F / O B E R S H E L P   P A T T E R N   R E C O G N I T I O N |
ISO 10646 (1991-1993) (references)0052 0041 0054 0043 004C 0049 0046 0046 002F 004F 0042 0045 0052 0053 0048 0045 004C 0050 0050 0041 0054 0054 0045 0052 004E 0052 0045 0043 004F 0047 004E 0049 0054 0049 004F 004E |
Encryption (beginner's substitution cypher): (references)52355437464340401749363952534239465025035545439524825239374941484354434948 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
