• DocumentCode
    2004514
  • Title

    A Systematical Natural Language Model by Abstract Algebra

  • Author

    Wang, Yufeng

  • Author_Institution
    Univ. of Sci. & Technol. Beijing, Beijing
  • fYear
    2007
  • fDate
    May 30 2007-June 1 2007
  • Firstpage
    1273
  • Lastpage
    1277
  • Abstract
    Consider over the problem of the lack of systematical model in the field of natural language processing. Suppose natural language system is a dynamic system consists of a subsystem of the finite semantic group acting on a subsystem of the language expression semigroup, the concatenation semigroup. Describe such a systematical natural language model in part. Analyze the symmetry property of natural languages. Establish the subsystem of the semantic group. Analyze the relation among the subsystems. Apply this model to the explanation for routine natural language from a new view, for example, to the explanation for the common understanding on untidy sentences, or the explanation for the principle of full interpretation. In the end, the capacity of the explanation proves the rationality of this systematical natural language model.
  • Keywords
    computational linguistics; natural language processing; process algebra; abstract algebra; concatenation semigroup; finite semantic group; language expression semigroup; natural language processing; principle of full interpretation; systematical natural language model; Abstract algebra; Automatic control; Automation; Cognitive science; Handicapped aids; Humans; Natural language processing; Natural languages; Prototypes; Sun; artificial psychology; group; language model; natural language processing; semigroup;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control and Automation, 2007. ICCA 2007. IEEE International Conference on
  • Conference_Location
    Guangzhou
  • Print_ISBN
    978-1-4244-0818-4
  • Electronic_ISBN
    978-1-4244-0818-4
  • Type

    conf

  • DOI
    10.1109/ICCA.2007.4376566
  • Filename
    4376566