Thai Sentence Generation Machine Employing Fixed Patterns
Watcharapong Krukaset, Nuchjarin Krukaset, Chouvalit Khancome · 2017
In this research article, two Thai sentence generation machines for initializing story generation, is presented as a new solution. These machines employ the fixed patterns from the sentences, analyzed by a manual method. Inside the mechanisms of machines, all fixed patterns are implemented by the directed graphs. As well as, all paths of graphs are built and represented by tables. To prove the idea, the mathematical problems were selected to create 2 levels of machines called a sentence level and a word level. Experimental results showed that the correct Thai sentences could be generated efficiently from two proposed levels of machine.