A unifying approach to HTML wrapper representation and learning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1967, Issue , 2000, Pages 50-64

  Grieser, Gunter ^a   Jantke, Klaus P ^b   Lange, Steffen ^c   Thomas, Bernd ^d  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

^c UNIVERSITY OF LEIPZIG   (Germany)

^d Universität Koblenz ^*  (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL; LEARNING SYSTEMS;

ELEMENTARY FORMAL SYSTEMS; INDUCTIVE LEARNING TECHNIQUES; INFORMATION SOURCES; LEARNABILITY; LEARNING APPROACH; REPRESENTATION FORMALISMS;

HTML;

EID: 84974730912     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44418-1_5     Document Type: Conference Paper

References (18)

1. D. Angluin, ‘Inductive inference offormal languages from positive data’, Information and Control, 45, 117-135, (1980).
2. D. Angluin and C.H. Smith, ‘A survey ofinductive inference: Theory and methods’, Computing Surveys, 15, 237-269, (1983).
3. S. Arikawa, S. Miyano, A. Shinohara, T. Shinohara, and A. Yamamoto, ‘Algorithmic learning theory with elementary formal systems’, IEICE Trans. Inf. & Syst., E75-D(4), 405-414, (1992).
4. S. Arikawa, T. Shinohara, and A. Yamamoto, ‘Elementary formal systems as a unifying frameworkfor language learning’, in Proc SecondInt. Workshop on Computational Learning Theory, pp. 312-327. Morgan Kaufmann, (1989).
5. S. Arikawa, T. Shinohara, and A. Yamamoto, ‘Learning elementary formal systems’, Theoretical Computer Science, 95, 97-113, (1992).
6. M.E. Gold, ‘Language identification in the limit’, Information and Control, 14, 447-474, (1967).
7. J.E. Hopcroft and J.D. UUman, Formal Languages and their Relation to Automata, Addison-Wesley, (1969).
8. N. Kushmerick, Wrapper Inductionfor Information Extraction, Ph.D. thesis, University of Washington, (1997).
9. V. Lifschitz, ‘Foundations oflogic programming’, in G. Brewka (ed.), Principles of knowledge representation, pp. 69-127, CSLI Publications, (1996).
10. S. Miyano, A. Shinohara, and T. Shinohara, ‘Polynomial-timelearning ofelemen-tary formal systems’, New Generation Computing, 18, 217-242, (2000).
11. T. Shinohara, ‘Rich classes inferable from positive data: Length-bounded elementary formal systems’, Information and Computation, 108, 175-186, (1994).
12. R.M. SmuUyan, Theory of Formal Systems, Annals of Mathematical Studies, No. 47, Princeton University, (1961).
13. S. Soderland, ‘Learning information extraction rules from semi-structured and free text’, Machine Learning, 34, 233-272, (1999).
14. B. Thomas, ‘Anti-unification based learning ofT-Wrappers for information extraction’, in Proc ofAAAI Workshop on Machine LearningforIE, pp. 15-20. AAAI, (1999).
15. B. Thomas, ‘Logic programs for intelligent web search’, in Proc ofInt. Symposium on Methodologies for Intelligent Systems, Lecture Notes in Artificial Intelligence 1609, pp. 190-198. Springer-Verlag, (1999).
16. A. Yamamoto, ‘Elementary formal systems as a logic programming language’, in Proc Logic Programming, Lecture Notes in Artificial Intelligence 485, pp. 73-86. Springer-Verlag, (1989).
17. C. Zeng and S. Arikawa, ‘Applying inverse resolution to EFS language learning’, in Proe Int. Conferencefor Young Computer Scientists, pp. 480-487. Int. Academic Publishers, (1999).
18. T. Zeugmann and S. Lange, ‘A guided tour across the boundaries of learning recursive languages’, in K.P. Jantke and S. Lange (eds), Algorithmic Learningfor Knowledge-Based Systems, Lecture Notes in Artificial Intelligence 961, pp. 190-258. Springer-Verlag, (1995).