Modelling highly inflected languages

DOI10.1016/j.ins.2003.12.004zbMath1078.68794OpenAlexW2107833031MaRDI QIDQ1886781

Zdravko Kačič, Mirjam Sepesy Maučec, Bogomir Horvat

Publication date: 19 November 2004

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2003.12.004

zbMATH Keywords

Approximate string matchingMixture-based modelPerplexityStatistical language modellingTopic similarityVector-space retrieval model

Mathematics Subject Classification ID

Natural language processing (68T50)

Related Items (2)

Parallel comparison of run-length-encoded strings on a linear systolic array ⋮ On principal component analysis, cosine and Euclidean measures in information retrieval

Uses Software

• CMU

Cites Work

• Unnamed Item
• A Mathematical Theory of Communication
• On scale and concentration invariance in entropies.
• Extraction and representation of contextual information for knowledge discovery in texts

This page was built for publication: Modelling highly inflected languages