Multi Way Inputs Algorithm for Grammar Generation and Optimization
Keywords:
multimodal grammars, multimodal interfaces, context-free grammar, parsing valid sentences.Abstract
The high costs of development and maintenance of multimodal grammars in integrating and understanding input in multimodal interfaces lead to the investigation of novel algorithmic solutions in automating grammar generation and in updating processes. Many algorithms for context-free grammar inference have been developed in the natural language processing literature. An extension of these algorithms toward the inference of multimodal grammars is necessary for multimodal input processing. In this paper, we propose a novel grammar inference mechanism that allows us to learn a multimodal grammar from its positive samples of multimodal sentences. The algorithm first generates the multimodal grammar that is able to parse the positive samples of sentences and, afterward, makes use of two learning operators and the minimum description length metrics in improving the grammar description and in avoiding the over-generalization problem. The experimental results highlight the acceptable performances of the algorithm proposed in this paper since it has a very high probability of parsing valid sentences.
References
[1] H. Shiraz and Y. Takashima, “Multimodal definite clause grammar,” Syst. Compute. Jpn., vol. 26, no. 3, pp. 93–102, 1995.
[2] M. Johnston and S. Bangalore, “Finite-state multimodal integration and understanding,” Nat. Lang. Eng., vol. 11, no. 2, pp. 159–187, Jun. 2005.
[3] D. Reitter, E. M. Panttaja, and F. Cummins, “UI on the fly: Generating a multimodal user interface,” in Proc. HLT-NAACL, Boston, MA, 2004.
[4] Y. Sun, Y. Shi, F. Chen, and V. Chung, “An efficient multimodal language processor for parallel input strings in multimodal input fusion,” in Proc. Int. Conf. Semantic Comput., 2007, pp. 389–396.
[5] D. Angluin, “Inference of reversible languages,” J. ACM, vol. 29, no. 3, pp. 741–765, Jul. 1982.
[6] P. Garcia and E. Vidal, “Inference of k-testable languages in the strict sense and applications to syntactic pattern recognition,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 12, no. 9, pp. 920–925, Sep. 1990.
[7] J. D. Emerald, K. G. Subramanian, and D. G. Thomas, “Learning code regular and code linear languages,” in Proc. ICGI, 1996, pp. 211–221.
[10] P. Langley and S. Stromsten, “Learning context-free grammars with a simplicity bias,” in Proc. 11th ECML, 2000, pp. 220–228.
[11] K. Nakamura and T. Ishiwata, “Synthesizing context free grammars from sample strings based on inductive CYK algorithm,” in Proc. 5th Int. Colloq. Grammatical Inference, 2000, pp. 186–195.
[12] K. Nakamura and M. Matsumoto, “Incremental learning of context free grammars,” in Proc. 6th Int. Colloq. Grammatical Inference, 2002, pp. 174–184.
[13] K. Nakamura, “Incremental learning of context free grammars by extended inductive CYK algorithm,” in Proc. ECML Workshop Learn. Contex-Free Grammars, 2003, pp. 53–64.
Downloads
Published
Issue
Section
Categories
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Under this license, authors retain ownership of the copyright for their articles. By submitting to the International Journal of Advanced Research in Science, Management, and Technology (IJARSMT), authors grant the journal the right of first publication. Users are free to share, copy, and redistribute the material in any medium or format, and to adapt, remix, transform, and build upon the material for any purpose, including commercially, provided that appropriate credit is given to the original author(s) and the journal, a link to the license is provided, and any changes made are indicated.
