Results 21 to 30 of about 595,495 (293)
The alternation between exterior locative cases and postpositions in Estonian web texts
. A probabilistic grammar approach to language assumes that grammatical knowledge has a probabilistic component and that this probabilistic knowledge of language is derived from language experience. It is assumed that the extent and nature of grammatical
Jane Klavan
doaj +1 more source
Grammar Compression with Probabilistic Context-Free Grammar [PDF]
We propose a new approach for universal lossless text compression, based on grammar compression. In the literature, a target string $T$ has been compressed as a context-free grammar $G$ in Chomsky normal form satisfying $L(G) = \{T\}$. Such a grammar is often called a \emph{straight-line program} (SLP).
Hiroaki Naganuma +4 more
openaire +3 more sources
Absence of phase transition in random language model
The random language model, proposed as a simple model of human languages, is defined by the averaged model of a probabilistic context-free grammar. This grammar expresses the process of sentence generation as a tree graph with nodes having symbols as ...
Kai Nakaishi, Koji Hukushima
doaj +1 more source
Generation of Syntax Parser on South Indian Language using Bottom-Up Parsing Technique and PCFG [PDF]
In our research, we provide a statistical syntax parsing method experimented on Kannada texts, which is an official language of Karnataka, India. The dataset is downloaded from TDIL website.
M. Rajani Shree, Shambhavi B. R.
doaj +1 more source
Modern Standard Arabic Grammar Automatic Extraction from Penn 1 Arabic Treebank Using Natural Language Toolkit [PDF]
This paper presents a methodology for rule based bottom up parsing technique forModern Standard Arabic (MSA) inContext Free Grammar (CFG) formalism in Phrase Structure Grammar (PSG) representation, where the grammar isautomatically extracted from a ...
Amira Abdelhalim, Sameh Alansary
doaj +1 more source
A Password Cracking Method Based on Name Initials Shorthand Structure [PDF]
User password guess research is one of the important parts of password security research.According to the relationship between user’s personal information and user password,analyzes the structural characteristics of the user’s personal information ...
LUO Min,ZHANG Yang
doaj +1 more source
Computation of infix probabilities for probabilistic context-free grammars [PDF]
The notion of infix probability has been introduced in the literature as a generalization of the notion of prefix (or initial substring) probability, motivated by applications in speech recognition and word error correction.
Satta, Giorgio, Nederhof, Mark Jan
core +2 more sources
Probabilistic Grammars and Languages [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Relating probabilistic grammars and automata [PDF]
Both probabilistic context-free grammars (PCFGs) and shift-reduce probabilistic pushdown automata (PPDAs) have been used for language modeling and maximum likelihood parsing. We investigate the precise relationship between these two formalisms, showing that, while they define the same classes of probabilistic languages, they appear to impose different ...
Steven P. Abney +2 more
openaire +2 more sources
This paper introduces a new resource designed to facilitate the quantitative investigation of syntactic variation in spoken language from a comparative perspective.
Anette Rosenbach +5 more
doaj +2 more sources

