67 search results - page 1 / 14 » Positive Grammar Checking: A Finite State Approach |
CICLING
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. This paper reports on the development of a finite state system for finding grammar errors without actually specifying the error. A corpus of Swedish text written by chi...
CONCUR
2004
Springer
13 years 10 months ago
2004
Springer
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
TSE
2008
13 years 4 months ago
2008
We propose an interface specification language based on grammars for modular software model checking. In our interface specification language, component interfaces are specified a...
RIA
2006
13 years 4 months ago
2006
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
CONCUR
2004
Springer
13 years 8 months ago
2004
Springer
We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finite-state specification can be reduced to a model...