paper-with-me

홈 › Papers

On Hapax Legomena and Morphological Productivity

2018-10-01 · WS 2018 10 · Janet Pierrehumbert, Ramon Granell

Quantifying and predicting morphological productivity is a long-standing challenge in corpus linguistics and psycholinguistics. The same challenge reappears in natural language processing in the context of handling words that were not seen in the training set (out-of-vocabulary, or OOV, words). Prior research showed that a good indicator of the productivity of a morpheme is the number of words involving it that occur exactly once (the \textit{hapax legomena}). A technical connection was adduced between this result and Good-Turing smoothing, which assigns probability mass to unseen events on the basis of the simplifying assumption that word frequencies are stationary. In a large-scale study of 133 affixes in Wikipedia, we develop evidence that success in fact depends on tapping the frequency range in which the assumptions of Good-Turing are violated.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Types, Tokens, and Hapaxes: A New Heap's Law

2018-12-31 · Victor Davis

Heap's Law states that in a large enough text corpus, the number of types as a function of tokens grows as $N=KM^\beta$ for some free parameters $K,\beta$. Much has been written about how this result and various generali…

Analyzing Finnish Inflectional Classes through Discriminative Lexicon and Deep Learning Models

2025-09-05 · Alexandre Nikolaev, Yu-Ying Chuang, R. Harald Baayen arxiv

Descriptions of complex nominal or verbal systems make use of inflectional classes. Inflectional classes bring together nouns which have similar stem changes and use similar exponents in their paradigms. Although inflect…

Neural Polysynthetic Language Modelling

2020-05-11 · Lane Schwartz, Francis Tyers, Lori Levin, Christo Kirov 외

Research in natural language processing commonly assumes that approaches that work well for English and and other widely-used languages are "language agnostic". In high-resource languages, especially those that are analy…

Language ModellingLemmatizationMachine Translation

The Extent of Repetition in Contract Language

2019-06-01 · WS 2019 6 · Dan Simonson, Daniel Broderick, Jonathan Herr

Contract language is repetitive (Anderson and Manns, 2017), but so is all language (Zipf, 1949). In this paper, we measure the extent to which contract language in English is repetitive compared with the language of othe…

Rank-frequency relation for Chinese characters

2013-09-06 · W. B. Deng, A. E. Allahverdyan, B. Li, Q. A. Wang

We show that the Zipf's law for Chinese characters perfectly holds for sufficiently short texts (few thousand different characters). The scenario of its validity is similar to the Zipf's law for words in short English te…

Relation