DMCA
Querying linguistic treebanks with monadic second-order logic in linear time (2004)
Cached
Download Links
- [tcl.sfs.uni-tuebingen.de]
- [tcl.sfs.nphil.uni-tuebingen.de]
- [tcl.sfs.uni-tuebingen.de]
- [www.tcl-sfs.uni-tuebingen.de]
- [www.cis.upenn.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Journal of Logic, Language, and Information |
| Citations: | 9 - 1 self |
BibTeX
@ARTICLE{Maryns04queryinglinguistic,
author = {Hendrik Maryns and Stephan Kepser},
title = {Querying linguistic treebanks with monadic second-order logic in linear time},
journal = {Journal of Logic, Language, and Information},
year = {2004},
pages = {457--470}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
MonaSearch is a new powerful query tool for linguistic treebanks. The query language of MonaSearch is monadic second-order logic, an extension of first-order logic capable of expressing probably all linguis-tically interesting queries. In order to process queries efficiently, they are compiled into tree automata. A treebank is queried by checking whether the automaton representing the query accepts the tree, for each tree. Experiments show that even complex queries can be exe-cuted very efficiently. The tree automaton toolkit MONA is used for the computation of the automata. 1
