Skip to main content
Log in

Grammatical analysis of languages with lexical and syntactic ambiguities

  • Published:
Automatic Documentation and Mathematical Linguistics Aims and scope

Abstract

The problem of parsing languages with lexical ambiguities is considered. An algorithm for lexical analysis is proposed that allows the correct processing of various ambiguities. For this algorithm, we propose an algorithm for parsing to make it possible to correctly process both lexical and syntactic ambiguities.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Lapshin, V.A., Lektsii po matematicheskoi lingvistike (Lectures on Mathematical Linguistics), Moscow: Nauch. Mir, 2010.

    Google Scholar 

  2. Beniaminov, E.M., Lapshin, V.A., and Perov, D.V., EZOP-Web-Service of Collective Formation of Ontology with Open Language of Conceptions and Inquiries, Trudy seminara “Znaniya i Ontologii *ELSEWHERE* 2009”, assotsiirovannogo s 17-i mezhdunarodnoi konferentsiei po ponyatiinym strukturam (Proc. Semin.’Knowledges and Ontologies ELSEWHERE 2009’ Associated with 17th Int. Conf. on Conceptual Structures), Moscow: Gos. Univ.-Vysch. Shkola Ekonom., 2009, pp. 47–56.

    Google Scholar 

  3. Beniaminov, E.M., Lapshin, V.A., and Perov, D.V., Project of Web-Server of Ontology in Web 2.0 Style, Trudy 12-i natsional’noi konferentsii po iskusstvennomu intellektu s mezhdunarodnym uchastiem (KII-2010) (Proc 12th Nat. Conf. on Artificial Intellect with Int. Participation), Tver: Tver. Gos. Tekh. Univ., 2010.

    Google Scholar 

  4. Zelenkov, Yu.G., Segalovich, Yu.A., and Titov, V.A., Probability Model of Removal of Morphologic Homonymy on the Base of Normalizing Substitutions and Position of Neighboring Words, Komp’yuternaya lingvistika i intellektual’nye tekhnologii: trudy mezhdunarodnogo seminara “Dialog 2005” (Proc. Int. Semin. ‘Dialog-2005: Computer Linguistics and Intellectual Technologies’), Moscow: Nauka, 2005.

    Google Scholar 

  5. Litvinov, M.I., Complex Method of Removal of Homonymy of Parts of Speech with the Use of Statistics of Joint Usage of Words in Russian Language, Trudy 12-i natsional’noi konferentsii po iskusstvennomu intellektu s mezhdunarodnym uchastiem (KII-2010) (Proc 12th Nat. Conf. on Artificial Intellect with Int. Participation (CII-2010)), Tver: Tver. Gos. Tekh. Univ., 2010.

    Google Scholar 

  6. Sokirko, A.V. and Toldova, S.Yu., Comparison of Effectiveness of Two Methodologies of Removal of Lexical an Morphological Umbiguity for Russian Language (Latent Markov Model and Syntactic Analyzer of Nominal Groups), Mezhdunarodnaya konferentsiya “Korpusnaya lingvistika 2004” (Proc. Int. Conf. ‘Corps Linguistics 2004’), St. Petersburg, 2004.

  7. Aycock, J. and Horspool, R.N., Schrodinger’s Token, Software, Prac. Exper., 2001, vol. 13, no. 8, pp. 803–814.

    Article  Google Scholar 

  8. Earley, J., An Efficient Context-Free Parsing Algorithm, Commun. Assoc. Comp. Machin., 1970, vol. 13, no. 2, pp. 94–102.

    MATH  Google Scholar 

  9. Lapshin, V.A., Peculiarities of Syntactical Analysis of Open Interface Context-Free Languages, Cand. Sci. (Phys.-Math.) Dissertation, Moscow, 2005.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. A. Lapshin.

Additional information

Original Russian Text © V.A. Lapshin, 2012, published in Nauchno-Tekhnicheskaya Informatsiya, Seriya 2, 2012, No. 2, pp. 24–32.

About this article

Cite this article

Lapshin, V.A. Grammatical analysis of languages with lexical and syntactic ambiguities. Autom. Doc. Math. Linguist. 46, 50–58 (2012). https://doi.org/10.3103/S0005105512010074

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0005105512010074

Keywords

Navigation