Efficient Encoding of Inflection Rules in NLP Systems

Clicks: 377
ID: 96775
2012
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Star

Ranked #1 of 2 articles by views in scientific bulletin of the ''petru maior" university of tîrgu mureș

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
The grammatical parsing unit is a core module in natural language processing engines. This unit determines the grammatical roles of the incoming words and it converts the sentences into semantic models. A special grammar rule in agglutinative languages is the inflection rule. The traditional, automata-based parsers are usually not very effective in the parsing of inflection transformations. The paper presents implementation alternatives and compares them from the viewpoint of time efficiency and accuracy. The prototype system was tested with examples from Hungarian.
Reference Key
barabss2012efficientscientific Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors BARABÁSS, Péter;KOVÁC, László;
Journal scientific bulletin of the ''petru maior" university of tîrgu mureș
Year 2012
DOI
DOI not found
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.