Title :
Learning Analysis by Reduction from Positive Data Using Reverible Languages
Author_Institution :
Dept. of Software & Comput. Sci. Educ., Charles Univ., Prague
Abstract :
The analysis by reduction of P. Jancar et al (1999) is a method for checking correctness of a sentence from a natural language. To model the analysis by reduction so-called restarting automata can be used. We propose a method for learning special kind of restarting automata called single zero-reversible restarting automata (S-ZR-RRWW-automata). Interesting learning results achieved by using our implementation of the method are given. In addition the power of the model is investigated.
Keywords :
automata theory; computational linguistics; natural language processing; analysis by reduction; natural language; reversible languages; sentence correctness; zero-reversible restarting automata; Application software; Argon; Computer science education; Inference algorithms; Learning automata; Machine learning; Mathematics; Natural languages; Physics; Zirconium; analysis by reduction; learning; positive data; restarting automata; reversible languages;
Conference_Titel :
Machine Learning and Applications, 2008. ICMLA '08. Seventh International Conference on
Conference_Location :
San Diego, CA
Print_ISBN :
978-0-7695-3495-4
DOI :
10.1109/ICMLA.2008.105
