Grammaticality checking devices in the SA-Model
Sosei Aniya · Institutional Repositories DataBase (IRDB) · 2002
This paper addresses a problem with a grammaticality checking device in the SA-Model (Aniya, 2001), a working model which is an extension of ideas developed and formalized in Lexically Based Algebra (Brame and Kim, 1998). The problem is spelled out as: Specifically, how does the model determine whether or not a language fragment violates a grammatical condition? Since the SA-Model aims at providing an integrated system of grammar, it should internalize a self-governed device for checking well-formedness or grammaticality. To this end, I offer an algebra-oriented solution in Section 3. In the course of pursuing the solution, possible problems come into view, such as: What happens to a language fragment after its production?, How are grammatical conditions formally defined?, and Is there a relation between/among grammatical conditions? Those problems are essential. Therefore, they will be discussed and given lexically-based algebraic explanations in Section 4.