The MSO Logic-Automaton Connection in Linguistics

Morawietz, Frank; Cornell, Tom

doi:10.1007/3-540-48975-4_6

Cited by 9 publications

(8 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We note that this is unfortunately not the first negative experience of trying to apply MONA to computational linguistics tasks. Morawietz and Cornell (1999), who try to use MONA to compile logical formalisations of GB-theory, also report that automata get too large to work with.…”

Section: Discussionmentioning

confidence: 99%

Using MONA for querying linguistic treebanks

Kepser

2005

Proceedings of the Conference on Human Language Technology and Empirical Methods in Natural Language Processing - HLT '05

View full text Add to dashboard Cite

MONA is an automata toolkit providing a compiler for compiling formulae of monadic second order logic on strings or trees into string automata or tree automata. In this paper, we evaluate the option of using MONA as a treebank query tool. Unfortunately, we find that MONA is not an option. There are several reasons why the main being unsustainable query answer times. If the treebank contains larger trees with more than 100 nodes, then even the processing of simple queries may take hours.

show abstract

Section: Discussionmentioning

confidence: 99%

Using MONA for querying linguistic treebanks

Kepser

2005

Proceedings of the Conference on Human Language Technology and Empirical Methods in Natural Language Processing - HLT '05

View full text Add to dashboard Cite

show abstract

“…This view of constraints has been explored in great detail in a sub-branch of mathematical linguistics called model-theoretic syntax (Blackburn et al 1993;Backofen et al 1995;Cornell & Rogers 1998;Rogers 1998;Morawietz & Cornell 1999;Pullum 2007;Kepser 2008). The more powerful a logic, the more complex the constraints it can express.…”

Section: Set Of Structures Formulamentioning

confidence: 99%

A computational guide to the dichotomy of features and constraints

Graf

2017

Glossa: A Journal of General Linguistics

View full text Add to dashboard Cite

A contentious issue in the Minimalist literature is whether certain phenomena are best described in terms of features or constraints. Building on recent work in mathematical linguistics, I argue that constraints and features are interchangeable in Minimalist syntax. This does not invalidate the feature-constraint debate, though. Rather, the interdefinability of the two points out an unexpected loophole in the formalism that allows for massive overgeneration and produces incorrect typological predictions. At the same time, the feature-constraint equivalence can be helpful in plugging this loophole.Graf: A computational guide to the dichotomy of features and constraints Art. 18, page 3 of 36 same abstract concept. In some cases one perspective may be easier to grasp than the other, but both further our understanding of syntax. * * * * Graf: A computational guide to the dichotomy of features and constraints Art. 18, page 19 of 36 How to cite this article: Graf, Thomas. 2017. A computational guide to the dichotomy of features and constraints. Glossa: a journal of general linguistics 2(1): 18. 1-36, DOI: https://doi.

show abstract

“…It was used to verify the theory and led to the discovery of mistakes in the original formalization [39]. Provided by Frank Morawietz.…”

Section: Benchmark Formulasmentioning

confidence: 99%

“…Happily, many interesting projects fit into this niche, including hardware verification [4,1], pointer analysis [23,17], controller synthesis [44,22], natural languages [39], parsing tools [14], software design descriptions [29], Presburger arithmetic [45], and verification of concurrent systems [32,31,24,42,46].…”

Section: Introductionmentioning

confidence: 99%

MONA Implementation Secrets

Klarlund

Möller

Schwartzbach

2000

BRICS

View full text Add to dashboard Cite

The Mona tool provides an implementation of automaton-based decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in practice, even though it faces a theoretically non-elementary worst-case complexity. The implementation has matured over a period of six years. Compared to the first naive version, the present tool is faster by several orders of magnitude. This speedup is obtained from many different contributions working on all levels of the compilation and execution of formulas. We present an overview of Mona and a selection of implementation "secrets" that have been discovered and tested over the years, including formula reductions, DAGification, guided tree automata, three-valued logic, eager minimization, BDD-based automata representations, and cache-conscious data structures. We describe these techniques and quantify their respective effects by experimenting with separate versions of the Mona tool that in turn omit each of them.

show abstract

The MSO Logic-Automaton Connection in Linguistics

Cited by 9 publications

References 6 publications

Using MONA for querying linguistic treebanks

Using MONA for querying linguistic treebanks

A computational guide to the dichotomy of features and constraints

MONA Implementation Secrets

Contact Info

Product

Resources

About