Given a braid element in B_n, searching for a shortest braid word representative (using the band-generators) is called the Shortest Braid Problem. Up to braid index n = 4, this problem has been solved by Kang, Ko, and Lee in 1997. In this talk I will discuss recent development of this problem for braid index 5 or higher. I will also show diagrammatic computational technique of the Left Canonical Form of a given braid, that is a key to the three fundamental problems in braid theory; the Word Problem, the Conjugacy Problem and the Shortest Word Problem. This is joint work with Rebecca Sorsen and Michele Capovilla-Searle.