| Автор | HÖGBERG, JOHANNA |
| Дата выпуска | 2011 |
| dc.description | AbstractWe present a randomised inference algorithm for regular tree languages. The algorithm takes as input two disjoint finite nonempty sets of trees 𝒫 and 𝒩 and outputs a nondeterministic finite tree automaton that accepts every tree in 𝒫 and rejects every tree in 𝒩. The output automaton typically represents a nontrivial generalisation of the examples given in 𝒫 and 𝒩. To obtain compact output automata, we use a heuristics similar to bisimulation minimisation. The algorithm has time complexity of $\ordo{\negsize \cdot \possize^2}$, where n<sub>𝒩</sub> and n<sub>𝒫</sub> are the size of 𝒩 and 𝒫, respectively. Experiments are conducted on a prototype implementation, and the empirical results appear to second the theoretical results. |
| Формат | application.pdf |
| Издатель | Cambridge University Press |
| Копирайт | Copyright © Cambridge University Press 2011 |
| Название | A randomised inference algorithm for regular tree languages |
| Тип | research-article |
| DOI | 10.1017/S1351324911000064 |
| Electronic ISSN | 1469-8110 |
| Print ISSN | 1351-3249 |
| Журнал | Natural Language Engineering |
| Том | 17 |
| Первая страница | 203 |
| Последняя страница | 219 |
| Аффилиация | HÖGBERG JOHANNA; Umeå University |
| Выпуск | 2 |
