Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 10 of 10 for “"Probabilistic Context-Free Grammar"”.
-
Semantic Similarity Detection in Natural Language Documents
… A third method views the English language as a probabilistic context-free grammar (PCFG), and extracts semantic information from individual sentences in order to detect documents containing intellectual property. Test results on 5 document sets show the proposed methods give at least 84% true …
-
Improving the Eco-system of Passwords
… correctly, whole-string Markov models outperform Probabilistic Context Free Grammar models. Secondly, we improve password policies and practice used by websites by studying how to best check weak passwords. We model different password strength checking methods as Password Ranking Algorithms …
-
Creating Domain Specific Resources For Building Semantic Role Labling System For Operative Notes
… parser adaption. Next, an existing unlexicalized probabilistic context-free grammar (PCFG) parser, the Stanford PCFG parser, was adapted to clinical text for better syntactic parsing performance. Finally, domain specific predicate structure (PAS) frames were created for operative notes, as …
-
Effective Use of Cross-Domain Parsing in Automatic Speech Recognition and Error Detection
… a self-training approach to directly improve the probabilistic context-free grammar (PCFG) model used in parsing, as well as a novel model combination method using a discriminative log-linear model to augment the generative PCFG. We apply both methods to ASR rescoring and error detection tasks. We …
-
Automated Annotation and Visualization of Rhetorical Figures
… in HTML format. We have applied a lexicalized probabilistic context-free grammar parser for the recognition of the figures of repetition. We also describe a simple parse tree distance used for calculating the difference between similarly structured phrases, which is necessary for the …
-
Unsupervised learning of probabilistic grammars
<p>Probabilistic grammars define joint probability distributions over sentences and their grammatical structures. They have been used in many areas, such as natural language processing, bioinformatics and pattern recognition, mainly for the purpose of deriving grammatical structures from data …
-
MECA: Mathematical Expression Based Post Publication Content Analysis
… (AST) is constructed in the second phase using probabilistic context-free grammar. Tree rewriting will transform the AST into ME objects in the third phase. Built upon the two layers of ME extraction and semantics modeling work, next we explore one of the bonding relationships between words and …
-
Network Traffic Analysis Using Stochastic Grammars
… network traffic. In this work, we use stochastic grammars, hidden Markov models (HMMs) and probabilistic context-free grammars (PCFGs), as pattern recognition tools for traffic analysis. HMMs are widely used for pattern recognition and detection. We use a HMM inference approach. With inferred …
-
Joint Perceptual Learning and Natural Language Acquisition for Autonomous Robots
… robots is addressed through novel techniques in grammar induction and word grounding to the perceptual world. The learning is achieved in a cognitively plausible loosely-supervised manner from raw linguistic and visual data. The visual data is collected using different robotic platforms deployed …
-
Syntaktický analyzátor pro český jazyk
Diplomová práce popisuje teoretický návrh a vytvoření syntaktického analyzátoru pro český jazyk pracujícího s frázovým přístupem ke stavbě věty. Využívaná frázová syntaxe je založena na slovních druzích, které jsou sdružovány do větších slovních celků - frází. Implementovaný program pracuje s …