<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article"><front><journal-meta><journal-id journal-id-type="publisher-id">INFORMATICA</journal-id><journal-title-group><journal-title>Informatica</journal-title></journal-title-group><issn pub-type="epub">0868-4952</issn><issn pub-type="ppub">0868-4952</issn><publisher><publisher-name>VU</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">inf17210</article-id><article-id pub-id-type="doi">10.15388/Informatica.2006.139</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>Discrimination of Homographs Distorted by a Lengthy Impulsive Noise</article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Paulikas</surname><given-names>Šarūnas</given-names></name><email xlink:href="mailto:sarunas.paulikas@el.vtu.lt">sarunas.paulikas@el.vtu.lt</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><contrib contrib-type="Author"><name><surname>Navakauskas</surname><given-names>Dalius</given-names></name><email xlink:href="mailto:dalius.navakauskas@el.vtu.lt">dalius.navakauskas@el.vtu.lt</email><xref ref-type="aff" rid="j_INFORMATICA_aff_001"/></contrib><aff id="j_INFORMATICA_aff_000">Department of Telecommunications Engineering, Electronics Faculty, Vilnius Gediminas Technical University, Naugarduko 41-210, 03227 Vilnius, Lithuania</aff><aff id="j_INFORMATICA_aff_001">Department of Electronic Systems, Electronics Faculty, Vilnius Gediminas Technical University, Naugarduko 41-422, 03227 Vilnius, Lithuania</aff></contrib-group><pub-date pub-type="epub"><day>01</day><month>01</month><year>2006</year></pub-date><volume>17</volume><issue>2</issue><fpage>297</fpage><lpage>304</lpage><history><date date-type="received"><day>01</day><month>03</month><year>2005</year></date></history><abstract><p>The paper addresses the problem of discrimination of homographs when a lengthy segment of an uttered word is missing. The considered discrimination procedure is done by recognizer that operates on cepstrum coefficients extracted from the speech signal. For restoration of the missing speech segment rather than use of the known speech signal, it has been proposed to calculate speech signal characteristics: the period of fundamental frequency and intensity. By experimentation it has been shown that the polynomial approximation of speech signal characteristics improves homograph discrimination results. An extra computational burden associated with the proposed method is not high because it involves recalculation of the already extracted Fourier coefficients.</p></abstract><kwd-group><label>Keywords</label><kwd>homograph discrimination</kwd><kwd>speech recognition</kwd><kwd>speech signal processing</kwd><kwd>speech signal characteristics</kwd><kwd>restoration</kwd><kwd>approximation</kwd></kwd-group></article-meta></front></article>