MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  A unified language processing methodology (2002) [2 citations — 1 self]

Download:
pdf | ps
by Teodor Rus
Theoretical Computer Science
ftp://ftp.cs.uiowa.edu/pub/rus/language5.ps
Add To MetaCart

Abstract:

This paper discusses a mathematical concept of language that models both artificial and natural languages and thus provides a framework for a unified language processing methodology. This concept of a language is regarded as a communication tool that allows language users to develop knowledges, while interacting with their universe of discourse, and to communicate with each other, while exchanging knowledges. Criteria for consistent usage of a language are established using a Galois connection between language syntax and language semantics. Solutions to ambiguity, paraphrase, attitude, and other problems concerning the relationship between syntax and semantics are addressed. A general schema for language specification is introduced and algorithms that perform language generation and language analysis are discussed as universal tools defined by the specification schema. Language transformations performed by various kinds of translators are examined and correctness criteria of these translators are defined using the language Galois connection. The paper is structured as follows: Section 1 introduces the framework and justifies the necessity of a unified methodology for language processing. Section 2 presents the mathematical concept of a language. Section 3 illustrates the mathematical concept of a language with three kinds of language structures: natural language, logical language, and programming language. Section 4 discusses the algebraic mechanism of language specification that unifies the methodology for language processing tool development. Section 5 formalizes the criterion for the consistency of the language usage, defines the architecture of a unified language processing system, and shows how the consistency criteria for language usage can be employed as correctness criteria for the algorithms performing various language transformations.

Citations

2771 Introduction to Automata Theory, Languages and Computation – Hopcroft, Ullman - 1979
1345 The Temporal Logic of Reactive and Concurrent Systems: Specification – Manna, Pnueli - 1992
997 Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications – Clarke, Emerson, et al. - 1986
722 Rewrite systems – Dershowitz, Jouannaud - 1990
638 Aspects of the Theory of Syntax – Chomsky - 1965
408 Lexical-Functional Grammar: A formal system for grammatical representation – Kaplan, Bresnan - 1982
387 Automata on infinite objects – Thomas - 1990
282 The Proper Treatment of Quantification in Ordinary English – Montague - 1973
213 Review Article: Example-Based Machine Translation – Somers - 1999
197 Algebraic specification – Wirsing - 1990
186 Graph rewriting: An algebraic and logic approach – Courcelle - 1990
134 Initial algebra semantics and continuous algebras – Goguen, Thatcher, et al. - 1977
133 Denotational semantics – Mosses - 1990
105 Revised Report on the Algorithmic Language ALGOL 60 – Naur - 1963
79 Categorical combinators, sequential algorithms and functional programming, Birkhauser – Curien - 1993
72 Lattice Theory – Birkho - 1967
66 Correctness of a compiler for arithmetic expressions – McCarthy, Painter - 1967
65 Attribute Grammars: Definition, Systems and Bibliography – Deransart, Jourdan, et al. - 1988
65 Finite Automata – Perrin - 1990
62 Montague Grammar – Partee - 1976
35 The semantic conception of truth – Tarski - 1949
28 Foundations and Applications of Montague Grammar – Janssen - 1983
25 Language as a Cognitive Process, Volume I: Syntax – Winograd - 1983
24 Programs and their proofs: an algebraic approach – Burstall, Landin - 1969
18 Compositional translation – Rosetta - 1994
17 Foundations of Computational Linguistics – Hausser - 1999
15 Semigroups and automata on infinite words – Perrin, Pin - 1985
15 Constraint-Based Grammar Formalisms: Parsing and Type Inference for Natural and Computer Languages – Shieber - 1992
14 Algebraic construction of compilers – Rus - 1991
13 The theory of algorithms – Markov - 1954
12 An Algebraic Approach to Language Translation – Knaack - 1994
12 Algebraic tools for language processing – Rus, Halverson - 1994
12 Algebraic processing of programming languages – Rus - 1998
10 Cours de linguistique generale – Saussure - 1916
9 Introduction: Grammars as mental representations of language – Bresnan, Kaplan - 1982
7 Context-free algebra – Hatcher, Rus - 1976
5 Database semantics for natural language – Hausser - 2001
5 Parsing languages by pattern matching – Rus - 1988
4 Semantic Structures. Current Studies in Linguistics Series – Jackendo - 1990
4 Algebraic translations, correctness and algebraic compiler construction – Janssen - 1998
3 S--algebra of a formal language – Rus - 1972
3 Context--free algebra: a mathematical device for compiler specification – Rus - 1976
2 Algebraic definition of programming languages – Rus - 2000
2 Generating model checkers from algebraic specifications – Rus, Wyk, et al. - 2002
1 Universal Algebra. The university series in higher mathematics – Graetzer - 1968
1 PHRASE parsers from multi-axiom grammars – Rus, Jones - 1998
1 Sel: a semantics specification language. Available at http://www.cs.uiowa/edu/~rus – Rus, Kooima - 1999