Global ETD Search

1	Bidirectional parsing Andrei, Ştefan. January 2000 (has links) (PDF) Hamburg, University, Diss., 2000. Kontextfreie Grammatik
2	Syntaktische Fehlerkorrektur mit minimalen Kosten für deterministische Grammatiken May, Ralf. January 2002 (has links) (PDF) Bochum, Universiẗat, Diss., 2002. Kontextfreie Grammatik
3	Learning probabilistic grammars for language modeling Carroll, Glenn R. January 1995 (has links) Providence, RI, Brown Univ., Diss., 1995.
4	Ambiguity of context-free languages as a function of the word length Naji, Mohamed Unknown Date (has links) Univ., Diplomarbeit, 1998--Frankfurt (Main) / Englische Fassung der Diplomarbeit "Grad der Mehrdeutigkeit kontextfreier Grammatiken und Sprachen"
5	Treebank refinement optimising representations of syntactic analyses for probabilistic context-free parsing / Ule, Tylman. January 2007 (has links) Tübingen, Univ., Diss., 2007.
6	Eine Rekonstruktion der LR-Theorie zur Elimination von Redundanz mit Anwendung auf den Bau von ELR-Parsern Kannapinn, Sönke. Unknown Date (has links) (PDF) Techn. Universiẗat, Diss., 2001--Berlin.
7	Consistency of Probabilistic Context-Free Grammars Stüber, Torsten 10 May 2012 (has links) (PDF) We present an algorithm for deciding whether an arbitrary proper probabilistic context-free grammar is consistent, i.e., whether the probability that a derivation terminates is one. Our procedure has time complexity $\\\\mathcal O(n^3)$ in the unit-cost model of computation. Moreover, we develop a novel characterization of consistent probabilistic context-free grammars. A simple corollary of our result is that training methods for probabilistic context-free grammars that are based on maximum-likelihood estimation always yield consistent grammars. Kontextfreie Grammatik Probabilistische Kontextfreie Grammatik Konsistenz Verarbeitung natürlicher Sprachen Context-free Grammar Probabilistic Context-Free Grammar Consistency Natural Language Processing ddc:004 rvk:SS 5514
8	Consistency of Probabilistic Context-Free Grammars Stüber, Torsten 10 May 2012 (has links) We present an algorithm for deciding whether an arbitrary proper probabilistic context-free grammar is consistent, i.e., whether the probability that a derivation terminates is one. Our procedure has time complexity $\\\\mathcal O(n^3)$ in the unit-cost model of computation. Moreover, we develop a novel characterization of consistent probabilistic context-free grammars. A simple corollary of our result is that training methods for probabilistic context-free grammars that are based on maximum-likelihood estimation always yield consistent grammars. info:eu-repo/classification/ddc/004 ddc:004
9	Persistent arrays, path problems, and context-free languages Glier, Oliver. Unknown Date (has links) Techn. Universiẗat, Diss., 2005--Darmstadt.
10	Providing Mainstream Parser Generators with Modular Language Definition Support Karol, Sven, Zschaler, Steffen 17 January 2012 (has links) (PDF) The composition and reuse of existing textual languages is a frequently re-occurring problem. One possibility of composing textual languages lies on the level of parser specifications which are mainly based on context-free grammars and regular expressions. Unfortunately most mainstream parser generators provide proprietary specification languages and usually do not provide strong abstractions for reuse. New forms of parser generators do support modular language development, but they can often not be easily integrated with existing legacy applications. To support modular language development based on mainstream parser generators, in this paper we apply the Invasive Software Composition (ISC) paradigm to parser specification languages by using our Reuseware framework. Our approach is grounded on a platform independent metamodel and thus does not rely on a specific parser generator. kontextfreie Grammatiken Komposition Vererbung Parser-Generatoren lexikalische Zustände context-free languages composition grammar inheritance lexer states parser generators ddc:004 rvk:SS 5514

Search results