An inference algorithm for regular tree languages
2011 (English)In: Natural Language Engineering, ISSN 1351-3249, E-ISSN 1469-8110, Vol. 17, no 2, 203-219 p.Article in journal (Refereed) Published
We present a randomized inference algorithm for regular tree languages. The algorithm takes as input two disjoint finite nonempty sets of trees P and N, and outputs a nondeterministic finite tree automaton that accepts every tree in P, and rejects every tree in N. The output automaton typically represents a non-trivial generalisation of the examples given in P and N. To obtain compact output automata, we use a heuristics similar to bisimulation minimization.The algorithm has time complexity of O(|N||P|^2). Experiments are conducted on a prototype implementation, and the empirical results appear to second the theoretical results.
Place, publisher, year, edition, pages
Cambridge: Cambridge University Press , 2011. Vol. 17, no 2, 203-219 p.
algorithmic learning, natural language processing
Research subject Computing Science
IdentifiersURN: urn:nbn:se:umu:diva-40991DOI: 10.1017/S1351324911000064OAI: oai:DiVA.org:umu-40991DiVA: diva2:404089
ProjectsTree series in language technologies