Corpus ID: 64480851

A preliminary constraint grammar for Russian

@inproceedings{Tyers2015APC,
  title={A preliminary constraint grammar for Russian},
  author={Francis M. Tyers and Robert Joshua Reynolds},
  year={2015}
}
  • Francis M. Tyers, Robert Joshua Reynolds
  • Published 2015
  • Computer Science
    • This paper presents preliminary work on a constraint grammar based disambiguator for Russian. Russian is a Slavic language with a high degree of both in-category and out-category homonymy in the inflectional system. The pipeline consists of a finite-state morphological analyser and constraint grammar. The constraint grammar is tuned to be high recall (over 0.99) at the expense of low precision. 
    View PDF
    1 Citations
    Background Citations
    1

    Figures, Tables, and Topics from this paper.

    Figures and Tables

    Explore Further: Topics Discussed in This Paper

    One Citation
    Citation Type

    Citation Type

    Russian natural language processing for computer-assisted language learning: Capturing the benefits of deep morphological analysis in real-life applications
    • 8
    • PDF

    References

    SHOWING 1-10 OF 17 REFERENCES
    Automatic word stress annotation of Russian unrestricted text
    • 5
    • PDF
    Hand-Crafted Rules
    • 15
    Designing and Evaluating a Russian Tagset
    • 57
    • Highly Influential
    • PDF
    A General Computational Model For Word-Form Recognition And Production
    • 605
    • PDF
    Combining Stochastic and Rule-Based Methods for Disambiguation in Agglutinative Languages
    • 97
    • PDF
    Serial Combination of Rules and Statistics: A Case Study in Czech Tagging
    • 90
    • PDF
    Reusing Grammatical Resources for New Languages
    • 27
    • PDF
    The Best of Two Worlds: Cooperation of Statistical and Rule-Based Taggers for Czech
    • 118
    • PDF
    Combining Hand-crafted Rules and Unsupervised Learning in Constraint-based Morphological Disambiguation
    • 48
    • PDF
    Boosting statistical tagger accuracy with simple rule-based grammars
    • 14
    • PDF