Access the full text.
Sign up today, get DeepDyve free for 14 days.
(1985)
Dialog s sistemoi iskusstvennogo intellekta (A Dialog with the Artificial Intelligence Sys tem), Moscow: Mos
(1998)
A Lin guistic Processor for Information Search System
(1983)
Two Level Morphology: A General Computational Model for Word Form Recognition and Production, University of Helsinki
(1973)
Avtomatizirovan nye informatsionnye sistemy (Automated
Ilya Segalovich (2003)
A Fast Morphological Algorithm with Unknown Word Guessing Induced by a Dictionary for a Web Search Engine
(2005)
Algoritmizatsia i programmirovanie na Turbo Paskale: uchebnoe posobie (Algorithmization and Programming in Turbo Pascal: A Handbook)
J. Goldsmith (1988)
The Last Phonological Rule
A.A. Zaliznayk (1977)
Grammaticheskii slovar’ russkogo yazyka
I.M. Nozhov (2000)
Trudy konfrentsii KII-2000
(2000)
Applied Morphological Analysis without a Dictionary, Trudy konfrentsii KII
D.E. Shuklin (2002)
Materialy 5-go nauchno-prakticheskogo seminara “Novye informatsionnye tekhnologii
(2006)
Methods for Searching Solutions in Linguistic Automated Learning Systems, Nauchno Tekh
M.G. Mal’kovskii (1985)
Dialog s sistemoi iskusstvennogo intellekta
(2009)
Word Form Generation and Recogni tion in Natural Languages Based on Their Sequential Transformations, Vestn
(1988)
Unsupervised Learning of the Morphol ogy of a Natural Language, in The Last Phonological Rule
K. Koskenniemi (1984)
A General Computational Model for Word-Form Recognition and Production
V.S. Novichkov, N.I. Parfilova, A.N. Pyl’kin (2005)
Algoritmizatsia i programmirovanie na Turbo Paskale: uchebnoe posobie
J. Goldsmith (2001)
Unsupervised Learning of the Morphology of a Natural LanguageComputational Linguistics, 27
(1977)
Grammaticheskii slovar’ russkogo yazyka (Grammatical Dictionary of the Russian Lan guage)
G.G. Belonogov, V.I. Bogatyrev (1973)
Avtomatizirovannye informatsionnye sistemy
A universal method for word-form recognition and generation is proposed. It includes the model of word formation in natural languages and algorithms for word-form generation and recognition. In the word-formation model, abstracting from typical notions in the morphology of natural languages takes place and word formation is reduced to transformations of the word stem by transformation chains (finite sequences). The classification of transformation chains and the algorithm for their automatic construction are discussed.
Automatic Documentation and Mathematical Linguistics – Springer Journals
Published: Nov 26, 2011
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.