ITM Web of Conferences
Volume 6, 20166th Seminar on Industrial Control Systems: Analysis, Modeling and Computation
|Number of page(s)||4|
|Published online||25 March 2016|
The fast vocabulary-based algorithm for natural language word form analysis
Ryazan State Radioengineering University, Department of computational and applied mathematics, Ryazan
a Corresponding author: email@example.com
In the field of Natural Language Processing, identifying word forms and, more precisely, identifying part-of-speech and grammatical information for each of the words in the input text usually comprises the very first level of text processing (or immediately follows splitting the text into words, should such task be non-trivial), therefore development of approaches to speed up the word form analysis pose significant interest In (his work, by using the work  as a basis, we present an approach to analysis of word forms for natural languages with postfix inflection, following the work done in . We propose a way of representing the postfix inflection rules associated with a natural language and an algorithm for word form analysis based on it. In conclusion, we provide the benchmark data indicating the increase in speed compared to known analysis methods.
© Owned by the authors, published by EDP Sciences, 2016
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.