Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2801081.2801121acmotherconferencesArticle/Chapter ViewAbstractPublication PagesbciConference Proceedingsconference-collections
research-article

Natural Language Agreement in the Generation Mechanism based on Stratified Graphs

Published: 02 September 2015 Publication History

Abstract

A Stratified Graph can generate natural language constructions by acting as a transition network with arc labels referring to word categories and word forms. In this representation, each grammar rule can be transposed in a sequence of labeled paths. The generation mechanism defined by means of stratified graph uses a bottom-up approach. The advantage of this generation mechanism relies on its bottom-up approach characteristic: this mechanism never suggests constructions that are not correct based on the involved representation elements. As it will be presented, implementing syntactic agreement rules in this natural language generation mechanism can determine different results even if identical words are considered in the generation mechanism.

References

[1]
V. Boicescu, A. Filipoiu, G. Georgescu, and S. Rudeanu. Lukasiewicz-Moisil Algebra. Ann. Discrete Math., 1991.
[2]
C. Bădică, M. Colhon, and A. Şendre. Sentiment analysis of tourist reviews: Data preparation and preliminary results. In Mihaela Colhon, Adrian Iftene, Verginica Barbu Mititelu, Dan Cristea, Dan Tufiş (eds.) Proceedings of the 10th International Conference Linguistic Resources And Tools For Processing The Romanian Language, ConsILR 2014, pages 135--142, 2014.
[3]
A. Ceauşu and D. Tufiş. Addressing smt data sparseness when translating into morphologically-rich languages. Proceedings of NLPSC 2011, Special Issue Human-Machine Interaction in Translation, pages 57--68, 2011.
[4]
M. Colhon. Acquiring syntactic translation rules from a parallel treebank. Journal of Information and Library Science INFOtheca, (2):19--32, 2012.
[5]
M. Colhon. eRoL: Automatic Voice Translator for Romanian. Building Resources for a Symbolic Machine Translation Program. Universitaria Publishing House, Craiova, 2013.
[6]
D. Cristea, R. Simionescu, and G. Haja. Reconstructing the diachronic morphology of romanian from dictionary citations. Proceedings of LREC 2012, pages 923--927, 2012.
[7]
Ş. Diaconescu. Natural language agreement description for reversible grammars. Advances in Artificial Intelligence Lecture Notes in Computer Science, pages 161--172, 2003.
[8]
Ş. Vlăduţescu. Communicational basis of social networks. International Journal of Management Sciences and Business Research, (8):1--5, 2013.
[9]
G. Ştefănescu. Network Algebra (Discrete Mathematics and Theoretical Computer Science). Springer, 2002.
[10]
N. Ţăndăreanu. Knowledge bases with output. Knowledge and Information Systems, (4):438--460, 2000.
[11]
N. Ţăndăreanu. Distinguished representatives for equivalent labelled stratified graphs and applications. Discrete Applied Mathematics, pages 183--208, 2004.
[12]
N. Ţăndăreanu. Knowledge representation by labeled stratified graphs. The 8th World Multi-Conference on Systemics, Cybernetics and Informatics, July 18-21, 2004, Orlando, Florida, USA, Computer Science and Engineering, pages 345--350, 2004.
[13]
N. Ţăndăreanu. Proving the existence of labelled stratified graphs. Annals of the University of Craiova, Math. Comp. Sci. Ser., pages 81--92, 2010.
[14]
R. Dale, B. D. Eugenio, and D. Scow. Introduction to the special issue on natural language generation. Computational Linguistics, pages 345--353, 1998.
[15]
D. Dănciulescu. Systems of knowledge representation based on stratified graphs and their inference process. Proceedings of 9th International Conference on Applied Mathematics, ICAM9 (2013), 2013.
[16]
D. Dănciulescu and M. Colhon. Splitting the structured paths in stratified graphs. application in natural language generation. The "Ovidius"' University Annals of Constanta - Mathematics Series, (2):57--67, 2014.
[17]
D. Gîfu and D. Cristea. Towards an automated semiotic analysis of the romanian political discourse. Computer Science Journal of Moldova, 21(1):1--29, 2013.
[18]
F. Hristea and M. Colhon. Feeding syntactic versus semantic knowledge to a knowledge-lean unsupervised word sense disambiguation algorithm with an underlying naive bayes model. Fundamenta Informaticae Journal, (1):61--86, 2012.
[19]
D. Jurafsky and J. H. Martin. Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition. Prentice Hall PTR, 2000.
[20]
D. Radev and R. Mihalcea. Networks and natural language processing. AI MAGAZINE, 29(3):16--28, 2008.
[21]
S. Vlăduţescu and F. Smarandache. Five computational actions in information processing. Social Sciences and Education Research Review, 1(2):29--44, 2014.

Cited By

View all
  • (2019)Word-level neutrosophic sentiment similarityApplied Soft Computing10.1016/j.asoc.2019.03.03480:C(167-176)Online publication date: 1-Jul-2019
  • (2018)Recent neutrosophic models for KRP systems2018 7th International Conference on Computers Communications and Control (ICCCC)10.1109/ICCCC.2018.8390440(76-81)Online publication date: May-2018
  1. Natural Language Agreement in the Generation Mechanism based on Stratified Graphs

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    BCI '15: Proceedings of the 7th Balkan Conference on Informatics Conference
    September 2015
    293 pages
    ISBN:9781450333351
    DOI:10.1145/2801081
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    In-Cooperation

    • UCV: University of Craiova

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 02 September 2015

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. inference process
    2. labeled graph
    3. natural language generation
    4. stratified graph
    5. structured path

    Qualifiers

    • Research-article
    • Research
    • Refereed limited

    Conference

    BCI '15
    BCI '15: 7th Balkan Conference in Informatics
    September 2 - 4, 2015
    Craiova, Romania

    Acceptance Rates

    BCI '15 Paper Acceptance Rate 32 of 74 submissions, 43%;
    Overall Acceptance Rate 97 of 250 submissions, 39%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 01 Dec 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2019)Word-level neutrosophic sentiment similarityApplied Soft Computing10.1016/j.asoc.2019.03.03480:C(167-176)Online publication date: 1-Jul-2019
    • (2018)Recent neutrosophic models for KRP systems2018 7th International Conference on Computers Communications and Control (ICCCC)10.1109/ICCCC.2018.8390440(76-81)Online publication date: May-2018

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media