<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">inform</journal-id><journal-title-group><journal-title xml:lang="ru">Информатика</journal-title><trans-title-group xml:lang="en"><trans-title>Informatics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1816-0301</issn><issn pub-type="epub">2617-6963</issn><publisher><publisher-name>UIIP NASB</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">inform-616</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ИНФОРМАЦИОННЫЕ ТЕХНОЛОГИИ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>INFORMATION TECHNOLOGY</subject></subj-group></article-categories><title-group><article-title>АЛГОРИТМ СИНТАКСИЧЕСКОГО АНАЛИЗА ТЕКСТА ДЛЯ ОБРАБОТКИ БОЛЬШИХ ОБЪЕМОВ ДАННЫХ</article-title><trans-title-group xml:lang="en"><trans-title></trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Чеусов</surname><given-names>А. В.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>ИП «Инвеншион Машин»</institution><country>Belarus</country></aff><pub-date pub-type="collection"><year>2007</year></pub-date><pub-date pub-type="epub"><day>14</day><month>11</month><year>2018</year></pub-date><volume>0</volume><issue>1(13)</issue><fpage>98</fpage><lpage>105</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Чеусов А.В., 2018</copyright-statement><copyright-year>2018</copyright-year><copyright-holder xml:lang="ru">Чеусов А.В.</copyright-holder><copyright-holder xml:lang="en">Чеусов А.В.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://inf.grid.by/jour/article/view/616">https://inf.grid.by/jour/article/view/616</self-uri><abstract><p>Описывается эффективный алгоритм реализации синтаксического анализа естественного языка. Представленный алгоритм используется в промышленной системе инженерии знаний и применяется для анализа английского, японского, французского и немецкого языков. Эффективность алгоритма объясняется линейной зависимостью времени его работы от длины предложения.</p></abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Connexor natural language [Electronic resource]. − 2006. − Mode of access: http://www.conexor.fi.</mixed-citation><mixed-citation xml:lang="en">Connexor natural language [Electronic resource]. − 2006. − Mode of access: http://www.conexor.fi.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">The Tagged LOB Corpus: Users’ manual / S. Johansson [et. al.]. − The Norwegian Computing Centre for the Humanities. − Norway: Bergen University, 1986.</mixed-citation><mixed-citation xml:lang="en">The Tagged LOB Corpus: Users’ manual / S. Johansson [et. al.]. − The Norwegian Computing Centre for the Humanities. − Norway: Bergen University, 1986.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Grishman, R. Computational linguistics. An introduction / R. Grishman. − United Kingdom: Cambridge University Press, 1986.</mixed-citation><mixed-citation xml:lang="en">Grishman, R. Computational linguistics. An introduction / R. Grishman. − United Kingdom: Cambridge University Press, 1986.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Link grammar parser [Electronic resource]. − 2006. − Mode of access: http://www.link.cs. cmu.edu/ link/submit-sentence-4.html.</mixed-citation><mixed-citation xml:lang="en">Link grammar parser [Electronic resource]. − 2006. − Mode of access: http://www.link.cs. cmu.edu/ link/submit-sentence-4.html.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Cheusov, A.V. The word-based regular expressions in computational linguistics / A.V. Cheusov // Proc. of the 7th International conference, Pattern Recognition and Information. – Minsk, 2003. − Vol. 1. − P. 208–213.</mixed-citation><mixed-citation xml:lang="en">Cheusov, A.V. The word-based regular expressions in computational linguistics / A.V. Cheusov // Proc. of the 7th International conference, Pattern Recognition and Information. – Minsk, 2003. − Vol. 1. − P. 208–213.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Mikheev, A. Automatic rule induction for unknown-word guessing / A. Mikheev // Computational Linguistics. – 1997. − Vol. 23, № 3. − P. 405–423.</mixed-citation><mixed-citation xml:lang="en">Mikheev, A. Automatic rule induction for unknown-word guessing / A. Mikheev // Computational Linguistics. – 1997. − Vol. 23, № 3. − P. 405–423.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">IEEE Std 1003.1−2001. Standard for Information Technology – Portable Operating System Interface (POSIX) System Interfaces, Issue 6, 2001.</mixed-citation><mixed-citation xml:lang="en">IEEE Std 1003.1−2001. Standard for Information Technology – Portable Operating System Interface (POSIX) System Interfaces, Issue 6, 2001.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Postanogov, D. Effective implementation of word-based regular expressions notation in natural language processing / D. Postanogov // Proc. of the seventh International conference, Pattern recognition and information processing. – Minsk, 2003.</mixed-citation><mixed-citation xml:lang="en">Postanogov, D. Effective implementation of word-based regular expressions notation in natural language processing / D. Postanogov // Proc. of the seventh International conference, Pattern recognition and information processing. – Minsk, 2003.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Брауэр, В. Введение в теорию конечных автоматов / В. Брауэр. − М.: Радио и связь, 1987.</mixed-citation><mixed-citation xml:lang="en">Брауэр, В. Введение в теорию конечных автоматов / В. Брауэр. − М.: Радио и связь, 1987.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Friedl, J. Mastering Regular Expressions / J. Friedl. − O’Reilly &amp; Associates, Inc., 1997.</mixed-citation><mixed-citation xml:lang="en">Friedl, J. Mastering Regular Expressions / J. Friedl. − O’Reilly &amp; Associates, Inc., 1997.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Jurafsky, D. Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition / D. Juravsky, J. Martin. − New Jersey: Prentice Hall PTR, 2000.</mixed-citation><mixed-citation xml:lang="en">Jurafsky, D. Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition / D. Juravsky, J. Martin. − New Jersey: Prentice Hall PTR, 2000.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Invention Machine [Electronic resource]. − 2006. − Mode of access: http://www.inven-tion-machine.com.</mixed-citation><mixed-citation xml:lang="en">Invention Machine [Electronic resource]. − 2006. − Mode of access: http://www.inven-tion-machine.com.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
